17-10-11模拟赛

T1:

Code:

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define MN 10000105
#define MP 665000
using namespace std;
bool vis[MN];
int pri[MP];
long long n,T;
int pos,t,cnt=0;
inline int in(){
    int x=0;bool f=0; char c;
    for (;(c=getchar())<'0'||c>'9';f=c=='-');
    for (x=c-'0';(c=getchar())>='0'&&c<='9';x=(x<<3)+(x<<1)+c-'0');
    return f?-x:x;
}
inline int getp(int n){
    cnt=0;pri[0]=1;
    for (int i=2;i<=n;++i){
        if (!vis[i]) pri[++cnt]=i;
        for (int j=1;i*pri[j]<=n&&j<=cnt;++j){
            vis[i*pri[j]]=1;
            if (!(i%pri[j])) break;
        }
    }
}
int main()
{
    getp(10000020);scanf("%lld",&T);while (T--){
        scanf("%lld",&n);if (n<=1) {printf("-1
");continue;}
        t=(int)sqrt(n);pos=lower_bound(pri+1,pri+cnt+1,t)-pri;
        if (pri[pos]>t) --pos;
        printf("%d
",pos+2);
    }return 0;
}

T2:

Code:

#include<cstdio>
#include<cstring>
#include<algorithm>
#define inf 0x7fffffff
#define MN 1002
using namespace std;
inline int in(){
    int x=0;bool f=0; char c;
    for (;(c=getchar())<'0'||c>'9';f=c=='-');
    for (x=c-'0';(c=getchar())>='0'&&c<='9';x=(x<<3)+(x<<1)+c-'0');
    return f?-x:x;
}
struct que{
    int q[MN],id[MN];
    int head,tail;
    inline void pushmax(int x,int y){
        while (head<=tail&&x>q[tail]) --tail;
        ++tail;q[tail]=x,id[tail]=y;
    }
    inline void pushmin(int x,int y){
        while (head<=tail&&x<q[tail]) --tail;
        ++tail;q[tail]=x,id[tail]=y;
    }
    inline void pop(int x){
        while (head<=tail&&id[head]<=x) ++head;
    }
}mx[MN],mn[MN],mxc,mnc;
int c[MN][MN];
int n,m,a,b,cnt=0,res,dif;
int main()
{
    freopen("anchorman.in","r",stdin);
    freopen("anchorman.out","w",stdout);
    n=in();m=in();a=in();b=in();res=inf,cnt=0;
    for (int i=1;i<=n;++i)
    for (int j=1;j<=m;++j) c[i][j]=in();
    for (int i=1;i<=n;++i)
    mx[i].head=mn[i].head=1,mx[i].tail=mn[i].tail=0;
    for (int i=1;i<=n;++i)
    for (int j=1;j<b;++j)
    mx[i].pushmax(c[i][j],j),mn[i].pushmin(c[i][j],j);
    for (int j=b;j<=m;++j){
        mxc.head=mnc.head=1;mxc.tail=mnc.tail=0;
        for (int i=1;i<=n;++i){
            mx[i].pushmax(c[i][j],j);mx[i].pop(j-b);
            mn[i].pushmin(c[i][j],j);mn[i].pop(j-b);
            mxc.pushmax(mx[i].q[mx[i].head],i);mxc.pop(i-a);
            mnc.pushmin(mn[i].q[mn[i].head],i);mnc.pop(i-a);
            dif=mxc.q[mxc.head]-mnc.q[mnc.head];
            if (i>=a) if (dif==res) ++cnt;
            else if (dif<res) res=dif,cnt=1;
        }
    }printf("%d %d",res,cnt);return 0;
}