# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
855850 | 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 <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, k; cin >> n >> k;
int ans = n * n;
array<int, 4> a[k];
for(auto &[i, j, k, l] : a) cin >> i >> j >> k >> l;
for(int i = 1; i < n; i++) if(!(n % i)) {
#define c(V) (s * ((V) / (2 * s)) + min(s, (V) % (2 * s)))
int t = c(n) * (n - c(n)) + c(n) * (n - c(n));
for(auto [i, j, k, l] : a) {
int u = k - i + 1, x = c(k) - c(i - 1);
int v = l - j + 1, y = c(l) - c(j - 1);
t += 2 * (x * y + (u - x) * (v - y)) - u * v;
}
ans = min(ans, min(t, n * n - t));
}
cout << ans << '\n';
}