Submission #3180943
Source Code Expand
#include <stdio.h> int b[2][3]; int c[3][2]; int board[3][3]; int mini_max(int depth){ int i,j; if(depth==9){ int chokudai=0; for(i=0;i<2;i++){ for(j=0;j<3;j++){ if(board[i][j]==board[i+1][j]){ chokudai+=b[i][j]; } } } for(i=0;i<3;i++){ for(j=0;j<2;j++){ if(board[i][j]==board[i][j+1]){ chokudai+=c[i][j]; } } } return chokudai; } int max; int val; if(depth%2==0){max=-114514;} else{max=114514;} for(i=0;i<9;i++){ if(board[i/3][i%3]==0 && depth%2==0){ board[i/3][i%3]=1; val=mini_max(depth+1); board[i/3][i%3]=0; if(max<val){max=val;} } else if(board[i/3][i%3]==0 && depth%2==1){ board[i/3][i%3]=2; val=mini_max(depth+1); board[i/3][i%3]=0; if(max>val){max=val;} } } return max; } int main(){ int i,j; int sum=0; for(i=0;i<2;i++){ for(j=0;j<3;j++){ scanf(" %d",&b[i][j]); sum+=b[i][j]; } } for(i=0;i<3;i++){ for(j=0;j<2;j++){ scanf(" %d",&c[i][j]); sum+=c[i][j]; } } int chokudai=mini_max(0); printf("%d\n",chokudai); printf("%d\n",sum-chokudai); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 双子と○×ゲーム |
User | tekitouk |
Language | C (GCC 5.4.1) |
Score | 100 |
Code Size | 1179 Byte |
Status | AC |
Exec Time | 34 ms |
Memory | 128 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:64:4: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf(" %d",&b[i][j]); ^ ./Main.c:71:4: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf(" %d",&c[i][j]); ^
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 | sample-01.txt, sample-02.txt, 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 | 34 ms | 128 KB |
sample-02.txt | AC | 34 ms | 128 KB |
test-01.txt | AC | 34 ms | 128 KB |
test-02.txt | AC | 34 ms | 128 KB |
test-03.txt | AC | 34 ms | 128 KB |
test-04.txt | AC | 34 ms | 128 KB |
test-05.txt | AC | 34 ms | 128 KB |
test-06.txt | AC | 34 ms | 128 KB |
test-07.txt | AC | 34 ms | 128 KB |
test-08.txt | AC | 34 ms | 128 KB |
test-09.txt | AC | 34 ms | 128 KB |
test-10.txt | AC | 34 ms | 128 KB |
test-11.txt | AC | 34 ms | 128 KB |
test-12.txt | AC | 34 ms | 128 KB |
test-13.txt | AC | 34 ms | 128 KB |
test-14.txt | AC | 34 ms | 128 KB |
test-15.txt | AC | 34 ms | 128 KB |
test-16.txt | AC | 34 ms | 128 KB |
test-17.txt | AC | 34 ms | 128 KB |
test-18.txt | AC | 34 ms | 128 KB |
test-19.txt | AC | 34 ms | 128 KB |
test-20.txt | AC | 34 ms | 128 KB |