# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77048 | antimirage | Chessboard (IZhO18_chessboard) | C++17 | 49 ms | 11288 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;
const int N = 1e5 + 5;
int n, k, x[2][N], y[2][N];
long long ans = 1e18;
int main()
{
cin >> n >> k;
for (int i = 1; i <= k; i++)
{
scanf("%d%d", &x[0][i], &y[0][i]), x[0][i]--, y[0][i]--;
scanf("%d%d", &x[1][i], &y[1][i]), x[1][i]--, y[1][i]--;
}
for (int i = 1; i * i <= n; i++)
{
if (n % i != 0) continue;
long long res = 0;
for (int j = 1; j <= k; j++)
{
if ((x[0][j] / i + y[0][j] / i) & 1)
res++;
}
// cout << i << " --> " << min( res + (n * 1ll * n + 1) / 2 - (k - res), (k - res) + (n * 1ll * n) / 2 - res) << endl;
ans = min(ans, min( res + (n * 1ll * n + 1) / 2 - (k - res), (k - res) + (n * 1ll * n) / 2 - res) );
}
cout << ans << endl;
}
/**
6 8
3 3 3 3
1 2 1 2
3 4 3 4
5 5 5 5
4 3 4 3
4 4 4 4
2 1 2 1
3 6 3 6
4 1
4 1 4 4
**/
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... |