Submission #3422380


Source Code Expand

#include<iostream>
#include<vector>
using namespace std;

int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};


void solve(vector<vector<char>>& A,int x,int y){
  if(A[x][y]=='x'){
    return;
  }
  
  A[x][y]='x';
  for(int i=0;i<4;i++){
    int rx=x+dx[i];
    int ry =y+dy[i];
    if(rx>=0&&rx<10&&ry>=0&&ry<10){
      solve(A,rx,ry);
    }
  }
return;
}
 

int main(){
  vector<vector<char>> A;
  for(int i=0;i<10;i++){
    vector<char> C;
    for(int j=0;j<10;j++){
      //cin >> A[i][j];
    char c;
    cin >> c;
    C.push_back(c);
    }
    A.push_back(C);
  }
  int ans=0;
  
  for(int i=0;i<10;i++){
    for(int j=0;j<10;j++){
      vector<vector<char>> B(A);
      if(A[i][j]=='x'){
        B[i][j]='o';
        solve(B,i,j);
        B[i][j]='x';
      }
      int count = 0;
      for(int ii=0;ii<10;ii++){
        for(int jj=0;jj<10;jj++){
          if(B[ii][jj]=='x'){
            count++;
          }
        }
      }
      
      if(count==100){
        ans++;
      }
    }
  }
  if(ans){
    cout<<"YES"<<endl;
  }
  else{
    cout<<"NO"<<endl;
  }
  return 0;
}
      
       

Submission Info

Submission Time
Task B - 埋め立て
User Yasagure
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1162 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 33
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 10_rand_00.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 10_rand_05.txt, 10_rand_06.txt, 10_rand_07.txt, 10_rand_08.txt, 10_rand_09.txt, 10_rand_10.txt, 10_rand_11.txt, 10_rand_12.txt, 10_rand_13.txt, 10_rand_14.txt, 10_rand_15.txt, 10_rand_16.txt, 10_rand_17.txt, 10_rand_18.txt, 10_rand_19.txt, 10_rand_20.txt, 10_rand_21.txt, 10_rand_22.txt, 10_rand_23.txt, 10_rand_24.txt, 10_rand_25.txt, 10_rand_26.txt, 10_rand_27.txt, 10_rand_28.txt, 10_rand_29.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 256 KB
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
10_rand_00.txt AC 1 ms 256 KB
10_rand_01.txt AC 1 ms 256 KB
10_rand_02.txt AC 1 ms 256 KB
10_rand_03.txt AC 1 ms 256 KB
10_rand_04.txt AC 1 ms 256 KB
10_rand_05.txt AC 1 ms 256 KB
10_rand_06.txt AC 1 ms 256 KB
10_rand_07.txt AC 1 ms 256 KB
10_rand_08.txt AC 1 ms 256 KB
10_rand_09.txt AC 1 ms 256 KB
10_rand_10.txt AC 1 ms 256 KB
10_rand_11.txt AC 1 ms 256 KB
10_rand_12.txt AC 1 ms 256 KB
10_rand_13.txt AC 1 ms 256 KB
10_rand_14.txt AC 1 ms 256 KB
10_rand_15.txt AC 1 ms 256 KB
10_rand_16.txt AC 1 ms 256 KB
10_rand_17.txt AC 1 ms 256 KB
10_rand_18.txt AC 1 ms 256 KB
10_rand_19.txt AC 1 ms 256 KB
10_rand_20.txt AC 1 ms 256 KB
10_rand_21.txt AC 1 ms 256 KB
10_rand_22.txt AC 1 ms 256 KB
10_rand_23.txt AC 1 ms 256 KB
10_rand_24.txt AC 1 ms 256 KB
10_rand_25.txt AC 1 ms 256 KB
10_rand_26.txt AC 1 ms 256 KB
10_rand_27.txt AC 1 ms 256 KB
10_rand_28.txt AC 1 ms 256 KB
10_rand_29.txt AC 1 ms 256 KB