Codeforces Round #553 (Div. 2)(A,B,C,D)有待更新

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

第一题(暴力)

#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){
    if(y==0) return x;
    return gcd(y,x%y);
}
string s;
int n;
int b[4];

int main(){
    b[0]=0,b[1]='C'-'A';
    b[2]='T'-'A',b[3]='G'-'A';
    cin>>n>>s;
    int ret=1e9;
    rep(i,0,n){
        if(i+3<n){
            int ans=0;
            for(int j=i;j<i+4;j++){
                int tmp=s[j]-'A';
                ans+=min((b[j-i]-tmp+26)%26,(tmp-b[j-i]+26)%26);
            }
            ret=min(ret,ans);
        }
    }
    cout<<ret<<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=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){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,m,a[1000][1000];
set<int> st;
set<int>::iterator it;
int main(){
    cin>>n>>m;
    int tmp=0;
    rep(i,0,n){
        rep(j,0,m) cin>>a[i][j];
        tmp^=a[i][0];
        st.insert(a[i][0]);
    }
    if(tmp){
        puts("TAK");
        rep(i,0,n) cout<<1<<" ";
    }else{
        int ans1=-1,ans2;
        for(int i=0;i<n;i++){
            for(int j=1;j<m;j++){
                if(a[i][j]!=a[i][0]) {ans1=i,ans2=j;break;}
            }
            if(ans1!=-1) break;
        }
        if(ans1==-1) puts("NIE");
        else{
            puts("TAK");
            rep(i,0,n){
                if(i==ans1) cout<<ans2+1<<" ";
                else cout<<1<<" ";
            }
        }
    }
    
    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 ll mod=1e9+7;
const int maxn=62;
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):0;}
ll l,r,table[maxn],f[maxn],g[maxn];
ll sum(ll x,ll y){
    return 1LL*(x%mod+y%mod-1+mod)%mod*y%mod;
}
ll solve(ll x){
    if(x<=1) return x;
    int p=0;
    ll ans=0;
    while(table[p]<x){
        ans=(ans+sum(f[p],powmod(2LL,p)))%mod;
        p++;
    }
    ans=(ans+sum(f[p],(x-table[p-1])%mod))%mod;
    return ans;
}
int main(){
    cin>>l>>r;
    table[0]=1;rep(i,1,maxn) table[i]=table[i-1]*2+1;
    f[0]=g[0]=1;f[1]=2,g[1]=4;
    rep(i,2,maxn){///预处理出每一段的开头数字和结尾数字,用DP的思想
        f[i]=(g[i-2]+2)%mod;
        g[i]=(f[i]-2+((1LL)<<(i+1))%mod)%mod;
    }   
    cout<<(solve(r)-solve(l-1)+mod)%mod<<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=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;}
int n,x,y;
int p[maxn];
int main(){
    cin>>n;
    ll tmp=0;
    rep(i,0,n){
        cin>>x>>y;
        tmp+=1LL*(n-1)*y;
        p[i]=x-y;
    }       
    sort(p,p+n);
    for(int i=n-1;i>=0;i--) tmp+=1LL*(n-1-i)*p[i];
    cout<<tmp<<endl;
    return 0;
}