Submission #343277

---

Source Code Expand

import java.util.*;

public class Main {

	
	public static void main(String[] arg){
		
		Scanner sc = new Scanner(System.in);
		int count = 0;
		char[][] c = new char[10][10];
		for(int i = 0;i < 10;i++){
			String s = sc.nextLine();
			for(int j = 0;j < 10;j++){
				c[i][j] = s.charAt(j);
				if(c[i][j] == 'o'){
					count++;
				}
			}
		}
		boolean ans = false;
		boolean first = true;
		flag:
		for(int i = 0;i < 10;i++)
		{
			for(int j = 0;j < 10;j++){
				if(first && c[i][j] == 'o'){
					first = false;
					ans = ri(c,i,j,count);
				}
				if(c[i][j] == 'x'){
					c[i][j] = 'o';
					ans = ri(c,i,j,count);
					c[i][j] = 'x';
				}
				if(ans){
					break flag;
				}
			}
		}
		if(ans)System.out.println("YES");
		else System.out.println("NO");
	}
	public static boolean ri(char[][] c,int a,int b,int count){
		ArrayList<Integer> ar1 = new ArrayList<Integer>();
		ArrayList<Integer> ar2 = new ArrayList<Integer>();
		int[] dx = {1,0,-1,0};
		int[] dy = {0,1,0,-1};
		ar1.add(a);
		ar2.add(b);
		int count2 = 0;
		char[][] check = new char[10][10];
		char[] ch = new char[1];
		//System.out.println(check[0][0]);
		while(ar1.size() > 0){
			int x = ar1.get(0);
			int y = ar2.get(0);
			//System.out.println(x);
			for(int i = 0;i < dx.length;i++){
				int nx = x + dx[i];
				int ny = y + dy[i];
				boolean jouken = (nx >= 0 && nx < 10 && ny >= 0 && ny < 10);
				//System.out.println(jouken);
				if(jouken && c[nx][ny] == 'o' && check[nx][ny] == ch[0]){
					ar1.add(nx);
					ar2.add(ny);
					check[nx][ny] = 'o';
					count2++;
				} else if(jouken && c[nx][ny] == 'x' && check[nx][ny] == ch[0]){
					check[nx][ny] = 'x';
				}
			}
			ar1.remove(0);
			ar2.remove(0);
		}
		//System.out.println(a + "   " + b + "   " + count2 + "  " + count);
		boolean ans = true;
		if(count == count2-1)ans = true;
		else ans=false;
		return ans;
	}
	static int find(int[]par,int x){
		if(par[x] == x)return par[x];
		else {
			return par[x] = find(par,par[x]);
		}
	}
	static void unite(int[] par,int[] rank,int x,int y){
		if(find(par,x) == find(par,y))return;
		else{
			if(rank[x] < rank[y]){
				par[x] = find(par,y);
			} else {
				par[y] = find(par,x);
				if(rank[x] == rank[y])rank[x]++;
			}
		}
	}
	
}

Submission Info

Judge Result