Codeforces Round #542 (Div. 2)解题报告（A,B,C,D1,D2,E)

题目链接：http://codeforces.com/contest/1130

第一题（暴力）：

#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+5;
const int ub=1e6;
const double inf=1e-4;
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;
int cnt0=0,cnt1=0;
int main(){
    cin>>n;
    rep(i,0,n) {cin>>x;if(x<0) cnt1++;if(x>0) cnt0++;}
    n=(n/2)+(n&1);
    if(cnt0>=n) puts("1");
    else if(cnt1>=n) puts("-1");
    else puts("0");
    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 maxn=2e5+5;
const int ub=1e6;
const double inf=1e-4;
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 n,a[maxn],dp[maxn];
pair<int,int> p[maxn];
int main(){
    cin>>n;n<<=1;
    rep(i,1,n+1){
        cin>>a[i];
        p[i].fi=a[i],p[i].se=i;
    }
    sort(p+1,p+1+n);
    dp[1]=p[1].se,dp[2]=p[2].se;
    for(int i=3;i<=n;i+=2){
        ll val1=abs(p[i].se-p[i-1].se)+abs(p[i+1].se-p[i-2].se);
        ll val2=abs(p[i].se-p[i-2].se)+abs(p[i+1].se-p[i-1].se);
        if(val1<val2){
            dp[i]=dp[i-1]+abs(p[i].se-p[i-1].se);
            dp[i+1]=dp[i-2]+abs(p[i+1].se-p[i-2].se);
        }else{
            dp[i]=dp[i-2]+abs(p[i].se-p[i-2].se);
            dp[i+1]=dp[i-1]+abs(p[i+1].se-p[i-1].se);
        }
    }
    ///cout<<dp[4]<<" "<<dp[3]<<endl;
    cout<<dp[n]+dp[n-1]-2LL<<endl;
    return 0;
}

第三题（BFS）：

#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=50+5;
const int ub=1e6;
const double inf=1e-4;
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;
int x1,y1,x2,y2;
char mp[maxn][maxn];
int mark[3][maxn][maxn];

int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
void bfs(int x,int y,int v){
    queue<int> p;
    p.push(x*n+y);
    while(!p.empty()){
        int tp=p.front();p.pop();
        int xx=tp/n,yy=tp%n;
        ///cout<<xx<<" "<<yy<<endl;
        if(mark[v][xx][yy]==v) continue;
        mark[v][xx][yy]=v;
        for(int i=0;i<4;i++){
            int tx=xx+dx[i];
            int ty=yy+dy[i];
            if(tx<0||tx>=n||ty<0||ty>=n||mp[tx][ty]=='1') continue;
            p.push(tx*n+ty);
        }
    }
}

int dist(int x1,int y1,int x2,int y2){
    return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}

int main(){
    cin>>n;cin>>x1>>y1>>x2>>y2;
    rep(i,0,n){
        scanf("%s",mp[i]);
    }

    x1--,y1--,x2--,y2--;
    int ans=0;
    if(mp[x1][y1]=='1'||mp[x2][y2]=='1'){
        ans=0;
    }else{
        bfs(x1,y1,1);
        bfs(x2,y2,2);
        ans=mod;
        rep(i,0&&ans,n) rep(j,0&&ans,n) if(mark[1][i][j]==1){
            rep(p,0&&ans,n) rep(q,0&&ans,n) if(mark[2][p][q]==2){
                ans=min(ans,dist(i,j,p,q));
        }
    }
    }
    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)
int mod=20100501;
const int maxn=3e2;
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;
int x[maxn],y[maxn],mark[maxn];
vector<int> p[maxn];
int main(){
    cin>>n>>m;
   for(int i=0;i<m;i++){
        cin>>x[i]>>y[i];
        x[i]--,y[i]--;
   }
   rep(i,0,n){
       mst(mark,0);///rep(i,0,n) p[i].clear();
        rep(j,0,m){
            int tx=(x[j]-i+n)%n,ty=(y[j]-i+n)%n;
            p[tx].push_back( -((ty-tx+n)%n) );
        }
        rep(i,0,n) sort(p[i].begin(),p[i].end());
        int idx=0,ans=0,tot=m;
        while(tot){
            while(p[idx].size()==0) idx=(idx+1)%n,mark[idx]=0,ans++;
            int tx=-p[idx][0];p[idx].erase(p[idx].begin());
            mark[(tx+idx)%n]=1;
            tot--;ans++;idx=(idx+1)%n;
            mark[idx]=0;
        }
        int tmp=0;while(mark[idx]==0&&tmp<n) idx=(idx-1+n)%n,tmp++;
        ans+=n-tmp;
        cout<<ans<<" ";
    }
    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)
int mod=20100501;
const int maxn=5e4+10;
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,INF;
int x[maxn],y[maxn];
int cnt[maxn],flag[maxn],mv[maxn];
int main(){
    cin>>n>>m;
    mst(mv,0xf),INF=mv[0];
    for(int i=0;i<m;i++){
        cin>>x[i]>>y[i];
        x[i]--,y[i]--;
        cnt[x[i]]++;
        int len=(y[i]-x[i]+n)%n;
        if(len<mv[x[i]]) mv[x[i]]=len;
    }
    rep(i,0,n){
        int ans=0;
        rep(j,0,n){
            if(mv[j]==INF) continue;
            int tp1=(j-i+n)%n,tp2=(tp1+mv[j])%n;
            if(tp1<tp2) ans=max(ans,(cnt[j]-1)*n+tp2);
            else ans=max(ans,cnt[j]*n+tp2);
        }
        cout<<ans<<" ";
    }
    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)
int mod=20100501;
const int maxn=5e3+10;
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 k,tk;
int n,x;
int ans[maxn];
int main(){
    ans[0]=-1;
    cin>>k;k++;
    k+=1999;
    int tmp=1e6;
    rep(i,1,k/tmp+1) ans[i]=tmp;
    ans[k/tmp+1]=k%tmp;
    rep(i,k/tmp+2,2000) ans[i]=0;
    puts("2000");
    rep(i,0,2000) cout<<ans[i]<<" ";puts("");
    return 0;
}