[C++] 삼성 4014. [모의 SW 역량테스트] 활주로 건설

(1시간 30분) 생각나는대로 코딩하면서 예외처리를 해주니 시간이 오래걸린느낌..

#include<iostream>
#include<vector>
#include<string.h>
using namespace std;
 
int arr[20][20];
bool bridge[20][20];
int N, X;
 
int main() {
    int T;
    cin >> T;
    for (int t = 1; t <= T; t++) {
        memset(arr, 0, sizeof(arr));
        memset(bridge, false, sizeof(bridge));
        cin >> N >> X;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                cin >> arr[i][j];
            }
        }
 
        int count = 0;
        for (int i = 0; i < N; i++) {
            int j = 0;
            int value = arr[i][j++];
            while (j < N) {
                if (arr[i][j] < value) {
                    if (j + X - 1 >= N) {
                        break;
                    }
                    bool check = true;
                    for (int k = 0; k < X; k++) {
                        if (arr[i][j + k] != value - 1 || bridge[i][j + k] == true) {
                            check = false;
                        }
                        bridge[i][j + k] = true;
                    }
 
                    if (check) {
                        j = j + X - 1;
                        value = value - 1;
                    }
                    else break;
                }
                else if (arr[i][j] > value) {
                    if (j - X < 0) {
                        break;
                    }
                    bool check = true;
                    for (int k = 1; k <= X; k++) {
                        if (arr[i][j - k] != arr[i][j] - 1 || bridge[i][j - k] == true) {
                            check = false;
                        }
                        bridge[i][j - k] = true;
                    }
 
                    if (check) {
                        value = arr[i][j];
                    }
                    else break;
                }
 
                j++;
            }
 
            if (j == N) {
                //cout << i << "행 클리어" << endl;
                count++;
            }
        }
        memset(bridge, false, sizeof(bridge));
        for (int j = 0; j < N; j++) {
            int i = 0;
            int value = arr[i++][j];
            while (i < N) {
                if (arr[i][j] < value) {
                    if (i + X - 1 >= N) {
                        break;
                    }
                    bool check = true;
                    for (int k = 0; k < X; k++) {
                        if (arr[i + k][j] != value - 1 || bridge[i + k][j] == true) {
                            check = false;
                        }
                        bridge[i+k][j] = true;
                    }
 
                    if (check) {
                        i = i + X - 1;
                        value = value - 1;
                    }
                    else break;
                }
                else if (arr[i][j] > value) {
                    if (i - X < 0) {
                        break;
                    }
                    bool check = true;
                    for (int k = 1; k <= X; k++) {
                        if (arr[i - k][j] != arr[i][j] - 1 || bridge[i - k][j] == true) {
                            check = false;
                        }
                        bridge[i - k][j] == true;
                    }
 
                    if (check) {
                        value = arr[i][j];
                    }
                    else break;
                }
 
                i++;
            }
 
            if (i == N) {
                count++;
                //cout << j << "열 클리어" << endl;
            }
        }
 
        cout << "#" << t << " " << count << endl;
    }
}