# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290481 | 2020-09-03T21:45:57 Z | matheo_apd | Chessboard (IZhO18_chessboard) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define maxn 105 int chess[maxn][maxn]; int main(){ int n, k; cin >> n >> k; for(int i = 0; i < k; i++){ int x, y; cin >> x >> y; cin >> x >> y; //8) chess[i][j] = 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; }