# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290513 | matheo_apd | Chessboard (IZhO18_chessboard) | C++17 | 210 ms | 5880 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define maxn 100005
#define ll long long int
ll n, k;
vector<int> chess[maxn];
void solve_k0(){
ll 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(){
memset(chess, 0, sizeof chess);
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].push_back(y);
}
ll cont = 0;
for(int i = 1; i <= n; i++){
ll cont_errado = 0, cont_certo = 0;
for(int j = 0; j < chess[i].size(); j++){
//if((i+j)%2 == chess[i][j]) cont_errado++;
int row = chess[i][j];
if(i%2 == row%2) cont_certo++;
else cont_errado++;
}
cont += cont_errado + n/2 + i%2 - cont_certo;
}
cout << min(cont, n*n - cont) << endl;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |