14890 Samsung sw test

์ฝ”๋“œ

#include <iostream>
#include <cstring>
#define MAX_N 100
 
using namespace std;
 
int map[MAX_N][MAX_N];
int width;
int need;
 
int checkEveryArr();
bool checkSingleArr(int arr[MAX_N]);
 
int main() {
	cin >> width >> need;
	for (int i = 0; i < width; i++)
		for (int j = 0; j < width; j++)
			cin >> map[i][j];
	cout << checkEveryArr();
}
 
int checkEveryArr() {
	int count = 0;
 
	//ํ–‰
	int temp[MAX_N];
	for (int row = 0; row < width; row++) {
		if (checkSingleArr(map[row])) {
			count++;
		}
	}
 
	//์—ด
	for (int col = 0; col < width; col++) {
		for (int j = 0; j < width; j++)
			temp[j] = map[j][col];
		if (checkSingleArr(temp)) {
			count++;
		}
	}
	return count;
}
 
bool checkSingleArr(int arr[MAX_N]) {
	bool checked[MAX_N];
	memset(checked, 0, sizeof(bool) * width);
 
	int ex = arr[0];
	for (int i = 1; i < width; i++) {
		if (ex != arr[i]) {
			int difference = ex - arr[i];
			if (difference == -2 || difference == 2)
				return false;
 
			if (difference == 1) {
				if (width - i >= need) {
					for (int k = 0; k < need; k++)
						if (arr[i] != arr[i + k])
							return false;
					for (int k = 0; k < need; k++)
						checked[i + k] = true;
				}
				else
					return false;
			}
			else if (difference == -1) {
				if (i >= need) {
					for (int k = 1; k <= need; k++)
						if (ex != arr[i - k] || checked[i-k])
							return false;
				}
				else
					return false;
			}
		}
		ex = arr[i];
	}
	return true;
}