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

题目链接:http://codeforces.com/contest/1144/problem

第一题(模拟)

#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=1e5+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){return y?gcd(y,x%y):x;}
int a[26];
string s;
int main(){
    int t;cin>>t;
    while(t--){
        mst(a,0);
    cin>>s;
    int len=s.size();
    for(int i=0;i<len;i++){
        a[s[i]-'a']++;
    }
    int flag=1,cnt=0;
    for(int i=0;i<26&&flag;i++){
        if(a[i]){
            cnt++;
            if(cnt>=2) flag=0;
            while(i<26&&a[i]){

                if(a[i]>=2) {flag=0;break;}
                i++;
            }
        }
    }
    if(flag) puts("Yes");
    else puts("No");
    }
    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=1e5+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){return y?gcd(y,x%y):x;}
int cnt[2];
int n,x;
ll a[2][maxn];
int main(){
    cin>>n;
    rep(i,0,n){
        cin>>x;
        a[x&1][cnt[x&1]++]=x;
    }
    sort(a[0],a[0]+cnt[0]);
    sort(a[1],a[1]+cnt[1]);
    rep(i,1,cnt[0]) a[0][i]+=a[0][i-1];
    rep(i,1,cnt[1]) a[1][i]+=a[1][i-1];
    sort(a[1],a[1]+cnt[1]);
    if(cnt[0]-cnt[1]<=1&&cnt[0]-cnt[1]>=-1) puts("0");
    else{
        if(cnt[0]>cnt[1]) cout<<a[0][cnt[0]-cnt[1]-2]<<endl;
        else cout<<a[1][cnt[1]-cnt[0]-2]<<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){return y?gcd(y,x%y):x;}
int n,x,cnt[maxn];
int a[2][maxn],idx[2];
int main(){
    cin>>n;
    int flag=1;
    rep(i,0,n){
        cin>>x;
        cnt[x]++;
        if(cnt[x]>2&&flag) flag=0;
        else{
            if(cnt[x]&1) a[1][idx[1]++]=x;
            else a[0][idx[0]++]=x;
        }
    }
    if(!flag) puts("No");
    else{
        puts("Yes");

        sort(a[0],a[0]+idx[0]);
        sort(a[1],a[1]+idx[1]);
        cout<<idx[0]<<endl;
        rep(i,0,idx[0]) cout<<a[0][i]<<" ";puts("");
        cout<<idx[1]<<endl;
        for(int i=idx[1]-1;i>=0;i--) cout<<a[1][i]<<" ";puts("");
    }
    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){return y?gcd(y,x%y):x;}
int n,a[maxn],x[maxn],maxv=-1,minv=1e9;
int cnt[maxn];
int main(){
    cin>>n;
    rep(i,0,n){
        cin>>x[i];
        maxv=max(maxv,x[i]);
        minv=min(minv,x[i]);
        cnt[x[i]]++;
    }
    int tmp=0;for(int i=0;i<maxv+1;i++) if(cnt[i]>tmp) {tmp=cnt[i];minv=i;}
    maxv=minv;
    cout<<n-tmp<<endl;
    int pos=0;while(x[pos]!=maxv) pos++;
    for(int i=pos-1;i>=0;i--){
       if(x[i]!=maxv){
           if(x[i]<maxv) cout<<1<<" ";
           else cout<<2<<" ";
           cout<<i+1<<" "<<i+2<<endl;
       }
    }
    for(int i=pos+1;i<n;i++){
       if(x[i]!=maxv){
           if(x[i]<maxv) cout<<1<<" ";
           else            cout<<2<<" ";
           cout<<i+1<<" "<<i<<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){return y?gcd(y,x%y):x;}
string s1,s2;
int k,a[maxn],b[maxn],ans[maxn];
int main(){
    cin>>k>>s1>>s2;
    for(int i=k-1;i>=0;i--) a[-i+k-1]=(s1[i]-'a');
    for(int i=k-1;i>=0;i--) b[-i+k-1]=(s2[i]-'a');
    int tmp=0;
    rep(i,0,k+1){
        int tp=a[i]+b[i]+tmp;
        ans[i]=tp%26;
        tmp=tp/26;
    }
    tmp=0;
    for(int i=k;i>=0;i--){
        a[i]=(ans[i]+tmp*26)/2;
        tmp=ans[i]%2;
    }
    for(int i=k-1;i>=0;i--) cout<<(char)(a[i]+'a');
    return 0;
}

第六题(DFS):

#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){return y?gcd(y,x%y):x;}
int n,m;
vector<pii> g[maxn];
int dep[maxn],ans[maxn];
bool dfs(int u,int pre){
    dep[u]=dep[pre]+1;
    bool flag=true;
    for(int i=0;i<g[u].size();i++){
        int v=g[u][i].fi,s=g[u][i].se;
        if(v==pre) continue;
        int tmp=(s>0);s=max(s,-s);
        if(ans[s]==-1){
            ans[s]=(dep[u]&1);
            if(tmp==0) ans[s]^=1;
        }
        if(dep[v]!=-1){
            if((dep[u]+1+dep[v])&1) return false;
            else continue;
        }
        if(!dfs(v,u)) flag=false;
    }
    return flag;
}
int main(){
    cin>>n>>m;
    rep(i,1,m+1){
        int x,y;
        cin>>x>>y;
        g[x].push_back(mk(y,i));
        g[y].push_back(mk(x,-i));
    }
    mst(ans,-1),mst(dep,-1);
    if(!dfs(1,0)) puts("NO");
    else{
        puts("YES");
        for(int i=1;i<=m;i++) cout<<ans[i];puts("");
    }
    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 a[maxn],n,ans[maxn];
int maxv=-1e9,minv=1e9,flag=1;
int main(){
    cin>>n;
    rep(i,1,n+1) cin>>a[i];
    rep(i,1,n+1){
        if(a[i]>maxv&&a[i]>=minv){
            maxv=a[i];
            ans[i]=1;
        }
        else if(a[i]<=maxv&&a[i]<minv){
            minv=a[i];
            ans[i]=0;
        }
        else if(a[i]<=maxv&&a[i]>=minv){
            flag=0;
            break;
        }
        else{
            if(i+1<=n){
                if(a[i+1]<a[i]){
                    ans[i]=0;
                    minv=a[i];
                }else if(a[i+1]>a[i]){
                    ans[i]=1;
                    maxv=a[i];
                }else{
                    maxv=a[i];
                    ans[i]=1;
                }
            }
        }
    }
    if(!flag) puts("NO");
    else{
        puts("YES");
        rep(i,1,n+1) cout<<1-ans[i]<<" ";puts("");
    }

    return 0;
}