oj.uz

Submission #683130

# Submission time Handle Problem Language Result Execution time Memory
683130 2023-01-17T19:11:22 Z phoenix Chessboard (IZhO18_chessboard) C++17
100 / 100
 1839 ms 4060 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

struct point {
    ll x, y;
};

// returns number of black ceils on chess board a x b, f - color of first ceil (0 - white, 1 - black)
ll black_nums(ll a, ll b, bool f) {
    if(a < 0 || b < 0) return 0;
    if(f) return ((a + 1) >> 1) * ((b + 1) >> 1) + (a >> 1) * (b >> 1); 
    return (a >> 1) * ((b + 1) >> 1) + ((a + 1) >> 1) * (b >> 1);
}   
ll func(point p1, point p2, ll d, bool cl) {
    ll x1 = p1.x, x2 = p2.x, y1 = p1.y, y2 = p2.y;
    ll dx1 = ((d - p1.x % d) % d);
    ll dy1 = ((d - p1.y % d) % d);
    ll dx2 = ((p2.x + 1) % d);
    ll dy2 = ((p2.y + 1) % d);
    // cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << '\n';
    if((dx1 || dx2) && p1.x / d == p2.x / d) dx1 = p2.x - p1.x + 1, dx2 = 0; 
    x1 += dx1; x2 -= dx2;
    if((dx1 || dx2) && p1.y / d == p2.y / d) dy1 = p2.y - p1.y + 1, dy2 = 0; 
    y1 += dy1; y2 -= dy2;
    ll cx1 = x1 / d, cy1 = y1 / d, cp1y = p1.y / d, cp1x = p1.x / d, cp2x = p2.x / d, cp2y = p2.y / d;
    ll cnt = 0;
    cnt += black_nums((x2 - x1 + 1) / d, (y2 - y1 + 1) / d, (cl ^ ((cx1 + cy1) % 2))) * d * d;
    cnt += black_nums((x2 - x1 + 1) / d, 1, (cl ^ ((cx1 + cp1y) % 2))) * dy1 * d;
    cnt += black_nums((x2 - x1 + 1) / d, 1, (cl ^ ((cx1 + cp2y) % 2))) * dy2 * d;
    cnt += black_nums(1, (y2 - y1 + 1) / d, (cl ^ ((cp1x + cy1) % 2))) * dx1 * d;
    cnt += black_nums(1, (y2 - y1 + 1) / d, (cl ^ ((cp2x + cy1) % 2))) * dx2 * d;
    cnt += (cl ^ ((cp1x + cp1y) % 2)) * dx1 * dy1;
    if(p2.x > p1.x) cnt += (cl ^ ((cp2x + cp1y) % 2)) * dx2 * dy1;
    if(p2.y > p1.y) cnt += (cl ^ ((cp1x + cp2y) % 2)) * dx1 * dy2;
    if(p2.x > p1.x && p2.y > p1.y) cnt += (cl ^ ((cp2x + cp2y) % 2)) * dx2 * dy2;
    return cnt;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    ll n, k;
    cin >> n >> k;
    vector<pair<point, point>> v;
    point v1[k], v2[k];
    for(int i = 0; i < k; i++) {
        point p1, p2;
        cin >> p1.x >> p1.y;
        p1.x--; p1.y--;
        cin >> p2.x >> p2.y;
        p2.x--; p2.y--;
        v1[i] = p1; v2[i] = p2;
    }
    ll ans = n * n;
    for(ll D = 1; D * D <= n; D++) {
        if(n % D) continue;
        ll d = D;
        ll val1 = 0, val2 = 0;
        val1 = black_nums(n / d, n / d, 1) * d * d;
        val2 = black_nums(n / d, n / d, 0) * d * d;
        for(int i = 0; i < k; i++) {
            val1 += (v2[i].x - v1[i].x + 1) * (v2[i].y - v1[i].y + 1) - 2 * func(v1[i], v2[i], d, 1);
            val2 += (v2[i].x - v1[i].x + 1) * (v2[i].y - v1[i].y + 1) - 2 * func(v1[i], v2[i], d, 0);
        }
        ans = min(ans, val1);
        ans = min(ans, val2);
        if(D == 1) continue;
        d = n / D;
        val1 = black_nums(n / d, n / d, 1) * d * d;
        val2 = black_nums(n / d, n / d, 0) * d * d;
        for(int i = 0; i < k; i++) {
            val1 += (v2[i].x - v1[i].x + 1) * (v2[i].y - v1[i].y + 1) - 2 * func(v1[i], v2[i], d, 1);
            val2 += (v2[i].x - v1[i].x + 1) * (v2[i].y - v1[i].y + 1) - 2 * func(v1[i], v2[i], d, 0);
        }
        ans = min(ans, val1);
        ans = min(ans, val2);
    }
    cout << ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2816 KB Output is correct
2 Correct 7 ms 1108 KB Output is correct
3 Correct 18 ms 2084 KB Output is correct
4 Correct 21 ms 2312 KB Output is correct
5 Correct 24 ms 2508 KB Output is correct
6 Correct 17 ms 1932 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 16 ms 1944 KB Output is correct
9 Correct 39 ms 3656 KB Output is correct
10 Correct 26 ms 2380 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 18 ms 1492 KB Output is correct
17 Correct 34 ms 3444 KB Output is correct
18 Correct 62 ms 3996 KB Output is correct
19 Correct 320 ms 3628 KB Output is correct
20 Correct 357 ms 3988 KB Output is correct
21 Correct 35 ms 3396 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 51 ms 2068 KB Output is correct
24 Correct 59 ms 3616 KB Output is correct
25 Correct 13 ms 596 KB Output is correct
26 Correct 41 ms 2552 KB Output is correct
27 Correct 65 ms 2980 KB Output is correct
28 Correct 61 ms 4004 KB Output is correct
29 Correct 16 ms 1684 KB Output is correct
30 Correct 3 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2816 KB Output is correct
2 Correct 7 ms 1108 KB Output is correct
3 Correct 18 ms 2084 KB Output is correct
4 Correct 21 ms 2312 KB Output is correct
5 Correct 24 ms 2508 KB Output is correct
6 Correct 17 ms 1932 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 16 ms 1944 KB Output is correct
9 Correct 39 ms 3656 KB Output is correct
10 Correct 26 ms 2380 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 18 ms 1492 KB Output is correct
27 Correct 34 ms 3444 KB Output is correct
28 Correct 62 ms 3996 KB Output is correct
29 Correct 320 ms 3628 KB Output is correct
30 Correct 357 ms 3988 KB Output is correct
31 Correct 35 ms 3396 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 51 ms 2068 KB Output is correct
34 Correct 59 ms 3616 KB Output is correct
35 Correct 13 ms 596 KB Output is correct
36 Correct 41 ms 2552 KB Output is correct
37 Correct 65 ms 2980 KB Output is correct
38 Correct 61 ms 4004 KB Output is correct
39 Correct 16 ms 1684 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 286 ms 3532 KB Output is correct
42 Correct 66 ms 3784 KB Output is correct
43 Correct 151 ms 3516 KB Output is correct
44 Correct 63 ms 3792 KB Output is correct
45 Correct 47 ms 4004 KB Output is correct
46 Correct 328 ms 3776 KB Output is correct
47 Correct 37 ms 3624 KB Output is correct
48 Correct 109 ms 3672 KB Output is correct
49 Correct 59 ms 3532 KB Output is correct
50 Correct 1546 ms 3784 KB Output is correct
51 Correct 1654 ms 3976 KB Output is correct
52 Correct 1555 ms 3764 KB Output is correct
53 Correct 1638 ms 3860 KB Output is correct
54 Correct 1545 ms 3720 KB Output is correct
55 Correct 1700 ms 4060 KB Output is correct
56 Correct 1470 ms 3640 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 27 ms 2816 KB Output is correct
10 Correct 7 ms 1108 KB Output is correct
11 Correct 18 ms 2084 KB Output is correct
12 Correct 21 ms 2312 KB Output is correct
13 Correct 24 ms 2508 KB Output is correct
14 Correct 17 ms 1932 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 16 ms 1944 KB Output is correct
17 Correct 39 ms 3656 KB Output is correct
18 Correct 26 ms 2380 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 18 ms 1492 KB Output is correct
35 Correct 34 ms 3444 KB Output is correct
36 Correct 62 ms 3996 KB Output is correct
37 Correct 320 ms 3628 KB Output is correct
38 Correct 357 ms 3988 KB Output is correct
39 Correct 35 ms 3396 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 51 ms 2068 KB Output is correct
42 Correct 59 ms 3616 KB Output is correct
43 Correct 13 ms 596 KB Output is correct
44 Correct 41 ms 2552 KB Output is correct
45 Correct 65 ms 2980 KB Output is correct
46 Correct 61 ms 4004 KB Output is correct
47 Correct 16 ms 1684 KB Output is correct
48 Correct 3 ms 340 KB Output is correct
49 Correct 286 ms 3532 KB Output is correct
50 Correct 66 ms 3784 KB Output is correct
51 Correct 151 ms 3516 KB Output is correct
52 Correct 63 ms 3792 KB Output is correct
53 Correct 47 ms 4004 KB Output is correct
54 Correct 328 ms 3776 KB Output is correct
55 Correct 37 ms 3624 KB Output is correct
56 Correct 109 ms 3672 KB Output is correct
57 Correct 59 ms 3532 KB Output is correct
58 Correct 1546 ms 3784 KB Output is correct
59 Correct 1654 ms 3976 KB Output is correct
60 Correct 1555 ms 3764 KB Output is correct
61 Correct 1638 ms 3860 KB Output is correct
62 Correct 1545 ms 3720 KB Output is correct
63 Correct 1700 ms 4060 KB Output is correct
64 Correct 1470 ms 3640 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 1728 ms 3436 KB Output is correct
68 Correct 1710 ms 3424 KB Output is correct
69 Correct 1508 ms 3040 KB Output is correct
70 Correct 1674 ms 3404 KB Output is correct
71 Correct 1647 ms 3284 KB Output is correct
72 Correct 1624 ms 3276 KB Output is correct
73 Correct 1579 ms 3176 KB Output is correct
74 Correct 1685 ms 3420 KB Output is correct
75 Correct 1661 ms 3252 KB Output is correct
76 Correct 1755 ms 3448 KB Output is correct
77 Correct 238 ms 3540 KB Output is correct
78 Correct 65 ms 3360 KB Output is correct
79 Correct 161 ms 3156 KB Output is correct
80 Correct 164 ms 3284 KB Output is correct
81 Correct 152 ms 3064 KB Output is correct
82 Correct 122 ms 3492 KB Output is correct
83 Correct 86 ms 3188 KB Output is correct
84 Correct 1000 ms 3540 KB Output is correct
85 Correct 1804 ms 3628 KB Output is correct
86 Correct 2 ms 212 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1839 ms 3540 KB Output is correct
89 Correct 345 ms 1088 KB Output is correct
90 Correct 1 ms 212 KB Output is correct