Submission #1072556
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long ll; int p1,p2; typedef pair<int,int> P; int b[2][3]; int c[3][2]; P dfs(int b1,int b2,int f){ P res=P(-1,-1); int x=0; for(int i=0;i<9;i++) x+=((b1|b2)>>i)&1; if(x==9){ res=P(0,0); int st[3][3]={}; for(int i=0;i<9;i++) if((b1>>i)&1) st[i/3][i%3]=1; for(int i=0;i<2;i++) for(int j=0;j<3;j++) if(st[i][j]==st[i+1][j]) res.first+=b[i][j]; else res.second+=b[i][j]; for(int i=0;i<3;i++) for(int j=0;j<2;j++) if(st[i][j]==st[i][j+1]) res.first+=c[i][j]; else res.second+=c[i][j]; return res; } if(!f){ for(int i=0;i<9;i++){ if(((b1|b2)>>i)&1) continue; P p=dfs(b1+(1<<i),b2,!f); if(p.first>res.first) res=p; } }else{ for(int i=0;i<9;i++){ if(((b1|b2)>>i)&1) continue; P p=dfs(b1,b2+(1<<i),!f); if(p.second>res.second) res=p; } } return res; } int main(){ for(int i=0;i<2;i++) for(int j=0;j<3;j++) cin>>b[i][j]; for(int i=0;i<3;i++) for(int j=0;j<2;j++) cin>>c[i][j]; P p=dfs(0,0,0); cout<<p.first<<endl<<p.second<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 双子と○×ゲーム |
User | beet |
Language | C++ (GCC 4.9.2) |
Score | 100 |
Code Size | 1190 Byte |
Status | AC |
Exec Time | 58 ms |
Memory | 924 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt |
All | test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample-01.txt | AC | 57 ms | 804 KB |
sample-02.txt | AC | 56 ms | 804 KB |
test-01.txt | AC | 56 ms | 800 KB |
test-02.txt | AC | 56 ms | 800 KB |
test-03.txt | AC | 55 ms | 920 KB |
test-04.txt | AC | 57 ms | 800 KB |
test-05.txt | AC | 55 ms | 792 KB |
test-06.txt | AC | 58 ms | 792 KB |
test-07.txt | AC | 56 ms | 672 KB |
test-08.txt | AC | 57 ms | 792 KB |
test-09.txt | AC | 57 ms | 800 KB |
test-10.txt | AC | 57 ms | 804 KB |
test-11.txt | AC | 57 ms | 796 KB |
test-12.txt | AC | 56 ms | 796 KB |
test-13.txt | AC | 58 ms | 792 KB |
test-14.txt | AC | 57 ms | 672 KB |
test-15.txt | AC | 57 ms | 672 KB |
test-16.txt | AC | 56 ms | 796 KB |
test-17.txt | AC | 57 ms | 924 KB |
test-18.txt | AC | 57 ms | 804 KB |
test-19.txt | AC | 56 ms | 796 KB |
test-20.txt | AC | 57 ms | 800 KB |