제출 #290497

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290497		matheo_apd	Chessboard (IZhO18_chessboard)	C++14	8 / 100	1 ms	384 KiB

chessboard

#include <bits/stdc++.h>
using namespace std;
#define maxn 105
int n, k;
int chess[maxn][maxn];
void solve_k0(){
	int minimo = 999999;
	for(int i = 1; i < n; i++){
		if(n % i != 0) continue;
		int test = i*i;
		minimo = min(minimo, ((n*n/test)/2)*test);
	}
	cout << minimo << endl;
}
int main(){
	cin >> n >> k;
	if(k == 0) solve_k0();
	else{
		for(int i = 0; i < k; i++){
			int x, y, l, m;
			cin >> x >> y;
			cin >> l >> m; //8)
			chess[x][y] = 1;
		}
		int cont_errado = 0;
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= n; j++)
				if((i+j)%2 == chess[i][j]) cont_errado++;
		cout << min(cont_errado, n*n - cont_errado) << endl;
	}
	return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 15
• Subtask 4: 0 / 16
• Subtask 5: 0 / 23
• Subtask 6: 0 / 30