Submission #911125

#	Time	Username	Problem	Language	Result	Execution time	Memory
911125		GrindMachine	Chessboard (IZhO18_chessboard)	C++17	100 / 100	150 ms	6620 KiB

chessboard

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    vector<array<ll,4>> a(m);
    rep(i,m) rep(j,4) cin >> a[i][j], a[i][j]--;

    vector<ll> p(n+5);
    ll ans = inf2;

    rep1(k,n-1){
        if(n%k) conts;

        rep1(i,n){
            p[i] = p[i-1];
            if(((i-1)/k)&1){
                p[i]++;
            }
        }

        ll curr_ans = 0;

        rep(i,m){
            auto [x1,y1,x2,y2] = a[i];

            ll row_odd = p[x2+1]-p[x1];
            ll row_even = x2-x1+1-row_odd;
            ll col_odd = p[y2+1]-p[y1];
            ll col_even = y2-y1+1-col_odd;

            curr_ans -= (row_odd*col_even)+(row_even*col_odd);
            curr_ans += (row_odd*col_odd)+(row_even*col_even);
        }

        ll cnt = n/k;
        ll black = ceil2(cnt,2)*(cnt/2)*2*k*k;
        curr_ans += black;

        curr_ans = min(curr_ans,n*n-curr_ans);
        amin(ans,curr_ans);
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 15 / 15
• Subtask 4: 16 / 16
• Subtask 5: 23 / 23
• Subtask 6: 30 / 30