oj.uz

Submission #683128

# Submission time Handle Problem Language Result Execution time Memory
683128 2023-01-17T19:09:54 Z phoenix Chessboard (IZhO18_chessboard) C++17
100 / 100
 1876 ms 5804 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;
    // cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << '\n';
    // cout << dx1 << ' ' << dy1 << ' ' << dx2 << ' ' << dy2 << '\n';
    ll cnt = 0;
    cnt += black_nums((x2 - x1 + 1) / d, (y2 - y1 + 1) / d, (cl ^ ((x1 / d + y1 / d) % 2))) * d * d;
    cnt += black_nums((x2 - x1 + 1) / d, 1, (cl ^ ((x1 / d + p1.y / d) % 2))) * dy1 * d;
    cnt += black_nums((x2 - x1 + 1) / d, 1, (cl ^ ((x1 / d + p2.y / d) % 2))) * dy2 * d;
    cnt += black_nums(1, (y2 - y1 + 1) / d, (cl ^ ((p1.x / d + y1 / d) % 2))) * dx1 * d;
    cnt += black_nums(1, (y2 - y1 + 1) / d, (cl ^ ((p2.x / d + y1 / d) % 2))) * dx2 * d;
    cnt += (cl ^ ((p1.x / d + p1.y / d) % 2)) * dx1 * dy1;
    if(p2.x > p1.x) cnt += (cl ^ ((p2.x / d + p1.y / d) % 2)) * dx2 * dy1;
    if(p2.y > p1.y) cnt += (cl ^ ((p1.x / d + p2.y / d) % 2)) * dx1 * dy2;
    if(p2.x > p1.x && p2.y > p1.y) cnt += (cl ^ ((p2.x / d + p2.y / d) % 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 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 26 ms 2260 KB Output is correct
2 Correct 7 ms 1076 KB Output is correct
3 Correct 18 ms 1876 KB Output is correct
4 Correct 22 ms 2284 KB Output is correct
5 Correct 24 ms 2388 KB Output is correct
6 Correct 16 ms 1704 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 17 ms 1780 KB Output is correct
9 Correct 42 ms 3660 KB Output is correct
10 Correct 24 ms 2188 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 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 19 ms 1364 KB Output is correct
17 Correct 31 ms 3276 KB Output is correct
18 Correct 64 ms 3708 KB Output is correct
19 Correct 330 ms 3496 KB Output is correct
20 Correct 390 ms 3820 KB Output is correct
21 Correct 32 ms 3232 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 49 ms 2040 KB Output is correct
24 Correct 57 ms 3524 KB Output is correct
25 Correct 11 ms 596 KB Output is correct
26 Correct 38 ms 2500 KB Output is correct
27 Correct 74 ms 2852 KB Output is correct
28 Correct 62 ms 3660 KB Output is correct
29 Correct 13 ms 1744 KB Output is correct
30 Correct 2 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 2260 KB Output is correct
2 Correct 7 ms 1076 KB Output is correct
3 Correct 18 ms 1876 KB Output is correct
4 Correct 22 ms 2284 KB Output is correct
5 Correct 24 ms 2388 KB Output is correct
6 Correct 16 ms 1704 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 17 ms 1780 KB Output is correct
9 Correct 42 ms 3660 KB Output is correct
10 Correct 24 ms 2188 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 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 19 ms 1364 KB Output is correct
27 Correct 31 ms 3276 KB Output is correct
28 Correct 64 ms 3708 KB Output is correct
29 Correct 330 ms 3496 KB Output is correct
30 Correct 390 ms 3820 KB Output is correct
31 Correct 32 ms 3232 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 49 ms 2040 KB Output is correct
34 Correct 57 ms 3524 KB Output is correct
35 Correct 11 ms 596 KB Output is correct
36 Correct 38 ms 2500 KB Output is correct
37 Correct 74 ms 2852 KB Output is correct
38 Correct 62 ms 3660 KB Output is correct
39 Correct 13 ms 1744 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 319 ms 3412 KB Output is correct
42 Correct 71 ms 3668 KB Output is correct
43 Correct 158 ms 3336 KB Output is correct
44 Correct 65 ms 3584 KB Output is correct
45 Correct 44 ms 3756 KB Output is correct
46 Correct 343 ms 3668 KB Output is correct
47 Correct 38 ms 3404 KB Output is correct
48 Correct 108 ms 3344 KB Output is correct
49 Correct 78 ms 3356 KB Output is correct
50 Correct 1588 ms 3564 KB Output is correct
51 Correct 1704 ms 3788 KB Output is correct
52 Correct 1621 ms 3548 KB Output is correct
53 Correct 1672 ms 3732 KB Output is correct
54 Correct 1547 ms 3512 KB Output is correct
55 Correct 1731 ms 3856 KB Output is correct
56 Correct 1517 ms 3428 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 26 ms 2260 KB Output is correct
10 Correct 7 ms 1076 KB Output is correct
11 Correct 18 ms 1876 KB Output is correct
12 Correct 22 ms 2284 KB Output is correct
13 Correct 24 ms 2388 KB Output is correct
14 Correct 16 ms 1704 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 17 ms 1780 KB Output is correct
17 Correct 42 ms 3660 KB Output is correct
18 Correct 24 ms 2188 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 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 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 19 ms 1364 KB Output is correct
35 Correct 31 ms 3276 KB Output is correct
36 Correct 64 ms 3708 KB Output is correct
37 Correct 330 ms 3496 KB Output is correct
38 Correct 390 ms 3820 KB Output is correct
39 Correct 32 ms 3232 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 49 ms 2040 KB Output is correct
42 Correct 57 ms 3524 KB Output is correct
43 Correct 11 ms 596 KB Output is correct
44 Correct 38 ms 2500 KB Output is correct
45 Correct 74 ms 2852 KB Output is correct
46 Correct 62 ms 3660 KB Output is correct
47 Correct 13 ms 1744 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 319 ms 3412 KB Output is correct
50 Correct 71 ms 3668 KB Output is correct
51 Correct 158 ms 3336 KB Output is correct
52 Correct 65 ms 3584 KB Output is correct
53 Correct 44 ms 3756 KB Output is correct
54 Correct 343 ms 3668 KB Output is correct
55 Correct 38 ms 3404 KB Output is correct
56 Correct 108 ms 3344 KB Output is correct
57 Correct 78 ms 3356 KB Output is correct
58 Correct 1588 ms 3564 KB Output is correct
59 Correct 1704 ms 3788 KB Output is correct
60 Correct 1621 ms 3548 KB Output is correct
61 Correct 1672 ms 3732 KB Output is correct
62 Correct 1547 ms 3512 KB Output is correct
63 Correct 1731 ms 3856 KB Output is correct
64 Correct 1517 ms 3428 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 1761 ms 5452 KB Output is correct
68 Correct 1756 ms 5436 KB Output is correct
69 Correct 1544 ms 4780 KB Output is correct
70 Correct 1696 ms 5264 KB Output is correct
71 Correct 1656 ms 5324 KB Output is correct
72 Correct 1654 ms 5108 KB Output is correct
73 Correct 1637 ms 4980 KB Output is correct
74 Correct 1785 ms 5492 KB Output is correct
75 Correct 1701 ms 5192 KB Output is correct
76 Correct 1764 ms 5580 KB Output is correct
77 Correct 246 ms 5740 KB Output is correct
78 Correct 68 ms 5212 KB Output is correct
79 Correct 170 ms 4964 KB Output is correct
80 Correct 171 ms 5100 KB Output is correct
81 Correct 165 ms 4816 KB Output is correct
82 Correct 121 ms 5464 KB Output is correct
83 Correct 90 ms 5068 KB Output is correct
84 Correct 1014 ms 5616 KB Output is correct
85 Correct 1876 ms 5712 KB Output is correct
86 Correct 2 ms 212 KB Output is correct
87 Correct 0 ms 320 KB Output is correct
88 Correct 1870 ms 5804 KB Output is correct
89 Correct 367 ms 1328 KB Output is correct
90 Correct 1 ms 212 KB Output is correct