Codeforces Round #552 (Div. 3) (A,B,C,D,E,F,G)

题目链接:http://codeforces.com/contest/1154

第一题(模拟)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e2+100;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int a[4],mv=-1e9;
int main(){
    rep(i,0,4) {cin>>a[i];mv=max(mv,a[i]);}
    rep(i,0,4){
        if(mv-a[i]) cout<<mv-a[i]<<" ";
    }

    return 0;
}

第二题(模拟) 

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e2+100;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,a[maxn];
int main(){
    cin>>n;
    rep(i,0,n) cin>>a[i];
    sort(a,a+n);n=unique(a,a+n)-a;
    if(n==1){
        puts("0");
    }else if(n==2){
        if((a[1]-a[0])%2) cout<<a[1]-a[0]<<"\n";
        else cout<<(a[1]-a[0])/2<<"\n";
    }else if(n==3){
        if(a[2]-a[1]!=a[1]-a[0]) puts("-1");
        else cout<<a[1]-a[0]<<endl;
    }else{
        puts("-1");
    }
    return 0;
}

第三题(模拟+循环节)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e2+100;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int a,b,c;
int tmp[7]={1,2,3,1,3,2,1};
int cmp(int x,int y,int z){
    for(int i=0;i<7;i++){
        if(tmp[i]==1){
            if(x) x--;
            else return i;
        }
        if(tmp[i]==2){
            if(y) y--;
            else return i;
        }
        if(tmp[i]==3){
            if(z) z--;
            else return i;
        }
    }
    return 0;
}
int solve(int x,int y,int z){
    int cnt=min(x/3,min(y/2,z/2));
    x-=cnt*3,y-=cnt*2,z-=cnt*2;
    return cnt*7+cmp(x,y,z);
}
int gao(int t,int x,int y,int z){
    for(int i=t;i<7;i++){
        if(tmp[i]==1){
            if(x) x--;
            else return i-t;
        }
        if(tmp[i]==2){
            if(y) y--;
            else return i-t;
        }
        if(tmp[i]==3){
            if(z) z--;
            else return i-t;
        }
    }
    return 7-t+solve(x,y,z);
}
int main(){
    cin>>a>>b>>c;
    int ans=0;
    rep(i,0,7)  ans=max(ans,gao(i,a,b,c));
    cout<<ans<<endl;
    return 0;
}

第四题(决策)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=2e5+100;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,a,b,mv;
int v[maxn];
int solve(){
    rep(i,0,n){
        ///cout<<a<<" "<<b<<endl; 
        if(b==mv){
            b--;continue;
        }
        if(v[i]){
            if(a){
                a--,b++;
            }else{
                if(b) b--;
                else return i;
            }
        }else{
            if(b) b--;
            else{
                if(a) a--;
                else return i;
            }
        }
    }
    return n;
}
int main(){
    cin>>n>>a>>b;mv=b;
    rep(i,0,n) cin>>v[i];
    cout<<solve()<<"\n";
    return 0;
}

第五题(复杂度+链表)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=2e5+100;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,k,a[maxn];
int nxt[maxn],pre[maxn];
int pos[maxn],ans[maxn];
void getv(int& l,int cnt,int cur){
    while(l<=n){
        l=nxt[l];
        if(ans[l]==0){
            if(cnt){
                cnt--;
                ans[l]=cur;
            }else{
                return ;
            }
        }
    }
}
int main(){
    cin>>n>>k;nxt[0]=1;
    rep(i,1,n+1){
        cin>>a[i];
        pos[a[i]]=i;
        nxt[i]=i+1,pre[i]=i-1;
    }
    int cur=1;
    for(int i=n;i>=1;i--){
        if(ans[pos[i]]) continue;
        cur^=1;
        int l=pos[i],r=pos[i],cnt=k;
        while(1){
            r=nxt[r];
            if(r>n) break;
            if(ans[r]==0){
               if(cnt) cnt--,ans[r]=cur+1;
                else break;
            }
        }
        cnt=k;
        while(1){
            l=pre[l];
            if(l<1) break;
            if(ans[l]==0){
                if(cnt) cnt--,ans[l]=cur+1;
                else break;
            }
        }
        nxt[l]=r,pre[r]=l,ans[pos[i]]=cur+1;
    }
    rep(i,1,n+1) cout<<ans[i];
    return 0;
}

第六题(背包DP+预处理+贪心优化)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxm=2e5+100;
const int ub=1e6;
const int maxn=2e3+100;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,m,k,INF;
int x,y,v[maxn];
int a[maxm],dp[maxn];
int main(){
    cin>>n>>m>>k;
    rep(i,1,n+1) cin>>a[i];
    sort(a+1,a+n+1);
    rep(i,1,n+1) a[i]+=a[i-1];
    rep(i,0,m){
        cin>>x>>y;
        if(x>=maxn) continue;
        if(v[x]<y) v[x]=y;
    }
    mst(dp,0xf),INF=dp[0],dp[0]=0;
    rep(i,0,k+1) rep(j,1,k+1){
        if(dp[i]!=INF){
            dp[i+j]=min(dp[i+j],dp[i]+a[i+j]-a[i+v[j]]);
        }
    }
    cout<<dp[k]<<"\n";
    return 0;
}

第七题(数论+模拟+贪心)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e7+100;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
int gcd(int x,int y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n;
vector<int> cnt[maxn];
ll LCM(int x,int y){
    return 1LL*x/gcd(x,y)*y;
}
int main(){
    ios::sync_with_stdio(false);
    cin>>n;
    ll ans=1e18;
    int retl,retr,l,r,vl,vr;
    rep(i,0,n){
        int x;cin>>x;
        if(cnt[x].size()){
            if(x<ans){
                ans=x;
                retl=i+1,retr=cnt[x][0];
            }
        }
        else cnt[x].push_back(i+1);
    }
    rep(i,1,maxn){
        l=-1,r=-1;
        for(int j=i;j<maxn;j+=i){
            if(cnt[j].size()==0) continue;
            if(l==-1){
                l=j;vl=cnt[j][0];
            }else{
                r=j;vr=cnt[j][0];
                ///cout<<l<<" "<<r<<endl;
                ll tmp=LCM(l,r);
                if(tmp<ans){
                    ans=tmp;
                    retl=vl,retr=vr;
                }
                break;
            }
        }
    }
    if(retl>retr) swap(retl,retr);
    cout<<retl<<" "<<retr;
    return 0;
}