2017 JUST Programming Contest 3.0

最新推荐文章于 2018-04-07 10:26:00 发布
最新推荐文章于 2018-04-07 10:26:00 发布
阅读量871 收藏
点赞数
分类专栏： 比赛题解 手速练习
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/nike0good/article/details/78422201
版权

A A Very Hard Question

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
int main()
{
//  freopen("A.in","r",stdin);
//  freopen(".out","w",stdout);

    int T=read();
    while(T--) {
        double y=read(),x=read();
        printf("%.0lf\n",floor(y/(1+x/100.0)));
    }


    return 0;
}

B Linear Algebra Test

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (1234567)
ll a[MAXN],b[MAXN];
map<int,int> S;
int main()
{
//  freopen("B.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    while(T--) {
        int n=read();
        ll ans=0;
        For(i,n) {
            a[i]=read(),b[i]=read();
        }
        S.clear();
        For(i,n) {
            if (S.count(b[i])) S[b[i]]++;
            else S[b[i]]=1;
        }
        For(i,n) {
            ans+=S[a[i]];
        }
        cout<<ans<<endl;
    }




    return 0;
}

C Ahmad and Spells

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (123456)
ll a[MAXN],b[MAXN],c[MAXN],d[MAXN];
pair<ll,ll> p[MAXN],p2[MAXN];
int main()
{
//  freopen("c.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    while(T--) {
        ll n=read(),m=read(),k=read();
        ll x=read(),s=read();
        For(i,m) {
            a[i]=read();
        }
        For(i,m) {
            b[i]=read();
        }
        For(i,k) {
            c[i]=read();
        }
        For(i,k) {
            d[i]=read();
        }
        int cnt2=0;
        For(i,k) {
            if (d[i]<=s) {
                p2[++cnt2]=mp(d[i],c[i]);
            }
        }
        p2[++cnt2]=mp(0,0);
        sort(p2+1,p2+1+cnt2);
        Fork(i,2,cnt2) {
            p2[i].se=max(p2[i].se,p2[i-1].se);
        }

        ll ans=n*x,cnt=0;
        For(i,m) {
            if (b[i]<=s)
                p[++cnt]=mp(b[i],a[i]*n);
        }
        p[++cnt]=mp(0,n*x);
        sort(p+1,p+1+cnt);

        int j=cnt2;
        For(i,cnt) {
            while(p2[j].fi+p[i].fi>s) --j;
            gmin(ans, p[i].se - (p[i].se/n)*p2[j].se );

        }
        cout<<ans<<endl;
    }
    return 0;
}

D Dice Game

注意1的情况

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (12345)
ll a[MAXN];
vi e[MAXN];
int t[MAXN]={0,6,5,4,3,2,1};
int dis[MAXN][7]={};
void bfs() {
    queue< pi  >q; 
    MEMI(dis)
    q.push(mp(0,1) );
    dis[0][1]=0;
    while(!q.empty()) {
        pi x=q.front();q.pop();
        for(int v:e[x.se]) {
            int p1=x.fi+v,p2=v;
            if (p1<=10000)
                if (dis[p1][p2]==INF) {
                    dis[p1][p2]=dis[x.fi][x.se]+1;
                    q.push(mp(p1,p2));
                }
        }
    }
}
int ans[MAXN];
int main()
{
//  freopen("J.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    For(i,6) For(j,6) {
        if (i!=j &&i!=t[j]) {
            e[i].pb(j);
        }
    }
    bfs();
    For(i,10000) {
        ans[i]=dis[i][1];
        For(j,5) gmin(ans[i],dis[i][j+1]);
        if (ans[i]==INF)ans[i]=-1;
    }
    while(T--) {
        int n=read();
        cout<<ans[n]<<endl;
    }




    return 0;
}

E The Architect Omar

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (1234)
int a[MAXN];
char s[MAXN];
int main()
{
//  freopen("B.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    while(T--) {
        int n=read();
        ll ans=0;
        MEM(a)
        For(i,n) {
            scanf("%s",s);
            a[s[0]]++;
        }
        ans=min(a['b']/2,min(a['l'],a['k']));
        cout<<ans<<endl;
    }




    return 0;
}

F Building Numbers

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (123456)
ll a[MAXN]={};
int main()
{
//  freopen("f.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    while(T--) {
        int n=read(),q=read();
        For(i,n) {
            ll p;a[i]=0;
            scanf("%lld",&p);
            while(p>1) {
                if (p&1) a[i]++,p--;
                p/=2LL; ++a[i];
            }
//          cout<<a[i]<<' ';
        }
        Fork(i,2,n) a[i]+=a[i-1];
        For(i,q) {
            int l=read(),r=read();
            printf("%lld\n",-a[l-1]+a[r]);
        }
    }




    return 0;
}

G Most Common Suffix

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (123456)
ull seed=123;
char s[MAXN];
int g[MAXN];
#define MOD (7000003)
ull h[MOD],t[MOD]={},tcase=0;
int v[MOD];
int ha(ull c) {
    int p=c%MOD;
    while(t[p]==tcase && h[p]!= c) p=(p+1)%MOD;
    if (t[p]!=tcase || h[p]!=c) {
        t[p]=tcase;
        h[p]=c;
        v[p]=1;
    }else v[p]++;
    return v[p];
}
int main()
{
//  freopen("G.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    while(T--) {
        tcase++;
        int n=read(),q=read();
        MEM(g) 
        For(i,n) {
            scanf("%s",s+1);
            int len=strlen(s+1);
            ull h=0;
            ForD(j,len) {
                h=h*seed+s[j];
                int p2=len-j+1;
                int l=ha(h);
                gmax(g[p2],l);
            }
        }
        For(i,q) {
            printf("%d\n",g[read()]);
        }
    }
    return 0;
}

H Eyad and Math

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (1234)
int a[MAXN];
char s[MAXN];
int main()
{
//  freopen("B.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    while(T--) {
        double a=read(),b=read(),c=read(),d=read();
        double p=b*log(a),p2=d*log(c);
        if (p<p2) puts("<");else puts(">");
    }




    return 0;
}

I Move Between Numbers

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (300)
ll a[MAXN][11];
int f[MAXN][MAXN],n;
char s[MAXN];
int dis[MAXN]={};
int bfs(int s,int t) {
    if (s==t) return 0;
    queue<int >q; 
    MEMI(dis)
    q.push(s);dis[s]=0;
    while(!q.empty()) {
        int x=q.front();q.pop();
        For(j,n) if (f[x][j]&&dis[j]==INF) {
            dis[j]=dis[x]+1;
            q.push(j);
            if (j==t) return dis[j];
        }
    }
    return -1;
}
int x,y;
int main()
{
//  freopen("i.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    while(T--) {
        n=read(),x=read(),y=read();
        MEM(a)
        For(i,n) {
            scanf("%s",s+1);
            For(j,20) {
                a[i][s[j]-'0']++;
            }
        }
        For(i,n) {
            Fork(j,i+1,n) {
                int p=0;
                Rep(k,10) p+=min(a[i][k],a[j][k]);
                if (p==17) f[i][j]=1;else f[i][j]=0;
                f[j][i]=f[i][j];
            }
        }
        cout<<bfs(x,y)<<endl;
    }
    return 0;
}

J Boxes Game

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (1234)
ll a[MAXN],f[MAXN][MAXN][2];
ll calc(int i,int j,int k) { //k=0 xianshouI
    if (f[i][j][k]!=-1E12) {
        return f[i][j][k];
    }
    if (i==j) {
        if (!k) return a[i];else return -a[i];
    }
    if (!k) f[i][j][k]=max(calc(i,j-1,k^1)+a[j],calc(i+1,j,k^1)+a[i]);
    else f[i][j][k]=min(calc(i,j-1,k^1)-a[j],calc(i+1,j,k^1)-a[i]);
    return f[i][j][k];
}
int main()
{
//  freopen("J.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    while(T--) {
        int n=read();
        For(i,n) a[i]=read();
        For(i,n) For(j,n) Rep(k,2) f[i][j][k]=-1e12;
        printf("%lld\n",calc(1,n,0));
    }
    return 0;
}

K Malek and Summer Semester

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (1234567)
ll a[MAXN],b[MAXN];
int main()
{
//  freopen("B.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    while(T--) {
        int n=read();
        double m;cin>>m;
        ll ans=0,p=0;
        For(i,n) {
            a[i]=read();
            p+=a[i]>=50;
        }
        puts(p>=ceil(n*m)?"YES":"NO");
    }




    return 0;
}

L Roads and Tracks

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (1000000000000000000LL)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (30000)
#define MAXM (30)
ll a[MAXN][MAXM];
ll b[MAXN][MAXM]={};
pair<ll,ll > dis[MAXN][MAXM];
int main()
{
//  freopen("L.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    while(T--) {
        MEM(b)
        ll n=read(),m=read();
        For(i,n) For(j,m) a[i][j]=read();
        For(i,n) For(j,m-1) b[i][j]=read();
        For(i,n+1) For(j,m) dis[i][j]=mp(INF,INF);
        dis[1][1]=mp(0,0);
        Fork(i,2,m) {
            dis[1][i]=mp(0,dis[1][i-1].se+b[1][i-1]);
        }
        For(i,n) {
            Fork(j,2,m) b[i][j]+=b[i][j-1];
        }
        For(i,n) {
            For(j,m) {
                For(k,m) {
                    ll c=0;
                    if (j<k) c=b[i+1][k-1]-b[i+1][j-1];
                    else if (j>k) c=b[i+1][j-1]-b[i+1][k-1];
                    gmin(dis[i+1][k],mp(dis[i][j].fi +a[i][j] ,dis[i][j].se+c) );
                }           
            }
        }
        pair<ll,ll> ans=dis[n+1][1];
        For(j,m) gmin(ans,dis[n+1][j] );
        printf("%lld %lld\n",ans.fi,ans.se);


    }
    return 0;
}
nike0good
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
ProgrammingContest
03-09
编程竞赛是IT行业中一个充满挑战和乐趣的领域，它涵盖了各种算法、数据结构以及高效的编程技巧。Python作为一门简洁易学、功能强大的编程语言，在编程竞赛中被广泛使用。本篇将深入探讨Python在编程竞赛中的应用，...
2017 JUST Programming Contest 3.0 J. Boxes Game
swunHJ的博客
06-06 292
Link:https://codeforces.com/gym/101502/problem/J Solution:很有意思的一道博弈区间DP 首先区间dp是显然的，dp[i][j]表示在区间[i, j]先手者的最大得分 然后用一点min-max search的思想，我想最大，要让对手尽可能小 例如dp[1][n]可以由两种状态转移而来 : dp[2][n] 和 dp[1][n-1] 这...
2017 JUST Programming Contest 3.0 I. Move Between Numbers
Bryce1010's Blog
10-08 681
I. Move Between Numbers time limit per test 2.0 s memory limit per test 256 MB input standard input output standard output You are given n magical numbers a1, a2, ..., a
2017 JUST Programming Contest 3.0 K. Malek and Summer Semester
Bryce1010's Blog
10-07 608
K. Malek and Summer Semester time limit per test 1.0 s memory limit per test 256 MB input standard input output standard output Malek registered n courses for the summer
Gym - 101502I最短路变形（2017 JUST Programming Contest 3.0 I. Move Between Numbers）
行云出岫
03-24 608
题目链接：http://codeforces.com/gym/101502/problem/I 题目： I. Move Between Numbers You are given n magical numbers a1, a2, …, an, such that the lengt...
2017 Wuhan University Programming Contest --Lost in WHU
Whata_free的博客
04-10 512
As one of the most beautiful campus in China, Wuhan University is around several hills, so the road is complex and visitors always lose themselves. Give a undirected graph of WHU of NN N points and
UCF Local Programming Contest 2017 I. Rotating Cards
01-20
题意： 有一堆数字 1 n1~n1 n 的卡片，你需要按照数字 1 n1~n1 n 的顺序将他们删去。你只能删去最上面的那张卡片，但你可以将最上面的卡片移动到最底部，也可以将最底部的卡片移动到最上面，问移动次数最少是...
Nafis' Programming Contest Judge Tool-开源
05-07
《Nafis' Programming Contest Judge Tool：开源的力量与无限可能》 编程竞赛是技术爱好者们展示才华、提升技能的重要舞台，而Nafis' Programming Contest Judge Tool正是一款专为此类活动设计的利器。这款工具以其...
java-programming-contest.zip_java programming
09-24
这个名为"java-programming-contest.zip"的压缩包显然是为准备Java编程竞赛而设计的，其中包含了一份文档——"竞赛java编程题50题(有答案).doc"。这份文档很可能包含了50个不同的编程题目，每个题目都旨在测试参赛者...
2017 JUST Programming Contest 3.0 H. Eyad and Math
Bryce1010's Blog
10-08 633
H. Eyad and Math time limit per test 2.0 s memory limit per test 256 MB input standard input output standard output Eyad was given a simple math problem, but since he is
United Kingdom and Ireland Programming Contest 2017 B
AC_jie的博客
04-07 638
codeforces.com/gym/222400 题意是有一个饼干，这个饼干是标准的一个多边形，然后给这个饼干上的顶点，然后问要是将他放入一个杯子中的话，这个杯子的最小直径是多少？ 一开始的第一反应是两点之间的最远距离，但是TD说了可以将饼干竖起来之后的想法，就想到了旋转卡壳算法，然而并不知道旋转卡壳是干什么的，计算几何这块太差了。一定赶紧补起来。 那就先拿今天的这几个题来练一练。 因为...
2017 JUST Programming Contest 3.0 D. Dice Game
Bryce1010's Blog
10-08 1060
D. Dice Game time limit per test 1.0 s memory limit per test 256 MB input standard input output standard output A dice is a small cube, with each side having a different
2017 JUST Programming Contest 4.0
傻傻分不清、
10-24 589
A 题意：求所有区间的&和 思路：我们统计二进制中每一位的贡献，很显然如果连续一段区间二进制中某一位都为1，那么这个区间的任何子区间都满足答案，所以我们直接统计满足条件的子区间个数即可 #include #include #include #include #include #include #include #include #include #include #inc
2017 JUST Programming Contest 3.0 B. Linear Algebra Test
Bryce1010's Blog
10-08 883
B. Linear Algebra Test time limit per test 3.0 s memory limit per test 256 MB input standard input output standard output Dr. Wail is preparing for today's test in linea
（又是一个奇葩题目）Happy Programming Contest
无奈滴微笑
05-09 866
题目链接：http://openoj.awaysoft.com:8080/judge/contest/view.action?cid=421#problem/H 题意: N个题目,每个题目有个完成时间,有个价值,现在给定时间t,求最大完成数量,最小完成时间,最大价值. 注意先将背包排序，这里纠结了好久，而且要双重排序.... #include #include #include st
实操：VRRP配置实验演练演示.mp4
07-09
基于华为模拟器ENSP
基于深度强化学习的钢琴和声自动自适应系统.pdf
最新发布
07-09
基于深度强化学习的钢琴和声自动自适应系统.pdf
实操：MSTP配置演练演示.mp4
07-09
基于华为模拟器ENSP
IMG_20240709_145418.jpg
07-09
IMG_20240709_145418.jpg
2019 Sichuan Province Programming Contest
04-01
As an AI language model, I don't have the latest information on the 2019 Sichuan Province Programming Contest. However, I suggest checking official websites of the contest organizers, such as the ...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值