oj.uz

답안 #683132

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
683132 2023-01-17T19:26:09 Z phoenix Chessboard (IZhO18_chessboard) C++17
100 / 100
 1795 ms 3420 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 cp1y = p1.y / d, cp1x = p1.x / d, cp2x = p2.x / d, cp2y = p2.y / d;
    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);
    if((dx1 || dx2) && cp1x == cp2x) dx1 = p2.x - p1.x + 1, dx2 = 0; 
    x1 += dx1; x2 -= dx2;
    if((dx1 || dx2) && cp1y == cp2y) dy1 = p2.y - p1.y + 1, dy2 = 0; 
    y1 += dy1; y2 -= dy2;
    ll cx1 = x1 / d, cy1 = y1 / d;
    ll cnt = 0;
    cnt += black_nums((x2 - x1 + 1) / d, (y2 - y1 + 1) / d, (cl ^ ((cx1 + cy1) & 1))) * d * d;
    cnt += black_nums((x2 - x1 + 1) / d, 1, (cl ^ ((cx1 + cp1y) & 1))) * dy1 * d;
    cnt += black_nums((x2 - x1 + 1) / d, 1, (cl ^ ((cx1 + cp2y) & 1))) * dy2 * d;
    cnt += black_nums(1, (y2 - y1 + 1) / d, (cl ^ ((cp1x + cy1) & 1))) * dx1 * d;
    cnt += black_nums(1, (y2 - y1 + 1) / d, (cl ^ ((cp2x + cy1) & 1))) * dx2 * d;
    cnt += (cl ^ ((cp1x + cp1y) & 1)) * dx1 * dy1;
    if(p2.x > p1.x) cnt += (cl ^ ((cp2x + cp1y) & 1)) * dx2 * dy1;
    if(p2.y > p1.y) cnt += (cl ^ ((cp1x + cp2y) & 1)) * dx1 * dy2;
    if(p2.x > p1.x && p2.y > p1.y) cnt += (cl ^ ((cp2x + cp2y) & 1)) * dx2 * dy2;
    return cnt;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    ll n, k;
    cin >> n >> k;
    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 < 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 2260 KB Output is correct
2 Correct 9 ms 724 KB Output is correct
3 Correct 17 ms 1552 KB Output is correct
4 Correct 18 ms 1752 KB Output is correct
5 Correct 25 ms 2020 KB Output is correct
6 Correct 14 ms 1404 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 20 ms 1408 KB Output is correct
9 Correct 39 ms 3028 KB Output is correct
10 Correct 23 ms 1876 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 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 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 0 ms 212 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 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

# 결과 실행 시간 메모리 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 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 0 ms 212 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 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 17 ms 1108 KB Output is correct
17 Correct 35 ms 2900 KB Output is correct
18 Correct 65 ms 3392 KB Output is correct
19 Correct 318 ms 3056 KB Output is correct
20 Correct 354 ms 3284 KB Output is correct
21 Correct 37 ms 2772 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 47 ms 1624 KB Output is correct
24 Correct 57 ms 3028 KB Output is correct
25 Correct 10 ms 580 KB Output is correct
26 Correct 33 ms 2004 KB Output is correct
27 Correct 57 ms 2388 KB Output is correct
28 Correct 63 ms 3284 KB Output is correct
29 Correct 14 ms 1236 KB Output is correct
30 Correct 2 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 2260 KB Output is correct
2 Correct 9 ms 724 KB Output is correct
3 Correct 17 ms 1552 KB Output is correct
4 Correct 18 ms 1752 KB Output is correct
5 Correct 25 ms 2020 KB Output is correct
6 Correct 14 ms 1404 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 20 ms 1408 KB Output is correct
9 Correct 39 ms 3028 KB Output is correct
10 Correct 23 ms 1876 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 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 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 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 17 ms 1108 KB Output is correct
27 Correct 35 ms 2900 KB Output is correct
28 Correct 65 ms 3392 KB Output is correct
29 Correct 318 ms 3056 KB Output is correct
30 Correct 354 ms 3284 KB Output is correct
31 Correct 37 ms 2772 KB Output is correct
32 Correct 2 ms 212 KB Output is correct
33 Correct 47 ms 1624 KB Output is correct
34 Correct 57 ms 3028 KB Output is correct
35 Correct 10 ms 580 KB Output is correct
36 Correct 33 ms 2004 KB Output is correct
37 Correct 57 ms 2388 KB Output is correct
38 Correct 63 ms 3284 KB Output is correct
39 Correct 14 ms 1236 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 273 ms 2900 KB Output is correct
42 Correct 68 ms 3240 KB Output is correct
43 Correct 151 ms 2900 KB Output is correct
44 Correct 67 ms 3156 KB Output is correct
45 Correct 41 ms 3284 KB Output is correct
46 Correct 303 ms 3192 KB Output is correct
47 Correct 36 ms 2900 KB Output is correct
48 Correct 112 ms 3028 KB Output is correct
49 Correct 61 ms 2920 KB Output is correct
50 Correct 1549 ms 3136 KB Output is correct
51 Correct 1637 ms 3324 KB Output is correct
52 Correct 1526 ms 3112 KB Output is correct
53 Correct 1630 ms 3304 KB Output is correct
54 Correct 1525 ms 3088 KB Output is correct
55 Correct 1677 ms 3420 KB Output is correct
56 Correct 1467 ms 2992 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 36 ms 2260 KB Output is correct
10 Correct 9 ms 724 KB Output is correct
11 Correct 17 ms 1552 KB Output is correct
12 Correct 18 ms 1752 KB Output is correct
13 Correct 25 ms 2020 KB Output is correct
14 Correct 14 ms 1404 KB Output is correct
15 Correct 3 ms 468 KB Output is correct
16 Correct 20 ms 1408 KB Output is correct
17 Correct 39 ms 3028 KB Output is correct
18 Correct 23 ms 1876 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 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 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 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 17 ms 1108 KB Output is correct
35 Correct 35 ms 2900 KB Output is correct
36 Correct 65 ms 3392 KB Output is correct
37 Correct 318 ms 3056 KB Output is correct
38 Correct 354 ms 3284 KB Output is correct
39 Correct 37 ms 2772 KB Output is correct
40 Correct 2 ms 212 KB Output is correct
41 Correct 47 ms 1624 KB Output is correct
42 Correct 57 ms 3028 KB Output is correct
43 Correct 10 ms 580 KB Output is correct
44 Correct 33 ms 2004 KB Output is correct
45 Correct 57 ms 2388 KB Output is correct
46 Correct 63 ms 3284 KB Output is correct
47 Correct 14 ms 1236 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 273 ms 2900 KB Output is correct
50 Correct 68 ms 3240 KB Output is correct
51 Correct 151 ms 2900 KB Output is correct
52 Correct 67 ms 3156 KB Output is correct
53 Correct 41 ms 3284 KB Output is correct
54 Correct 303 ms 3192 KB Output is correct
55 Correct 36 ms 2900 KB Output is correct
56 Correct 112 ms 3028 KB Output is correct
57 Correct 61 ms 2920 KB Output is correct
58 Correct 1549 ms 3136 KB Output is correct
59 Correct 1637 ms 3324 KB Output is correct
60 Correct 1526 ms 3112 KB Output is correct
61 Correct 1630 ms 3304 KB Output is correct
62 Correct 1525 ms 3088 KB Output is correct
63 Correct 1677 ms 3420 KB Output is correct
64 Correct 1467 ms 2992 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 1678 ms 3224 KB Output is correct
68 Correct 1663 ms 3208 KB Output is correct
69 Correct 1472 ms 2824 KB Output is correct
70 Correct 1665 ms 3088 KB Output is correct
71 Correct 1616 ms 3068 KB Output is correct
72 Correct 1599 ms 3000 KB Output is correct
73 Correct 1563 ms 2952 KB Output is correct
74 Correct 1702 ms 3188 KB Output is correct
75 Correct 1608 ms 3032 KB Output is correct
76 Correct 1686 ms 3228 KB Output is correct
77 Correct 232 ms 3368 KB Output is correct
78 Correct 70 ms 3156 KB Output is correct
79 Correct 159 ms 2952 KB Output is correct
80 Correct 161 ms 3068 KB Output is correct
81 Correct 153 ms 2844 KB Output is correct
82 Correct 123 ms 3256 KB Output is correct
83 Correct 86 ms 3020 KB Output is correct
84 Correct 985 ms 3312 KB Output is correct
85 Correct 1767 ms 3412 KB Output is correct
86 Correct 2 ms 212 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1795 ms 3412 KB Output is correct
89 Correct 332 ms 872 KB Output is correct
90 Correct 1 ms 212 KB Output is correct