結果

問題 No.437 cwwゲーム
ユーザー mai
提出日時 2016-10-28 23:11:29
言語 C++14
(gcc 8.3.0)
結果
AC  
実行時間 4 ms
コード長 2,255 Byte
コンパイル時間 1,446 ms
使用メモリ 1,512 KB
最終ジャッジ日時 2019-10-07 05:40:52

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
00_sample01.txt AC 3 ms
1,504 KB
00_sample02.txt AC 3 ms
1,500 KB
00_sample03.txt AC 3 ms
1,512 KB
01_hand01.txt AC 3 ms
1,508 KB
01_hand02.txt AC 4 ms
1,508 KB
01_hand03.txt AC 3 ms
1,508 KB
01_hand04.txt AC 4 ms
1,508 KB
01_hand05.txt AC 3 ms
1,512 KB
01_hand06.txt AC 3 ms
1,508 KB
01_hand07.txt AC 4 ms
1,512 KB
01_hand08.txt AC 3 ms
1,512 KB
01_hand09.txt AC 3 ms
1,508 KB
01_hand10.txt AC 3 ms
1,508 KB
01_hand11.txt AC 4 ms
1,508 KB
01_hand12.txt AC 3 ms
1,508 KB
01_hand13.txt AC 3 ms
1,508 KB
01_hand14.txt AC 3 ms
1,508 KB
01_hand15.txt AC 3 ms
1,508 KB
99_system_test1.txt AC 3 ms
1,512 KB
challenge01.txt AC 3 ms
1,504 KB
challenge02.txt AC 3 ms
1,508 KB
in01.txt AC 3 ms
1,504 KB
in02.txt AC 3 ms
1,504 KB
in03.txt AC 3 ms
1,504 KB
in04.txt AC 3 ms
1,508 KB
in05.txt AC 3 ms
1,508 KB
in06.txt AC 3 ms
1,508 KB
in07.txt AC 4 ms
1,504 KB
in08.txt AC 3 ms
1,508 KB
in09.txt AC 3 ms
1,504 KB
in10.txt AC 3 ms
1,500 KB
in11.txt AC 3 ms
1,504 KB
in12.txt AC 3 ms
1,504 KB
in13.txt AC 3 ms
1,512 KB
in14.txt AC 3 ms
1,508 KB
in15.txt AC 3 ms
1,508 KB
in16.txt AC 3 ms
1,496 KB
in17.txt AC 3 ms
1,500 KB
in18.txt AC 3 ms
1,508 KB
in19.txt AC 3 ms
1,496 KB
in20.txt AC 3 ms
1,504 KB
system_test1.txt AC 3 ms
1,508 KB
system_test2.txt AC 3 ms
1,508 KB
system_test3.txt AC 3 ms
1,512 KB
テストケース一括ダウンロード

ソースコード

diff #
#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007
void printbit(int u){if(u==0)cout<<0;else{int s=0,k=0;for(;0<u;u>>=1,k++)s=(s<<1)|(u&1);for(;0<k--;s>>=1)cout<<(s&1);}}

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

template<typename T1,typename T2>
ostream& operator <<(ostream &o,const pair<T1,T2> p){o<<"("<<p.first<<":"<<p.second<<")";return o;}

string str;
int stri[20];
int n;
map<ll,int> memo;

int bitcount(int v){
    int k=0;
    while (v){
        k+=v&1;v>>=1;
    }
    return k;
}

int calc(int bit){
    if (bitcount(bit)+3>n) return 0;
    //printbit(bit);cout<<endl;
    int i,j,k;
    ll key=0;
    for (i=0;i<n;i++){
        if (bit&(1<<i)) continue;
        key=key*10+stri[i];
    }
    
    if (memo.count(key)) return memo[key];
    
    int score = 0;
    for (i=0;i<n;i++){
        if (bit&(1<<i)) continue;
        if (stri[i]==0) continue;
        for (j=i+1;j<n;j++){
            if (bit&(1<<j)) continue;
            for (k=j+1;k<n;k++){
                if (bit&(1<<k)) continue;
                if (stri[j]==stri[k] && stri[j]!=stri[i]){
                    int c = stri[i]*100+stri[j]*11;
                    //printf("c %d\n",c);
                    score = max(score,c+calc(bit|(1<<i)|(1<<j)|(1<<k)));
                    break;
                }
            }
        }
    }
    //cout<<score<<endl;
    return memo[key]=score;
}



int main(){
    int i,j,k,l;
    
    cin >> str;
    n = str.size();
    
    for (i=0;i<n;i++){
        stri[i] = str[i]-'0';
    }
    
    cout << calc(0) << endl;
    

    return 0;
}
0