learn-algorithm/baekjoon/src/BOJ14890.java at master · cosmicb0y/learn-algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class BOJ14890 {
    static int n;
    static int l;
    static int[][] map;
    static boolean[][] visited;
    static boolean[][] visited2;

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());

        n = Integer.parseInt(st.nextToken());
        l = Integer.parseInt(st.nextToken());

        map = new int[n + 2][n + 2];
        visited = new boolean[n + 2][n + 2];
        visited2 = new boolean[n + 2][n + 2];

        Arrays.fill(map[0], -1);
        for (int i = 1; i <= n; i++) {
            st = new StringTokenizer(br.readLine());
            map[i][0] = -1;
            for (int j = 1; j <= n; j++) {
                map[i][j] = Integer.parseInt(st.nextToken());
            }
            map[i][n + 1] = -1;
        }
        Arrays.fill(map[n + 1], -1);

        int count = 0;

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j < n; j++) {
                if (map[i][j] - map[i][j + 1] == 1) {
                    boolean canDo = true;
                    int height = map[i][j + 1];
                    if (l + j > n) break;
                    for (int k = j + 1; k <= l + j; k++) {
                        if (map[i][k] != height || visited[i][k]) {
                            canDo = false;
                            break;
                        }
                    }
                    if (canDo) {
                        int nextIndex = Math.min(l + j + 1, n);
                        if (map[i][nextIndex] > height) break;
                        for (int k = j + 1; k <= l + j; k++) {
                            visited[i][k] = true;
                        }
                    } else {
                        break;
                    }
                }
                if (map[i][j] - map[i][j + 1] == -1) {
                    boolean canDo = true;
                    int height = map[i][j];
                    if (j - l < 0) break;
                    for (int k = j; k > j - l; k--) {
                        if (map[i][k] != height || visited[i][k]) {
                            canDo = false;
                            break;
                        }
                    }
                    if (canDo) {
                        int nextIndex = Math.max(j - l, 1);
                        if (map[i][nextIndex] > height) break;
                        for (int k = j; k > j - l; k--) {
                            visited[i][k] = true;
                        }
                    }
                    else {
                        break;
                    }
                }
                if (Math.abs(map[i][j] - map[i][j + 1]) > 1) break;
                if (j == n - 1) {
                    //System.out.println("hori: " + i);
                    count++;
                }
            }
        }

        //System.out.println(count);

        for (int j = 1; j <= n; j++) {
            for (int i = 1; i < n; i++) {
                if (map[i][j] - map[i + 1][j] == 1) {
                    boolean canDo = true;
                    int height = map[i + 1][j];
                    if (l + i > n) break;
                    for (int k = i + 1; k <= l + i; k++) {
                        if (map[k][j] != height || visited2[k][j]) {
                            canDo = false;
                            break;
                        }
                    }
                    if (canDo) {
                        int nextIndex = l + i + 1;
                        if (map[nextIndex][j] > map[i + 1][j]) break;

                        for (int k = i + 1; k <= l + i; k++) {
                            visited2[k][j] = true;
                        }
                    } else {
                        break;
                    }
                }
                if (map[i][j] - map[i + 1][j] == -1) {
                    boolean canDo = true;
                    int height = map[i][j];
                    if (i - l < 0) break;
                    for (int k = i; k > i - l; k--) {
                        if (map[k][j] != height || visited2[k][j]) {
                            canDo = false;
                            break;
                        }
                    }
                    if (canDo) {
                        int nextIndex = Math.max(i - l, 1);
                        if (map[nextIndex][j] > height) break;
                        for (int k = i; k > i - l; k--) {
                            visited2[k][j] = true;
                        }
                    }
                    else {
                        break;
                    }
                }
                if (Math.abs(map[i][j] - map[i + 1][j]) > 1) break;
                if (i == n - 1) {
                    //System.out.println("verti: " + j);
                    count++;
                }
            }
        }


        System.out.println(count);
    }

}