oj.uz

답안 #852354

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852354 2023-09-21T16:21:28 Z vjudge1 Chessboard (IZhO18_chessboard) C++17
70 / 100
 289 ms 3476 KB 
#include <bits/stdc++.h>
using namespace std;

int32_t main() {
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        int n, k;
        cin >> n >> k;
        vector<int> a(k), b(k), aa(k), bb(k);
        for (int i = 0; i < k; i++) {
                cin >> a[i] >> b[i] >> aa[i] >> bb[i];
                a[i]--, b[i]--, aa[i]--, bb[i]--;
        }

        int64_t res = 1ll * n * n;
        vector<int64_t> cntb(2, 0);
        vector<int64_t> need(2, 0);
        for (int i = 1; i < n; i++) {
                if (n % i) continue;

                vector<int64_t> cntb(2, 0);
                vector<int64_t> need(2, 0);

                need[0] = 1ll * (n / i) * (n / i);
                need[1] = need[0] / 2;
                need[0] -= need[1];
                need[0] *= 1ll * i * i;
                need[1] *= 1ll * i * i;

                auto add_same = [&](int id, int u, int v, int length) {
                        if (u > v) return;
                        int x = i - u % i;
                        int uu = u / i, vv = v / i;
                        assert(uu < vv);
                        cntb[(uu ^ id) & 1] += 1ll * length * x;
                        int y = v % i + 1;
                        cntb[(vv ^ id) & 1] += 1ll * length * y;
                        uu++, vv--;
                        if (uu <= vv) {
                                int64_t addu = 1ll * length * ((vv - uu + 1) / 2 + (((uu ^ vv) & 1) == 0)) * i;
                                cntb[(uu ^ vv) & 1] += addu;
                                cntb[(uu ^ vv) & 1 ^ 1] += 1ll * (vv - uu + 1) * length * i - addu;
                        }
                };

                auto add = [&](int x, int y, int u, int v) {
                        int up = x / i;
                        int dn = u / i;
                        int lt = y / i;
                        int rt = v / i;
                        if (up == dn) {
                                if (lt == rt) {
                                        cntb[(up ^ lt) & 1] += 1ll * (u - x + 1) * (v - y + 1);
                                } else {
                                        add_same(up, y, v, u - x + 1);
                                }
                        } else {
                                if (lt == rt) {
                                        add_same(lt, x, u, y - v + 1);
                                } else {
                                        add_same(up, y, v, i - x % i);
                                        add_same(dn, y, v, y % i + 1);
                                        add_same(lt, x + (i - x % i), y - (y % i + 1), i - u % i);
                                        add_same(rt, x + (i - x % i), y - (y % i + 1), v % i + 1);
                                        up++, dn--, lt++, rt--;
                                        int64_t p = 1ll * (up - dn + 1) * (rt - lt + 1);
                                        int64_t q = p / 2;
                                        p -= q;
                                        cntb[(up ^ lt) & 1] += 1ll * p * i * i;
                                        cntb[(up + lt) & 1 & 1] += 1ll * q * i * i;
                                }
                        }
                };

                for (int j = 0; j < k; j++) add(a[j], b[j], aa[j], bb[j]);

                /// (0, 0) white
                res = min(res, cntb[0] + need[1] - cntb[1]);
                res = min(res, need[0] - cntb[0] + cntb[1]);
        }

        cout << res;
}

Compilation message

chessboard.cpp: In lambda function:
chessboard.cpp:42:48: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   42 |                                 cntb[(uu ^ vv) & 1 ^ 1] += 1ll * (vv - uu + 1) * length * i - addu;
      |                                      ~~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1464 KB Output is correct
2 Correct 5 ms 604 KB Output is correct
3 Correct 10 ms 1096 KB Output is correct
4 Correct 11 ms 1368 KB Output is correct
5 Correct 14 ms 1332 KB Output is correct
6 Correct 10 ms 860 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 9 ms 856 KB Output is correct
9 Correct 25 ms 1880 KB Output is correct
10 Correct 14 ms 1116 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 7 ms 1112 KB Output is correct
17 Correct 18 ms 1628 KB Output is correct
18 Correct 25 ms 2020 KB Output is correct
19 Correct 63 ms 1628 KB Output is correct
20 Correct 69 ms 1884 KB Output is correct
21 Correct 17 ms 1624 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 16 ms 1140 KB Output is correct
24 Correct 23 ms 1880 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 15 ms 1356 KB Output is correct
27 Correct 20 ms 1540 KB Output is correct
28 Correct 24 ms 1884 KB Output is correct
29 Correct 7 ms 856 KB Output is correct
30 Correct 1 ms 348 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1464 KB Output is correct
2 Correct 5 ms 604 KB Output is correct
3 Correct 10 ms 1096 KB Output is correct
4 Correct 11 ms 1368 KB Output is correct
5 Correct 14 ms 1332 KB Output is correct
6 Correct 10 ms 860 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 9 ms 856 KB Output is correct
9 Correct 25 ms 1880 KB Output is correct
10 Correct 14 ms 1116 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 7 ms 1112 KB Output is correct
27 Correct 18 ms 1628 KB Output is correct
28 Correct 25 ms 2020 KB Output is correct
29 Correct 63 ms 1628 KB Output is correct
30 Correct 69 ms 1884 KB Output is correct
31 Correct 17 ms 1624 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 16 ms 1140 KB Output is correct
34 Correct 23 ms 1880 KB Output is correct
35 Correct 3 ms 348 KB Output is correct
36 Correct 15 ms 1356 KB Output is correct
37 Correct 20 ms 1540 KB Output is correct
38 Correct 24 ms 1884 KB Output is correct
39 Correct 7 ms 856 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 63 ms 1628 KB Output is correct
42 Correct 28 ms 1884 KB Output is correct
43 Correct 41 ms 1756 KB Output is correct
44 Correct 27 ms 1884 KB Output is correct
45 Correct 25 ms 1880 KB Output is correct
46 Correct 67 ms 1900 KB Output is correct
47 Correct 23 ms 1824 KB Output is correct
48 Correct 33 ms 1624 KB Output is correct
49 Correct 29 ms 1880 KB Output is correct
50 Correct 264 ms 2136 KB Output is correct
51 Correct 284 ms 1960 KB Output is correct
52 Correct 262 ms 1628 KB Output is correct
53 Correct 278 ms 1880 KB Output is correct
54 Correct 263 ms 1832 KB Output is correct
55 Correct 289 ms 1884 KB Output is correct
56 Correct 254 ms 1808 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 17 ms 1464 KB Output is correct
10 Correct 5 ms 604 KB Output is correct
11 Correct 10 ms 1096 KB Output is correct
12 Correct 11 ms 1368 KB Output is correct
13 Correct 14 ms 1332 KB Output is correct
14 Correct 10 ms 860 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 9 ms 856 KB Output is correct
17 Correct 25 ms 1880 KB Output is correct
18 Correct 14 ms 1116 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 7 ms 1112 KB Output is correct
35 Correct 18 ms 1628 KB Output is correct
36 Correct 25 ms 2020 KB Output is correct
37 Correct 63 ms 1628 KB Output is correct
38 Correct 69 ms 1884 KB Output is correct
39 Correct 17 ms 1624 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 16 ms 1140 KB Output is correct
42 Correct 23 ms 1880 KB Output is correct
43 Correct 3 ms 348 KB Output is correct
44 Correct 15 ms 1356 KB Output is correct
45 Correct 20 ms 1540 KB Output is correct
46 Correct 24 ms 1884 KB Output is correct
47 Correct 7 ms 856 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 63 ms 1628 KB Output is correct
50 Correct 28 ms 1884 KB Output is correct
51 Correct 41 ms 1756 KB Output is correct
52 Correct 27 ms 1884 KB Output is correct
53 Correct 25 ms 1880 KB Output is correct
54 Correct 67 ms 1900 KB Output is correct
55 Correct 23 ms 1824 KB Output is correct
56 Correct 33 ms 1624 KB Output is correct
57 Correct 29 ms 1880 KB Output is correct
58 Correct 264 ms 2136 KB Output is correct
59 Correct 284 ms 1960 KB Output is correct
60 Correct 262 ms 1628 KB Output is correct
61 Correct 278 ms 1880 KB Output is correct
62 Correct 263 ms 1832 KB Output is correct
63 Correct 289 ms 1884 KB Output is correct
64 Correct 254 ms 1808 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Runtime error 37 ms 3476 KB Execution killed with signal 6
68 Halted 0 ms 0 KB -