Submission #3420315

---

Source Code Expand

#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <cstdio>
#include <string.h>
#include <cstring>
using namespace std;



char table[10][10];
char table2[10][10];
int d1[] = {0,0,1,-1};
int d2[] = {1,-1,0,0};


void dfs(int i, int j){
    if(i < 0 || j < 0) return;
    if(i >= 10 || j >= 10) return;
    if(table2[i][j] == 'x') return;
    else {
        table2[i][j] = 'x';
        for(int k = 0; k < 4; k++){
            dfs(i + d1[k] ,j + d2[k]);
        }
       
    }
}

bool isAllBatsu(){
    for(int i = 0; i < 10; i++){
        for(int j = 0; j < 10; j++){
            if(table2[i][j] == 'o'){
                return false;
            }
        }
    }
    return true;
}

int main(){
    for(int i = 0; i < 10;i++){
        cin >> table[i];
    }

    for(int i = 0; i < 10; i++){
        for(int j = 0; j < 10; j++){
            memcpy(table2,table,sizeof(table));
            if(table2[i][j] == 'x') {
                table2[i][j] = 'o';
                dfs(i,j);
            }
            if(isAllBatsu()){
                cout << "YES" << endl;
                return 0;
            }
        }
    }
    cout << "NO" << endl;
    return 0;
}

Submission Info

Judge Result