[SW Expert Academy] 오목 판정 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AXaSUPYqPYMDFASQ&categoryId=AXaSUPYqPYMDFASQ&categoryType=CODE&problemTitle=%EC%98%A4%EB%AA%A9&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1

SW Expert Academy

 

출처

https://www.youtube.com/watch?app=desktop&v=e8ti5nWAqtc

 

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {
			int n = sc.nextInt();

			char arr[][] = new char[n][n];

			for (int i = 0; i < n; i++) {
				arr[i] = sc.next().toCharArray();
			}

			String ans = solve(arr);

			System.out.println("#" + tc + " " + ans);
		}
	}

	public static String solve(char arr[][]) {

		int directions[][] = { { 0, 1 }, { 1, 0 }, { 1, 1 }, { -1, 1 } };
		for (int i = 0; i < arr.length; i++) {
			for (int j = 0; j < arr.length; j++) {
				for (int di[] : directions) {
					int dx = di[0];
					int dy = di[1];
					boolean isOmok = true;
					for (int mul = 0; mul < 5; mul++) {
						int nx = i + dx * mul;
						int ny = j + dy * mul;
						
						if(nx<0||ny<0||nx>=arr.length||ny>=arr.length||arr[nx][ny]!='o') {
							isOmok=false;
							break;
						}
					}
					if(isOmok) {
						return "YES";
					}
				}
			}
		}
		return "NO";

	}
}