#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#define sz(a) (int)a.size()
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mpp make_pair
const ld PI = 3.14159265359, prec = 1e-9;;
//using u128 = __uint128_t;
//const int x[4] = {1, 0, -1, 0};
//const int y[4] = {0, -1, 0, 1};
const ll mod = 1e9 + 7, pr = 31;
const int mxn = 5e5 + 5, mxq = 1e5 + 5, sq = 450, mxv = 5e4 + 1;
//const int base = (1 <<18);
const ll inf = 1e18 + 5, neg = -69420, inf2 = 1e14;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// have fun!
ll n, k;
ll ans = inf;
ll x[mxn + 1], y[mxn + 1], x2[mxn + 1], y2[mxn + 1];
ll cntodd(ll l, ll r){
return((r + 1) / 2 - l / 2);
}
ll cnteven(ll l, ll r){
return((r + 2) / 2 - (l + 1) / 2);
}
pll get(ll l, ll r, ll k){
ll lw = (l + k - 1) / k, hg = (r - k + 1) / k;
ll odd = 0, even = 0;
if(r < k || lw == hg + 2){
if((r / k) & 1)odd += r - l + 1;
else even += r - l + 1;
return(mpp(odd, even));
}
odd += cntodd(lw, hg) * k; even += cnteven(lw, hg) * k;
if(l % k != 0){
if((l / k) & 1){
odd += (k - (l % k));
}else{
even += (k - (l % k));
}
}if(r % k != k - 1){
if((r / k) & 1){
odd += (r % k) + 1;
}else{
even += (r % k) + 1;
}
}
return(mpp(odd, even));
}
ll area = 0;
void solve(int cand){
ll odd = 0, even = 0;
for(int i = 1; i <= k; i++){
pll col = get(y[i], y2[i], cand), row = get(x[i], x2[i], cand);
//cout << col.fi << " " << col.se << " " << row.fi << " " << row.se << "\n";
odd += col.fi * row.se + col.se * row.fi; even += col.fi * row.fi + col.se * row.se;
}
ll totodd = 0, toteven = 0;
if((n / cand) & 1){
toteven = (n * n / (cand * cand) + 1) / 2 * cand * cand;
totodd = (n * n / (cand * cand)) / 2 * cand * cand;
}else{
toteven = (n * n / (cand * cand)) / 2 * cand * cand;
totodd = (n * n / (cand * cand)) / 2 * cand * cand;
}
assert(even + odd == area);
//cout << cand << " " << even << " " << odd << "\n";
ans = min(ans, min(abs(toteven - even) + area - even, abs(totodd - odd) + area - odd));
}
void solve(){
cin >> n >> k;'
assert(max(n, k) <= 100000);
for(int i = 1; i <= k; i++){
cin >> x[i] >> y[i] >> x2[i] >> y2[i]; --x[i]; --y[i]; --x2[i]; --y2[i];
area += (y2[i] - y[i] + 1) * (x2[i] - x[i] + 1);
}
for(int i = 1; i < n; i++){
if(n % i == 0){
solve(i);
}
}
cout << ans;
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen("netw.inp", "r", stdin);
//freopen("netw.out", "w", stdout)
int tt; tt = 1;
while(tt--){
solve();
}
return(0);
}
Compilation message
chessboard.cpp:88:19: warning: missing terminating ' character
88 | cin >> n >> k;'
| ^
chessboard.cpp:88:19: error: missing terminating ' character
