#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const long long INF = 1e9 + 5;
const int MAXN = 1e6;
const int base = 317;
typedef long long ll;
const ll bs = 1e5 + 1;
const ll mod = 998244353;
ll ans = INF, n, k, xx[N], yy[N];
ll calc(ll x) {
ll res1 = 0, res2 = 0;
for (int i = 1; i <= k; i++) {
if ((xx[i] / x) % 2 == (yy[i] / x) % 2) {
res1++;
} else {
res2++;
}
}
ll c1 = (n / x) * (n / x) / 2 * x * x;
ll c2 = n * n - c1;
return min(c1 - res2 + res1, c2 - res1 + res2);
}
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cin >> xx[i] >> yy[i] >> xx[i] >> yy[i];
xx[i]--;
yy[i]--;
}
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
ans = min(ans, calc(i));
if (i != 1)
ans = min(ans, calc(n / i));
}
}
cout << ans;
return 0;
}
/*
*/
Compilation message
chessboard.cpp:31:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main() {
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
468 KB |
Output is correct |
3 |
Correct |
2 ms |
468 KB |
Output is correct |
4 |
Correct |
2 ms |
532 KB |
Output is correct |
5 |
Correct |
2 ms |
532 KB |
Output is correct |
6 |
Correct |
2 ms |
532 KB |
Output is correct |
7 |
Correct |
2 ms |
532 KB |
Output is correct |
8 |
Correct |
2 ms |
620 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
24 ms |
1400 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1400 KB |
Output is correct |
2 |
Correct |
2 ms |
1400 KB |
Output is correct |
3 |
Correct |
2 ms |
1400 KB |
Output is correct |
4 |
Correct |
2 ms |
1400 KB |
Output is correct |
5 |
Correct |
2 ms |
1400 KB |
Output is correct |
6 |
Correct |
3 ms |
1400 KB |
Output is correct |
7 |
Correct |
2 ms |
1400 KB |
Output is correct |
8 |
Correct |
2 ms |
1400 KB |
Output is correct |
9 |
Correct |
2 ms |
1400 KB |
Output is correct |
10 |
Correct |
2 ms |
1400 KB |
Output is correct |
11 |
Correct |
2 ms |
1400 KB |
Output is correct |
12 |
Correct |
2 ms |
1400 KB |
Output is correct |
13 |
Correct |
2 ms |
1400 KB |
Output is correct |
14 |
Correct |
2 ms |
1400 KB |
Output is correct |
15 |
Correct |
2 ms |
1400 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1400 KB |
Output is correct |
2 |
Correct |
2 ms |
1400 KB |
Output is correct |
3 |
Correct |
2 ms |
1400 KB |
Output is correct |
4 |
Correct |
2 ms |
1400 KB |
Output is correct |
5 |
Correct |
2 ms |
1400 KB |
Output is correct |
6 |
Correct |
3 ms |
1400 KB |
Output is correct |
7 |
Correct |
2 ms |
1400 KB |
Output is correct |
8 |
Correct |
2 ms |
1400 KB |
Output is correct |
9 |
Correct |
2 ms |
1400 KB |
Output is correct |
10 |
Correct |
2 ms |
1400 KB |
Output is correct |
11 |
Correct |
2 ms |
1400 KB |
Output is correct |
12 |
Correct |
2 ms |
1400 KB |
Output is correct |
13 |
Correct |
2 ms |
1400 KB |
Output is correct |
14 |
Correct |
2 ms |
1400 KB |
Output is correct |
15 |
Correct |
2 ms |
1400 KB |
Output is correct |
16 |
Correct |
12 ms |
1400 KB |
Output is correct |
17 |
Correct |
27 ms |
1916 KB |
Output is correct |
18 |
Correct |
37 ms |
2116 KB |
Output is correct |
19 |
Correct |
96 ms |
2116 KB |
Output is correct |
20 |
Correct |
108 ms |
2192 KB |
Output is correct |
21 |
Correct |
26 ms |
2192 KB |
Output is correct |
22 |
Correct |
2 ms |
2192 KB |
Output is correct |
23 |
Correct |
22 ms |
2192 KB |
Output is correct |
24 |
Correct |
34 ms |
2192 KB |
Output is correct |
25 |
Correct |
6 ms |
2192 KB |
Output is correct |
26 |
Correct |
22 ms |
2192 KB |
Output is correct |
27 |
Correct |
31 ms |
2192 KB |
Output is correct |
28 |
Correct |
36 ms |
2192 KB |
Output is correct |
29 |
Correct |
11 ms |
2192 KB |
Output is correct |
30 |
Correct |
3 ms |
2192 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
24 ms |
1400 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
468 KB |
Output is correct |
3 |
Correct |
2 ms |
468 KB |
Output is correct |
4 |
Correct |
2 ms |
532 KB |
Output is correct |
5 |
Correct |
2 ms |
532 KB |
Output is correct |
6 |
Correct |
2 ms |
532 KB |
Output is correct |
7 |
Correct |
2 ms |
532 KB |
Output is correct |
8 |
Correct |
2 ms |
620 KB |
Output is correct |
9 |
Incorrect |
24 ms |
1400 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |