# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
855830 | Trisanu_Das | Chessboard (IZhO18_chessboard) | C++17 | 0 ms | 0 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 <iostream>
#include <algorithm.h>
using namespace std;
#define int long long
int n, k, tot, x1[100000], x2[100000], y1[100000], y2[100000];
signed main(){
cin >> n >> k;
for(int i = 0; i < n; i++){
cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
x1[i]--; x2[i]--; y2[i]--; y1[i]--;
tot += (x2[i] - x1[i] + 1) * (y2[i] - y1[i] + 1);
}
int ans = LLONG_MAX;
for(int i = 0; i < n; i++){
if(n % i == 0){
int alt1 = ((n / i) * (n / i)) / (2 * i * i), alt2 = ((n / i) * (n / i + 1)) / (2 * i * i), t = 0;
for(int j = 0; j < k; j++) if(((x1[j] / i) & 1) == ((y1[j] / i) & 1)) t++;
ans = min(ans, min((a - t) + (s-t), (b - (s-t)) + t));
}
}
cout << ans << '\n';
}