침대 밖은 위험해!

#include<iostream>
#include<queue>
using namespace std;

int m, n, cnt = 0, day = -1, map[1001][1001];
int dr[4] = { -1, 0, 1, 0 };
int dc[4] = { 0, -1, 0, 1 };

int main(void){
	freopen("text.txt", "r", stdin);
	cin >> m >> n;
	queue<pair<int, int> > q;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			cin >> map[i][j];
			if (map[i][j] == 0){
				cnt++;
			}
			else if (map[i][j] == 1){
				q.push(make_pair(i, j));
			}
		}
	}

	int size = q.size();
	while (!q.empty()){
		int r = q.front().first;
		int c = q.front().second;
		q.pop();
		size--;

		for (int i = 0; i < 4; i++){
			int nr = r + dr[i];
			int nc = c + dc[i];

			if (0 <= nr && nr < n && 0 <= nc && nc < m && map[nr][nc] == 0){
				q.push(make_pair(nr, nc));
				map[nr][nc] = 1;
				cnt--;
			}
		}

		if (size == 0){
			day++;
			size = q.size();
		}
	}

	if (cnt == 0)
		cout << day << "\n";
	else
		cout << -1 << "\n";
}

#include<iostream>
using namespace std;

int t, w, h, map[51][51], ans;
int dx[8] = { -1, -1, 0, 1, 1, 1, 0, -1 };
int dy[8] = { 0, 1, 1, 1, 0, -1, -1, -1 };

void dfs(int r, int c){
	map[r][c] = 0;

	for (int k = 0; k < 8; k++){
		int nr = r + dx[k];
		int nc = c + dy[k];

		if (0 <= nr && nr < h && 0 <= nc && nc < w && map[nr][nc]){
			dfs(nr, nc);
		}
	}
}

int main(void){
	while (cin >> w >> h && w !=0 && h != 0){
		for (int i = 0; i < h; i++){
			for (int j = 0; j < w; j++){
				cin >> map[i][j];
			}
		}
		ans = 0;
		for (int i = 0; i < h; i++){
			for (int j = 0; j < w; j++){
				if (map[i][j]){
					ans++;
					dfs(i, j);
				}
			}
		}
		cout << ans << "\n";
	}
}

#include<iostream>
using namespace std;

int n, l, map[2][101][101], check[2][101][101], ans = 0;

int main(void){
	cin >> n >> l;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < n; j++){
			cin >> map[0][i][j];
			map[1][j][i] = map[0][i][j];
		}
	}
	
	for (int i = 0; i < 2; i++){
		for (int j = 0; j < n; j++){
			int k = 0;
			for (; k < n - 1; k++){
				if (map[i][j][k] == map[i][j][k + 1]) continue;
				else if (map[i][j][k] + 1 == map[i][j][k + 1]){
					if (k + 1 - l >= 0){
						int m = k + 1 - l;
						if (m == k)
							if (check[i][j][m])
								break;
						for (; m < k; m++){
							if (map[i][j][m] != map[i][j][m + 1] || check[i][j][m] || check[i][j][m + 1]){
								break;
							}
						}
						if (m == k){
							for (int a = k + 1 - l; a < k + 1; a++){
								check[i][j][a] = true;
							}
							continue;
						}
						else break;
					}
					else break;
				}
				else if (map[i][j][k] - 1 == map[i][j][k + 1]){
					if (k + l < n){
						int m = k + 1;
						if (m == k + l)
							if (check[i][j][m])
								break;
						for (; m < k + l; m++){
							if (map[i][j][m] != map[i][j][m + 1] || check[i][j][m] || check[i][j][m + 1]){
								break;
							}
						}
						if (m == k + l){
							for (int a = k + 1; a < k + l + 1; a++){
								check[i][j][a] = true;
							}
							continue;
						}
						else break;
					}
					else break;
				}
				else break;
			}
			
			if (k == n - 1)
				ans++;
		}
	}
	cout << ans << "\n";
}

#include<stdio.h>

int main(void){
	int input[100][100], i, j, n, l, arr[200][100], mark[100] = { 0 }, k, ans = 0, flag;
	scanf("%d %d", &n, &l);
	for (int i = 0; i < n; i++){
		for (int j = 0; j < n; j++){
			scanf("%d", &input[i][j]);
			arr[i][j] = input[i][j];
		}
	}

	for (int i = 0; i < n; i++){
		for (int j = 0; j < n; j++){
			arr[i + n][j] = input[j][i];
		}
	}

	for (int i = 0; i < 2 * n; i++){
		flag = 1;
		for (int j = 0; j < n; j++)
			mark[j] = 0;

		for (int j = 0; j < n - 1 && flag; j++){
			if (arr[i][j] == arr[i][j + 1] + 1){ //left higher
				for (int k = 1; k <= l; k++){
					if (mark[j + k] == 1 || j + l >= n || arr[i][j + k] != arr[i][j + 1]){
						flag = 0;
						break;
					}
					mark[j + k] = 1;
				}
			}
			else if (arr[i][j] + 1 == arr[i][j + 1]){
				for (int k = 0; k < l; k++){
					if (mark[j - k] == 1 || j - l < -1 || arr[i][j - k] != arr[i][j]){
						flag = 0;
						break;
					}
					mark[j - k] = 1;
				}
			}
			else if (arr[i][j] == arr[i][j + 1])
				continue;
			else{
				flag = 0;
				break;
			}
		}
		if (flag == 1)
			ans++;
	}
	printf("%d\n", ans);
}

#include <stdio.h>
 
int n, l, a[101][101], dx[] = { 0,0,1,-1 }, dy[] = { 1,-1,0,0 }, ans;
 
int main() {
    scanf("%d%d", &n, &l);
    int i, j;
    for (i = 0; i < n; i++) for (j = 0; j < n; j++) scanf("%d", &a[i][j]);
    for (i = 0; i < n; i++) {
        int cnt = 1;
        for (j = 0; j < n - 1; j++) {
            if (a[i][j] == a[i][j + 1]) cnt++;
            else if (a[i][j] + 1 == a[i][j + 1] && cnt >= l) cnt = 1;
            else if (a[i][j] - 1 == a[i][j + 1] && cnt >= 0) cnt = -l + 1;
            else break;
        }
        if (j == n - 1 && cnt >= 0) ans++;
        cnt = 1;
        for (j = 0; j < n - 1; j++) {
            if (a[j][i] == a[j + 1][i]) cnt++;
            else if (a[j][i] + 1 == a[j + 1][i] && cnt >= l) cnt = 1;
            else if (a[j][i] - 1 == a[j + 1][i] && cnt >= 0) cnt = -l + 1;
            else break;
        }
        if (j == n - 1 && cnt >= 0) ans++;
    }
    printf("%d\n", ans);
    return 0;
}