제출 #448745

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
448745		dxz05	Chessboard (IZhO18_chessboard)	C++14	70 / 100	372 ms	3408 KiB

chessboard

#pragma GCC optimize("Ofast,O2,O3")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define revall(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 2e6 + 3e2;
const int M = 5222;

#define x first
#define y second

void solve(int TC) {
    int n, k;
    cin >> n >> k;

    vector<pair<int, int>> points(k);
    for (auto &p : points){
        cin >> p.x >> p.y >> p.x >> p.y;
    }

    vector<int> divisors;
    for (int d = 1; d < n; d++){
        if (n % d == 0) divisors.push_back(d);
    }

    ll ans = 1ll * n * n;

    for (int d : divisors){ /// (1, 1) = black
        ll cost = (1ll * (n / d) * (n / d) + 1) / 2 * d * d;
        for (auto p : points){
            int i = (p.x + d - 1) / d, j = (p.y + d - 1) / d;

            if ((i + j) % 2 == 0) cost--; else
                cost++;

            debug(d, i, j);
        }

        ans = min(ans, cost);
        debug(d, cost);
    }

    for (int d : divisors){ /// (1, 1) = black
        ll cost = 1ll * (n / d) * (n / d) / 2 * d * d;
        for (auto p : points){
            int i = (p.x + d - 1) / d, j = (p.y + d - 1) / d;

            if ((i + j) % 2 == 1) cost--; else
                cost++;

            debug(d, i, j);
        }

        ans = min(ans, cost);
        debug(d, cost);
    }

    cout << ans;

}

int main() {
    startTime = clock();
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    bool llololcal = false;
#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    llololcal = true;
#endif

    int TC = 1;
    //cin >> TC;

    for (int test = 1; test <= TC; test++) {
        debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    if (llololcal) cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

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

chessboard.cpp: In function 'void solve(int)':
chessboard.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
chessboard.cpp:70:13: note: in expansion of macro 'debug'
   70 |             debug(d, i, j);
      |             ^~~~~
chessboard.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
chessboard.cpp:74:9: note: in expansion of macro 'debug'
   74 |         debug(d, cost);
      |         ^~~~~
chessboard.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
chessboard.cpp:85:13: note: in expansion of macro 'debug'
   85 |             debug(d, i, j);
      |             ^~~~~
chessboard.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
chessboard.cpp:89:9: note: in expansion of macro 'debug'
   89 |         debug(d, cost);
      |         ^~~~~
chessboard.cpp: In function 'int main()':
chessboard.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
chessboard.cpp:113:9: note: in expansion of macro 'debug'
  113 |         debug(test);
      |         ^~~~~

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