[SWEA] 오목 판정

 

[문제]

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AXaSUPYqPYMDFASQ

SW Expert Academy

 

 

 

[소스 코드]

import java.util.*;
import java.io.*;
public class Solution {
	static int n;
	static char[][] map;
	static int[] dr = {1,1,1,0};
	static int[] dc = {-1,0,1,1};
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int T = Integer.parseInt(br.readLine());
		for(int tc=1;tc<=T;tc++) {
			n = Integer.parseInt(br.readLine());
			map = new char[n][n];
			for(int i=0;i<n;i++) {
				String s = br.readLine();
				for(int j=0;j<n;j++) {
					map[i][j] = s.charAt(j);
				}
			}
			boolean possible = false;
			for(int i=0;i<n;i++) {
				for(int j=0;j<n;j++) {
					if(map[i][j]!='o') continue;
					for(int d=0;d<4;d++) {
						if(find(i,j,d)) possible = true;
					}
				}
			}
			if(possible) System.out.println("#"+tc+" YES");
			else System.out.println("#"+tc+" NO");
		}
	}
	private static boolean find(int i,int j,int d) {
		char c = map[i][j];
		int nr = i;
		int nc = j;
		for(int v=1;v<5;v++) {
			nr += dr[d];
			nc += dc[d];
			if(nr<0 || nr>=n || nc<0 || nc>=n) return false;
			if(map[nr][nc]!=c) return false;
		}
		return true;
	}
}