Codeforces Beta Round #59 (Div. 2)

Codeforces Beta Round #59 (Div. 2)

http://codeforces.com/contest/63

A

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000006
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;

 struct sair{
     string name,v;
 }a[];

 int main(){
     #ifndef ONLINE_JUDGE
         freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     int n;
     cin>>n;
     rep(i,,n+){
         cin>>a[i].name>>a[i].v;
     }
     rep(i,,n+){
         if(a[i].v=="rat"){
             cout<<a[i].name<<endl;
         }
     }
     rep(i,,n+){
         if(a[i].v=="woman"||a[i].v=="child"){
             cout<<a[i].name<<endl;
         }
     }
     rep(i,,n+){
         if(a[i].v=="man"){
             cout<<a[i].name<<endl;
         }
     }
     rep(i,,n+){
         if(a[i].v=="captain"){
             cout<<a[i].name<<endl;
         }
     }
 }

B

暴力模拟即可

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000006
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;

 int n,k;
 int a[];
 int book[];

 int main(){
     #ifndef ONLINE_JUDGE
       //  freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     cin>>n>>k;
     int ans=;
     rep(i,,n+){
         cin>>a[i];
     }
     a[]=-0x3f3f3f3f;
     sort(a,a+n+);
     int flag=;
     while(flag){
         flag=;
         rep(i,,n+){
             if(a[i]<k)
             if(a[i]!=a[i-]){
                 book[i]++;
                 flag=;
             }
         }
         rep(i,,n+) a[i]+=book[i],book[i]=;
         sort(a,a+n+);
         ans+=flag;
     }
     cout<<ans<<endl;
 }

C

枚举1-9999的数，然后一个个判断，看看有几个符合条件

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000006
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;

 int n;
 struct sair{
     int a,b,c;
 }q[];

 int main(){
     #ifndef ONLINE_JUDGE
       //  freopen("input.txt","r",stdin);
     #endif
    // std::ios::sync_with_stdio(false);
     cin>>n;
     rep(i,,n) {
         cin>>q[i].a>>q[i].b>>q[i].c;
     }
     int x,y,z;
     int ans,num=;
     rep(i,,){
         int tmp=i;
         int a,b,c,d;
         a=tmp%,tmp/=;
         b=tmp%,tmp/=;
         c=tmp%,tmp/=;
         d=tmp%;
         if(a==b||a==c||a==d||b==c||b==d||c==d) continue;
         int flag=;
         rep(j,,n){
             x=,y=,z;
             tmp=q[j].a;
             z=tmp%;
             if(a==z) x++;
             if(b==z) y++;
             if(c==z) y++;
             if(d==z) y++;
             tmp/=;
             z=tmp%;
             if(b==z) x++;
             if(a==z) y++;
             if(c==z) y++;
             if(d==z) y++;
             tmp/=;
             z=tmp%;
             if(c==z) x++;
             if(b==z) y++;
             if(a==z) y++;
             if(d==z) y++;
             tmp/=;
             z=tmp%;
             if(d==z) x++;
             if(b==z) y++;
             if(c==z) y++;
             if(a==z) y++;
             if(x!=q[j].b||y!=q[j].c){
                 flag=;
                 break;
             }
         }
         if(flag){
             num++;
             ans=i;
         }
     }
     if(num==) cout<<"Incorrect data"<<endl;
     else if(num==) printf("%04d\n",ans);
     else cout<<"Need more data"<<endl;
 }

D

通过多次模拟可以发现，只要走S形即可

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000006
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;

 int field[][];

 int main(){
     #ifndef ONLINE_JUDGE
       //  freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     int a,b,c,d,n;
     cin >> a >> b >> c >> d >> n;
     for (int i=; i<; i++) {
         for (int j=; j<; j++) {
             field[i][j]=;
         }
     }
     int party[]={};
     for (int i=; i<n; i++) {
         cin >> party[i];
     }
     for (int i=; i<max(b,d); i++) {
         for (int j=; j<a+c; j++) {
             if ((j<a&&i>=b)||(j>=a&&i>=d))field[i][j]='.';
         }
     }
     int x=,y=,dx=;
     if (((b>d)&&(d%==))||((d>b)&&(b%==))){
         x=a+c-;dx=-;
     }
     for (int i=; i<n; i++) {
         for (int j=; j<party[i]; j++) {
             field[y][x]='a'+i;
             if (x+dx<||x+dx>=a+c||field[y][x+dx]=='.') {
                 dx*=-;
                 y++;
             } else {
                 x+=dx;
             }
         }
     }
     cout << "YES" << endl;
     for (int i=; i<max(b,d); i++) {
         for (int j=; j<a+c; j++) {
             cout << char(field[i][j]);
         }
         cout << endl;
     }

 }

E

一种类似博弈的题目，用状压表示每一种情况，然后搜索，找出Karlsson的必胜路径，找不到的话就是必败

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000006
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;

 const int N=,S=<<;

 int Next[][N]={{,,,,,,,N,,,,,N,,,,N,N,N},
                       {,,N,,,,N,,,,,N,,,,N,,,N},
                       {,,,,,,,,,,,N,,,,N,N,N,N}};

 int dp[S],status=;

 int dfs(int now){
     if(dp[now]) return dp[now];
     rep(t,,){
         rep(i,,N){
             int tmp=now,p=i;
             while(tmp&(<<p)){
                 tmp^=(<<p);
                 if(dfs(tmp)==){
                     return dp[now]=;
                 }
                 p=Next[t][p];
             }
         }
     }
     return dp[now]=;
 }

 int main(){
     #ifndef ONLINE_JUDGE
         freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     char ch;
     rep(i,,N){
         cin>>ch;
         if(ch=='.'||ch=='O'){
             if(ch=='O'){
                 status+=(<<i);
             }
         }
         else{
             i--;
         }
     }
     int flag=dfs(status);
     if(flag==) cout<<"Karlsson"<<endl;
     else cout<<"Lillebror"<<endl;
 }