Codeforces Round #547 (Div. 3)(A,B,C,D,E,F1,F2,G)

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

第一题(模拟):

#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;}
vector<ll> ans;
ll gcd(ll x,ll y){
    if(y==0) return x;
    ans.push_back(x/y);
    return gcd(y,x%y);
}
int n,m;
int main(){
    cin>>n>>m;
    if(m%n) puts("-1");
    else{
        m/=n;
        int cnt=0;
        while(m%2==0) m/=2,cnt++;
        while(m%3==0) m/=3,cnt++;
        if(m>1) puts("-1");
        else cout<<cnt<<endl;
    }

}

第二题(模拟):

#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;}
vector<ll> ans;
ll gcd(ll x,ll y){
    if(y==0) return x;
    ans.push_back(x/y);
    return gcd(y,x%y);
}
int n,a[maxn];
int main(){
    cin>>n;
    rep(i,0,n) cin>>a[i];
    int l=0;while(a[l]) l++;
    int r=n-1;while(a[r]) r--;
    int ans=n-1-r+l;

    for(int i=0;i<n;i++){
        if(a[i]){
            int tmp=0;
            while(i<n&&a[i]) i++,tmp++;
            ans=max(ans,tmp);
        }
    }
    cout<<ans<<endl;
    return 0;
}

第三题(map):

#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;}
vector<ll> ans;
ll gcd(ll x,ll y){
    if(y==0) return x;
    ans.push_back(x/y);
    return gcd(y,x%y);
}
ll n,x;
ll a[maxn];
map<ll,int> mp;
int main(){
    cin>>n;
    ll tmp=0,minv=0;
    a[1]=0;
    int flag=1;
    rep(i,2,n+1){
        cin>>x;
        tmp+=x;
        a[i]=tmp;
        minv=min(minv,tmp);
    }
    minv=1-minv;
    for(int i=1;i<=n;i++){
        a[i]+=minv;
        mp[a[i]]++;
        
    }
    for(int i=1;i<=n;i++) if(mp[i]==0){
        flag=0;
    }

    if(flag==0) puts("-1");
    else{
        for(int i=1;i<=n;i++){
            cout<<a[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;}
vector<ll> ans;
ll gcd(ll x,ll y){
    if(y==0) return x;
    ans.push_back(x/y);
    return gcd(y,x%y);
}
int n,cnt0,cnt1;
string s1,s2;
vector<int> g[2][30];
vector<pii> ret;
int main(){
    ios::sync_with_stdio(false);
    cin>>n;
    cin>>s1>>s2;
    rep(i,0,n){
        if(s1[i]=='?') g[0][26].push_back(i+1),cnt0++;
        else g[0][s1[i]-'a'].push_back(i+1);
    }
   rep(i,0,n){
        if(s2[i]=='?') g[1][26].push_back(i+1),cnt1++;
        else g[1][s2[i]-'a'].push_back(i+1);
    }
    ll ans=0;
    rep(i,0,26){
        int sz0=g[0][i].size(),sz1=g[1][i].size();
        ///cout<<sz0<<" "<<sz1<<endl;
        int tmp=min(sz0,sz1);
        ans+=tmp;
        for(int j=0;j<tmp;j++){
            ret.push_back(mk(g[0][i][j],g[1][i][j]));
        }
        if(sz0>tmp&&cnt1){
            int ub=min(cnt1,sz0-tmp);
            ans+=ub;
            for(int j=0;j<ub;j++){
                ret.push_back(mk(g[0][i][tmp+j],g[1][26][cnt1-j-1]));
            }
            cnt1-=ub;
        }
        if(sz1>tmp&&cnt0){
            int ub=min(cnt0,sz1-tmp);
            ans+=ub;
            for(int j=0;j<ub;j++){
                ret.push_back(mk(g[0][26][cnt0-j-1],g[1][i][tmp+j]));
            }
            cnt0-=ub;
        }
    }
    int ub=min(cnt0,cnt1);
    ans+=ub;
    rep(i,0,ub) ret.push_back(mk(g[0][26][i],g[1][26][i]));
    cout<<ans<<'\n';
    rep(i,0,ans) cout<<ret[i].fi<<" "<<ret[i].se<<'\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){return y?gcd(y,x%y):x;}
ll H,n,x[maxn],sum=0,ans;
int main(){
    ans=2e18;
    cin>>H>>n;
    rep(i,0,n){
        cin>>x[i];
        sum+=x[i];
        if(sum+H<=0) ans=min(ans,1LL*i+1);
    }
    if(sum<0){
        ll tmp=0;
        rep(i,0,n){
            tmp+=x[i];
            if(tmp+H>0){
                ll tim=(tmp+H)/(-sum)*n+i+1;
                if((tmp+H)%(-sum)) tim+=n;
                ans=min(ans,tim);
            }
        }
    }
    if(ans==2e18) puts("-1");
    else 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=2e3+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,sum[maxn];
pair<int,pii> p[maxn*maxn];
pii ans[maxn],tmp[maxn];
int cnt0=0,cnt1=0;
void solve(int l,int r){
    cnt1=0;
    for(int i=l;i<=r;i++){
        tmp[cnt1++]=p[i].se;
        int j=i;
        while(i+1<=r&&p[i+1].se.se>=-p[j].se.fi) i++;
    }
    if(cnt1>cnt0){cnt0=cnt1;rep(i,0,cnt0) ans[i]=tmp[i];}
    return ;
}
int main(){
    cin>>n;
    rep(i,1,n+1){
        cin>>a;
        sum[i]=sum[i-1]+a;
    }
    int cnt=0;
    rep(i,0,n) rep(j,i+1,n+1){
        int tp=sum[j]-sum[i];
        p[cnt++]=make_pair(tp,mk(-i-1,j));
    }
    sort(p,p+cnt);///
    rep(i,0,cnt){
        int j=i;
        while(j+1<cnt&&p[j+1].fi==p[i].fi)   j++;
        solve(i,j);
        i=j;
    }
    cout<<cnt0<<endl;
    rep(i,0,cnt0) cout<<-ans[i].fi<<" "<<ans[i].se<<endl;
    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){if(y==0) return x;return gcd(y,x%y);}
int n,k,x,y,ans;
vector<pii> g[maxn];
int dg[maxn],ret[maxn];
void dfs(int u,int pre,int pc){
    int tmp=1;
    for(int i=0;i<g[u].size();i++){
        pii p=g[u][i];
        if(p.fi==pre) continue;
        if(tmp==pc) tmp++;
        ret[p.se]=min(ans,tmp++);
        dfs(p.fi,u,ret[p.se]);
    }
}
int main(){
    cin>>n>>k;
    rep(i,1,n){
        cin>>x>>y;
        g[x].push_back(mk(y,i));
        g[y].push_back(mk(x,i));
    }
    rep(i,0,n) dg[i]=g[i+1].size();
    sort(dg,dg+n);
    int l=1,r=n;ans=n-1;
    while(l<=r){
        int mid=l+r>>1;
        int idx=upper_bound(dg,dg+n,mid)-dg;
        idx=n-idx;
        if(idx<=k) ans=mid,r=mid-1;
        else l=mid+1;
    }
    cout<<ans<<endl;///debug
    dfs(1,0,0);
    rep(i,1,n) cout<<ret[i]<<" ";puts("");
    return 0;
}