14890. 경사로

#include <iostream>
using namespace std;
int map[110][110];

int main() {

    freopen("inp.inp", "r", stdin);
    freopen("out.out", "w", stdout);
    int n, l;
    cin >> n >> l;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> map[i][j];
        }
    }

    int answer = 0;


    for (int i = 0; i < n; i++) {
        int high = map[i][0];
        int sig = 1;

        int check[110] = { 0 };
        for (int j = 1; j < n; j++) {
            if (high == map[i][j])
                continue;
            else if (high + 1 == map[i][j]) {
                int s = 0;
                int box = map[i][j - 1];
                for (int k = j - 1; k >= j - l; k--) {
                    if (check[k] == 1) {
                        s = 1;
                        break;
                    }
                    if (k < 0 || box != map[i][k]) {
                        s = 1;
                        break;
                    }
                    check[k] = 1;
                }
                if (s) {
                    sig = 0;
                    break;
                }
                high = map[i][j];
            }
            else if (high == map[i][j] + 1) {
                int s = 0;
                int box = map[i][j];
                check[j] = 1;
                for (int k = j + 1; k <= j + l - 1; k++) {
                    if (check[k] == 1) {
                        s = 1;
                        break;
                    }
                    if (k >= n || box != map[i][k]) {
                        s = 1;
                        break;
                    }
                    check[k] = 1;
                }
                if (s) {
                    sig = 0;
                    break;
                }
                high = map[i][j];
            }
            else {
                sig = 0;
                break;
            }
        }
        if (sig)
            answer++;
    }

    for (int j = 0; j < n; j++) {
        int high = map[0][j];
        int sig = 1;
        int check[110] = { 0 };
        for (int i = 1; i < n; i++) {
            if (high == map[i][j])
                continue;
            else if (high + 1 == map[i][j]) {
                int s = 0;
                int box = map[i - 1][j];
                for (int k = i - 1; k >= i - l; k--) {

                    if (check[k] == 1) {
                        s = 1;
                        break;
                    }
                    if (k < 0 || box != map[k][j]) {
                        s = 1;
                        break;
                    }

                    check[k] = 1;
                }
                if (s) {
                    sig = 0;
                    break;
                }
                high = map[i][j];
            }
            else if (high == map[i][j] + 1) {
                int s = 0;
                int box = map[i][j];
                check[i] = 1;
                for (int k = i + 1; k <= i + l - 1; k++) {
                    if (check[k] == 1) {
                        s = 1;
                        break;
                    }
                    if (k >= n || box != map[k][j]) {
                        s = 1;
                        break;
                    }
                    check[k] = 1;
                }
                if (s) {
                    sig = 0;
                    break;
                }
                high = map[i][j];
            }
            else {
                sig = 0;
                break;
            }
        }
        if (sig)
            answer++;
    }
    cout << answer;
    return 0;
}

 

 

www.acmicpc.net/problem/14890

14890번: 경사로