SEA7234_안전 기지(User Problem)

https://www.swexpertacademy.com/main/code/userProblem/userProblemDetail.do?contestProbId=AWlQiykau0oDFARe&categoryId=AWlQiykau0oDFARe&categoryType=CODE

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
 
public class Solution {
    
    static int[] dx = {0,1,0,-1};
    static int[] dy = {-1,0,1,0};
    static int N;
 
    public static void main(String[] args) throws Exception {
        
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        
        int test_case = Integer.parseInt(br.readLine().trim());
        for (int tc = 1; tc <= test_case; tc++) {
            
            StringTokenizer st1 = new StringTokenizer(br.readLine().trim(), " ");
            N = Integer.parseInt(st1.nextToken());
            int B = Integer.parseInt(st1.nextToken());
            int[][] map = new int[N+1][N+1];
            for (int i = 0; i < B; i++) {
                StringTokenizer st2 = new StringTokenizer(br.readLine().trim(), " ");
                int x = Integer.parseInt(st2.nextToken());
                int y = Integer.parseInt(st2.nextToken());
                // 기지의 위치 ++
                map[x][y]++;
                solve(map, x, y);
            }
            // 중복된 곳 중에서 최대값 출력
            int max = 0;
            for (int i = 1; i <= N; i++) {
                for (int j = 1; j <= N; j++) {
                    if(max < map[i][j]) {
                        max = map[i][j];
                    }
                }
            }
            System.out.println("#" + tc + " " + max);
        } // end of tc
    } // end of main
 
    // 여기서 바로 인접한 곳 ++
    private static void solve(int[][] map, int x, int y) {
        
        for (int i = 0; i < 4; i++) {
            int nx = x + dx[i];
            int ny = y + dy[i];
            for (int j = 0; j < 2; j++) { // 인접한 곳(두번째까지)++
                if(nx>0 && nx<=N && ny>0 && ny<=N) {
                    map[nx][ny]++;
                }
                nx += dx[i];
                ny += dy[i];
            }
        }
    } // end of solve
} // end of class