Submission #1126677


Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int b[6];
int c[6];
int board[9];

int point_check(){
  int ans=0;
  for(int i=0;i<2;i++){
    for(int j=0;j<3;j++){
      if(board[3*i+j]==board[3*i+3+j])ans+=b[3*i+j];
    }  
  }

   for(int i=0;i<3;i++){
    for(int j=0;j<2;j++){
      if(board[3*i+j]==board[3*i+j+1])ans+=c[2*i+j];
    }  
   }
   return ans;
}

int t=0;
int play(int x){
 
  //printf("x=%d\n",x);
  //print_board();
  int score;
  if(x==9){
    return point_check();
  }
  else if(x%2==0){
    score=0;
    for(int i=0;i<9;i++){
      // for(int j=0;j<3;j++){
	if(board[i]==0){
	  board[i]=1;
	  int temp=play(x+1);
	  score=max(score,temp);
	  board[i]=0;
	}
	//}
    }
    //return score;
  }
  
  else {
    score=100000000;
    for(int i=0;i<9;i++){
      //for(int j=0;j<3;j++){
	if(board[i]==0){
	  board[i]=2;
	  int temp=play(x+1);
	  score=min(score,temp);
	  board[i]=0;
	}
	//}
    }
    //return score;
  }
  return score;
}

int main(){
  int ans=0;
  int sum=0;
  for(int i=0;i<6;i++){
    //for(int j=0;j<3;j++){
      scanf("%d",&b[i]);
      sum+=b[i];
      //}
  }
  for(int i=0;i<6;i++){
    //for(int j=0;j<2;j++){
      scanf("%d",&c[i]);
      sum+=c[i];
      //}
  }
  ans=play(0);
  printf("%d\n",ans);
  printf("%d\n",sum-ans);
  return 0;
}

Submission Info

Submission Time
Task C - 双子と○×ゲーム
User noteton
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1426 Byte
Status AC
Exec Time 25 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:72:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d",&b[i]);
                        ^
./Main.cpp:78:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d",&c[i]);
                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 24
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 25 ms 256 KB
sample-02.txt AC 25 ms 256 KB
test-01.txt AC 25 ms 384 KB
test-02.txt AC 25 ms 256 KB
test-03.txt AC 25 ms 384 KB
test-04.txt AC 25 ms 256 KB
test-05.txt AC 25 ms 256 KB
test-06.txt AC 25 ms 256 KB
test-07.txt AC 25 ms 256 KB
test-08.txt AC 25 ms 256 KB
test-09.txt AC 25 ms 256 KB
test-10.txt AC 25 ms 256 KB
test-11.txt AC 25 ms 256 KB
test-12.txt AC 25 ms 256 KB
test-13.txt AC 25 ms 256 KB
test-14.txt AC 25 ms 256 KB
test-15.txt AC 25 ms 256 KB
test-16.txt AC 25 ms 256 KB
test-17.txt AC 25 ms 256 KB
test-18.txt AC 25 ms 256 KB
test-19.txt AC 25 ms 256 KB
test-20.txt AC 25 ms 256 KB