제출 #495275

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
495275		kingline	Chessboard (IZhO18_chessboard)	C++17	16 / 100	90 ms	1692 KiB

chessboard

#include <bits/stdc++.h>
#define pb push_back
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(data) data.begin() , data.end()
#define endl '\n'
//freopen("nenokku_easy.in", "r", stdin);
//freopen("nenokku_easy.out", "w", stdout);
#define int long long

using namespace std;

typedef long long ll;
const int N = 1e5 + 5;

int n, k, y[N], x[N], pref[1005][1005];

main() {
    /*ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);*/
    cin >> n >> k;
    bool pr = 1;
    for(int i = 2; i <= sqrt(n); i++) {
        if(n % i == 0) pr = 0;
    }
    if(pr) {
        int even = 0, odd = 0;
        for(int i = 1; i <= k; i++) {
            int xx, yy;
            cin >> x[i] >> y[i] >> xx >> yy;
            if(xx % 2 == yy % 2) ++odd;
            else even++;
        }
        int ev = (n * n + 1) / 2, od = (n * n) / 2;
        cout << min(ev - odd + even, od - even + odd);
    } else {
        for(int kk = 1; kk <= k; kk++) {
            int x, y, xx, yy;
            cin >> x >> y >> xx >> yy;
            for(int i = x; i <= xx; i++) {
                for(int j = y; j <= yy; j++) {
                    pref[i][j]++;
                }
            }
        }
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                pref[i][j] += pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1];
            }
        }
        int ans = n * n * n;
        for(int z = 1; z <= (n >> 1); z++) {
            if(n % z == 0) {
                bool type = 1;
                int res1 = 0, res2 = 0;
                for(int i = z; i <= n; i += z) {
                    for(int j = z; j <= n; j += z) {
                        if(type) {
                            res1 += pref[i][j] - pref[i][j - z] - pref[i - z][j] + pref[i - z][j - z];
                            res2 += z * z - (pref[i][j] - pref[i][j - z] - pref[i - z][j] + pref[i - z][j - z]);
                        } else {
                            res1 += z * z - (pref[i][j] - pref[i][j - z] - pref[i - z][j] + pref[i - z][j - z]);
                            res2 += pref[i][j] - pref[i][j - z] - pref[i - z][j] + pref[i - z][j - z];
                        }
                        type = 1 - type;
                    }
                }
                ans = min(ans, min(res1, res2));
            }
        }
        cout << ans;
    }
}

/*
5
2 8 5 1 10
5
2 3 5 3
2 5 3 3
1 4 4
2 3 4 2
1 1 2
*/

컴파일 시 표준 에러 (stderr) 메시지

chessboard.cpp:17:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   17 | main() {
      | ^~~~

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