oj.uz

답안 #91726

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
91726 2018-12-29T15:20:32 Z popovicirobert Chessboard (IZhO18_chessboard) C++14
70 / 100
 386 ms 4344 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44

using namespace std;

const int MAXN = (int) 1e5;

struct Data {
    int x1, y1, x2, y2;
}arr[MAXN + 1];

inline void add(vector <ll> &fr, ll a, ll b) {
    fr[0] += a;
    fr[1] += b;
}

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, n, k;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> k;
    for(i = 1; i <= k; i++) {
        cin >> arr[i].x1 >> arr[i].y1 >> arr[i].x2 >> arr[i].y2;
        arr[i].x1--, arr[i].y1--;
        arr[i].x2--, arr[i].y2--;
    }
    ll ans = 1LL * n * n;
    for(int len = 1; len < n; len++) {
        if(n % len == 0) {
            vector <ll> fr(2);
            for(i = 1; i <= k; i++) {
                if(arr[i].x2 / len == arr[i].x1 / len && arr[i].y2 / len == arr[i].y1 / len) {
                    if((arr[i].x1 / len + arr[i].y1 / len) % 2 == 0) {
                        fr[0] += 1LL * (arr[i].x2 - arr[i].x1 + 1) * (arr[i].y2 - arr[i].y1 + 1);
                    }
                    else {
                        fr[1] += 1LL * (arr[i].x2 - arr[i].x1 + 1) * (arr[i].y2 - arr[i].y1 + 1);
                    }
                    continue;
                }
                int a = ((arr[i].x1 + len - 1) / len) * len - arr[i].x1;
                int A = ((arr[i].y1 + len - 1) / len) * len - arr[i].y1;
                int b = arr[i].x2 - (((arr[i].x2 - len + 1) / len) * len + len - 1);
                int B = arr[i].y2 - (((arr[i].y2 - len + 1) / len) * len + len - 1);
                /*if(len == 2) {
                    cerr << a << " " << A << " " << b << " " << B << "\n";
                }*/

                if((arr[i].x1 + arr[i].y1) % 2 == 0) {
                    add(fr, 1LL * a * A, 0);
                    int cur = (arr[i].y2 - arr[i].y1 + 1 - A - B) / len;
                    add(fr, 1LL * len * (cur / 2), 1LL * len * ((cur + 1) / 2));
                    cur = (arr[i].x2 - arr[i].x1 + 1 - a - b) / len;
                    add(fr, 1LL * len * (cur / 2), 1LL * len * ((cur + 1) / 2));
                }
                else {
                    add(fr, 0, 1LL * a * A);
                    int cur = (arr[i].y2 - arr[i].y1 + 1 - A - B) / len;
                    add(fr, 1LL * len * ((cur + 1) / 2), 1LL * len * (cur / 2));
                    cur = (arr[i].x2 - arr[i].x1 + 1 - a - b) / len;
                    add(fr, 1LL * len * ((cur + 1) / 2), 1LL * len * (cur / 2));
                }


                if((arr[i].x1 + arr[i].y2) % 2 == 0) {
                    add(fr, 1LL * a * B, 0);
                }
                else {
                    add(fr, 0, 1LL * a * B);
                }
                if((arr[i].x2 + arr[i].y1) % 2 == 0) {
                    add(fr, 1LL * b * A, 0);
                }
                else {
                    add(fr, 0, 1LL * b * A);
                }


                if((arr[i].x2 + arr[i].y2) % 2 == 0) {
                    add(fr, 1LL * b * B, 0);
                    int cur = (arr[i].x2 - arr[i].x1 + 1 - a - b) / len;
                    add(fr, 1LL * len * (cur / 2), 1LL * len * ((cur + 1) / 2));
                    cur = (arr[i].y2 - arr[i].y1 + 1 - A - B) / len;
                    add(fr, 1LL * len * (cur / 2), 1LL * len * ((cur + 1) / 2));
                }
                else {
                    add(fr, 0, 1LL * b * B);
                    int cur = (arr[i].x2 - arr[i].x1 + 1 - a - b) / len;
                    add(fr, 1LL * len * ((cur + 1) / 2), 1LL * len * (cur / 2));
                    cur = (arr[i].y2 - arr[i].y1 + 1 - A - B) / len;
                    add(fr, 1LL * len * ((cur + 1) / 2), 1LL * len * (cur / 2));
                }


                ll cnt0, cnt1;
                ll s = 1LL * (arr[i].x2 - arr[i].x1 + 1 - a - b) * (arr[i].y2 - arr[i].y1 + 1 - A - B);
                if((s / (1LL * len * len)) % 2 == 0) {
                    cnt0 = cnt1 = (s / (1LL * len * len)) / 2;
                }
                else {
                    cnt0 = cnt1 = (s / (1LL * len * len)) / 2;
                    if((arr[i].x1 + arr[i].y1) % 2 == 0) {
                        cnt0++;
                    }
                    else {
                        cnt1++;
                    }
                }
                fr[0] += 1LL * len * len * cnt0;
                fr[1] += 1LL * len * len * cnt1;

            }
            ll cnt0, cnt1;
            if((n / len) % 2 == 0) {
                cnt0 = cnt1 = ((1LL * n * n) / (1LL * len * len)) / 2;
            }
            else {
                cnt0 = cnt1 = ((1LL * n * n) / (1LL * len * len)) / 2;
                cnt0++;
            }
            cnt0 *= 1LL * len * len;
            cnt1 *= 1LL * len * len;
            ans = min(ans, min(cnt0 - fr[0] + fr[1], cnt1 - fr[1] + fr[0]));
        }
    }
    cout << ans;
    //cin.close();
    //cout.close();
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 2680 KB Output is correct
2 Correct 8 ms 928 KB Output is correct
3 Correct 16 ms 1912 KB Output is correct
4 Correct 17 ms 1912 KB Output is correct
5 Correct 22 ms 2428 KB Output is correct
6 Correct 15 ms 1784 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 15 ms 1788 KB Output is correct
9 Correct 35 ms 3960 KB Output is correct
10 Correct 21 ms 2296 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 11 ms 1272 KB Output is correct
17 Correct 26 ms 3064 KB Output is correct
18 Correct 34 ms 3548 KB Output is correct
19 Correct 71 ms 3192 KB Output is correct
20 Correct 78 ms 3496 KB Output is correct
21 Correct 26 ms 2940 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 19 ms 1784 KB Output is correct
24 Correct 32 ms 3208 KB Output is correct
25 Correct 5 ms 632 KB Output is correct
26 Correct 20 ms 2168 KB Output is correct
27 Correct 27 ms 2552 KB Output is correct
28 Correct 34 ms 3448 KB Output is correct
29 Correct 12 ms 1400 KB Output is correct
30 Correct 3 ms 504 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 2680 KB Output is correct
2 Correct 8 ms 928 KB Output is correct
3 Correct 16 ms 1912 KB Output is correct
4 Correct 17 ms 1912 KB Output is correct
5 Correct 22 ms 2428 KB Output is correct
6 Correct 15 ms 1784 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 15 ms 1788 KB Output is correct
9 Correct 35 ms 3960 KB Output is correct
10 Correct 21 ms 2296 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 11 ms 1272 KB Output is correct
27 Correct 26 ms 3064 KB Output is correct
28 Correct 34 ms 3548 KB Output is correct
29 Correct 71 ms 3192 KB Output is correct
30 Correct 78 ms 3496 KB Output is correct
31 Correct 26 ms 2940 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 19 ms 1784 KB Output is correct
34 Correct 32 ms 3208 KB Output is correct
35 Correct 5 ms 632 KB Output is correct
36 Correct 20 ms 2168 KB Output is correct
37 Correct 27 ms 2552 KB Output is correct
38 Correct 34 ms 3448 KB Output is correct
39 Correct 12 ms 1400 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 64 ms 3708 KB Output is correct
42 Correct 38 ms 4088 KB Output is correct
43 Correct 47 ms 3704 KB Output is correct
44 Correct 37 ms 3960 KB Output is correct
45 Correct 36 ms 4344 KB Output is correct
46 Correct 73 ms 4088 KB Output is correct
47 Correct 32 ms 3704 KB Output is correct
48 Correct 42 ms 3832 KB Output is correct
49 Correct 35 ms 3704 KB Output is correct
50 Correct 247 ms 3960 KB Output is correct
51 Correct 359 ms 4216 KB Output is correct
52 Correct 242 ms 3960 KB Output is correct
53 Correct 255 ms 4216 KB Output is correct
54 Correct 237 ms 3908 KB Output is correct
55 Correct 265 ms 4344 KB Output is correct
56 Correct 232 ms 3832 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 24 ms 2680 KB Output is correct
10 Correct 8 ms 928 KB Output is correct
11 Correct 16 ms 1912 KB Output is correct
12 Correct 17 ms 1912 KB Output is correct
13 Correct 22 ms 2428 KB Output is correct
14 Correct 15 ms 1784 KB Output is correct
15 Correct 5 ms 604 KB Output is correct
16 Correct 15 ms 1788 KB Output is correct
17 Correct 35 ms 3960 KB Output is correct
18 Correct 21 ms 2296 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 380 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 11 ms 1272 KB Output is correct
35 Correct 26 ms 3064 KB Output is correct
36 Correct 34 ms 3548 KB Output is correct
37 Correct 71 ms 3192 KB Output is correct
38 Correct 78 ms 3496 KB Output is correct
39 Correct 26 ms 2940 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 19 ms 1784 KB Output is correct
42 Correct 32 ms 3208 KB Output is correct
43 Correct 5 ms 632 KB Output is correct
44 Correct 20 ms 2168 KB Output is correct
45 Correct 27 ms 2552 KB Output is correct
46 Correct 34 ms 3448 KB Output is correct
47 Correct 12 ms 1400 KB Output is correct
48 Correct 3 ms 504 KB Output is correct
49 Correct 64 ms 3708 KB Output is correct
50 Correct 38 ms 4088 KB Output is correct
51 Correct 47 ms 3704 KB Output is correct
52 Correct 37 ms 3960 KB Output is correct
53 Correct 36 ms 4344 KB Output is correct
54 Correct 73 ms 4088 KB Output is correct
55 Correct 32 ms 3704 KB Output is correct
56 Correct 42 ms 3832 KB Output is correct
57 Correct 35 ms 3704 KB Output is correct
58 Correct 247 ms 3960 KB Output is correct
59 Correct 359 ms 4216 KB Output is correct
60 Correct 242 ms 3960 KB Output is correct
61 Correct 255 ms 4216 KB Output is correct
62 Correct 237 ms 3908 KB Output is correct
63 Correct 265 ms 4344 KB Output is correct
64 Correct 232 ms 3832 KB Output is correct
65 Correct 2 ms 504 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Incorrect 386 ms 4092 KB Output isn't correct
68 Halted 0 ms 0 KB -