# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
855842 | 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>
#include <climits>
#define int long long
using namespace std;
int f(int s, int a) {
a %= s * 2;
return min(a, s * 2 - a);
}
int main() {
int x1[N], y1[N], x2[N], y2[N];
int n, k, temp, ans;
cin >> n >> k;
for (i = 0; i < k; i++){
cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
--x1[i]; --y1[i];
}
ans = LLONG_MAX;
for (i = 1; i < n; i++)
if (n % i == 0) {
k = (n / i) * (n / i) / 2 * i * i;
for (i = 0; i < n; i++) temp += (f(i, x2[i]) - f(i, x1[i])) * (f(i, y2[i]) - f(i, y1[i]));
ans = min(ans, min(temp, n * n - temp));
}
cout << ans << '\n';
}