oj.uz

답안 #375774

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
375774 2021-03-10T01:39:56 Z ijxjdjd Chessboard (IZhO18_chessboard) C++14
70 / 100
 1236 ms 3436 KB 
#include <bits/stdc++.h>
#define FR(i, N) for (int i = 0; i < int(N); i++)
#define all(x) begin(x), end(x)

#define f first
#define s second

#define int ll
using namespace std;

using ll = long long;


ll calc(pair<pair<int, int>, pair<int, int>> rec, int d, int par) {
    auto p = rec;
    assert (p.f.f >= 0 && p.f.s >= 0 && p.s.f >= 0 && p.s.s >= 0);
    if (p.f.f > p.s.f || p.f.s > p.s.s) {
        return 0;
    }
    int x1 = p.f.f/d;
    int x2 = p.s.f/d;
    int y1 = p.f.s/d;
    int y2 = p.s.s/d;
    if (p.f.f%d == 0 && p.f.s%d == 0 && p.s.f%d == d-1 && p.s.s%d == d-1) {
        int tot = (x2 - x1 + 1) * (y2 - y1 + 1);
        if ((x1 + y1)%2 == par) {
            //top left here is white
            return (((x2 - x1 + 1)*(y2 - y1 + 1) + 1)/2)*d*d;
        }
        else {
            return (tot - ((x2 - x1 + 1)*(y2 - y1 + 1) + 1)/2)*d*d;
        }
    }
    else if (x1 == x2 && y1 == y2) {
        if ((x1 + y1)%2 == par) {
           return (p.s.f - p.f.f + 1) * (p.s.s - p.f.s + 1);
        }
        else {
            return 0;
        }
    }
    else if (p.f.f%d == 0 && p.s.f%d == d-1 && y1 == y2) {
        int tot = (x2 - x1 + 1);
        if ((x1 + y1)%2 == par) {
            return (tot + 1)/2 * (p.s.s - p.f.s + 1) * d;
        }
        else {
            return (tot - (tot + 1)/2) * (p.s.s - p.f.s + 1) * d;
        }
    }
    else if (p.f.s%d == 0 && p.s.s%d == d-1 && x1 == x2) {
        int tot = (y2 - y1 + 1);
        if ((x1 + y1)%2 == par) {
            return (tot + 1)/2 * (p.s.f - p.f.f + 1)*d;
        }
        else {
            return (tot - (tot + 1)/2) * (p.s.f - p.f.f + 1)*d;
        }
    }
    else if (x1 == x2) {
        auto left = rec;
        left.s.s = y1*d+d-1;

        auto right = rec;
        right.f.s = y2*d;

        rec.f.s = left.s.s+1;
        rec.s.s = right.f.s-1;
        return calc(left, d, par) + calc(right, d, par) + calc(rec, d, par);
    }
    else if (y1 == y2) {
        auto top = rec;
        top.s.f = x1*d + d - 1;

        auto bot = rec;
        bot.f.f = x2*d;

        rec.f.f = top.s.f+1;
        rec.s.f = bot.f.f-1;
        return calc(top, d, par) + calc(bot, d, par) + calc(rec, d, par);
    }
    else {
        auto tleft = rec;
        auto bleft = rec;
        auto tright = rec;
        auto bright = rec;

        tleft.s.s = y1*d + d-1;
        tleft.s.f = x1*d + d-1;

        bleft.f.f = x2*d;
        bleft.s.s = y1*d + d-1;

        tright.f.s = y2*d;
        tright.s.f = x1*d + d-1;

        bright.f.f = x2*d;
        bright.f.s = y2*d;


        auto left = rec;
        auto right = rec;
        auto bot = rec;
        auto top = rec;

        left.f.f = tleft.s.f+1;
        left.s.f = bleft.f.f-1;
        left.s.s= y1*d + d-1;

        right.f.f = tright.s.f+1;
        right.s.f = bright.f.f-1;
        right.f.s=y2*d;

        bot.f.s = bleft.s.s+1;
        bot.s.s=bright.f.s-1;
        bot.f.f=x2*d;

        top.f.s=tleft.s.s+1;
        top.s.s=tright.f.s-1;
        top.s.f=x1*d+d-1;

        rec.f.f = d*(x1 + 1);
        rec.f.s = d*(y1 + 1);
        rec.s.f = d*x2-1;
        rec.s.s = d*y2-1;

        return calc(tleft, d, par) + calc(bleft, d, par) + calc(tright, d, par) + calc(bright, d, par) + calc(left, d, par) + calc(right, d, par) + calc(bot, d, par) + calc(top, d, par) + calc(rec, d, par);
    }

}
signed main() {
	cin.tie(0);
	cin.sync_with_stdio(0);
		cerr << calc({{1, 5}, {8, 7}}, 3, 0) << endl;

	int N, K;
	cin >> N >> K;
	vector<pair<pair<int, int>, pair<int, int>>> vec(K);
	for (int i = 0; i < K; i++) {
        cin >> vec[i].f.f >> vec[i].f.s >> vec[i].s.f >> vec[i].s.s;
        vec[i].f.f--;
        vec[i].f.s--;
        vec[i].s.f--;
        vec[i].s.s--;
	}
	int ans = N*N;
	for (int d = 1; d < N; d++) {
        if (N%d == 0) {
            int cnt = N/d;
//            ll white;
//            ll black;

            int black = d*d*((cnt * cnt)+1)/2;
            int white = d*d*(cnt*cnt - ((cnt*cnt)+1)/2);
            for (auto& p : vec) {
                int tot = (p.s.f - p.f.f + 1) * (p.s.s - p.f.s + 1);

                int res1 = calc(p, d, 0);
                int res2 = calc(p, d, 1);

                black += res2;
                black -= tot-res2;

                white += res1;
                white -= tot-res1;
            }
            ans = min({ans, white, black});
            //top left is black
        }
	}
	cout << ans << '\n';
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 2284 KB Output is correct
2 Correct 8 ms 876 KB Output is correct
3 Correct 18 ms 1516 KB Output is correct
4 Correct 19 ms 1772 KB Output is correct
5 Correct 25 ms 2028 KB Output is correct
6 Correct 16 ms 1388 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 17 ms 1388 KB Output is correct
9 Correct 40 ms 3180 KB Output is correct
10 Correct 23 ms 1900 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 14 ms 1132 KB Output is correct
17 Correct 32 ms 2924 KB Output is correct
18 Correct 49 ms 3436 KB Output is correct
19 Correct 155 ms 3052 KB Output is correct
20 Correct 177 ms 3436 KB Output is correct
21 Correct 31 ms 2924 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 30 ms 1644 KB Output is correct
24 Correct 44 ms 3180 KB Output is correct
25 Correct 7 ms 620 KB Output is correct
26 Correct 27 ms 2156 KB Output is correct
27 Correct 42 ms 2412 KB Output is correct
28 Correct 46 ms 3308 KB Output is correct
29 Correct 14 ms 1388 KB Output is correct
30 Correct 2 ms 364 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 2284 KB Output is correct
2 Correct 8 ms 876 KB Output is correct
3 Correct 18 ms 1516 KB Output is correct
4 Correct 19 ms 1772 KB Output is correct
5 Correct 25 ms 2028 KB Output is correct
6 Correct 16 ms 1388 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 17 ms 1388 KB Output is correct
9 Correct 40 ms 3180 KB Output is correct
10 Correct 23 ms 1900 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 14 ms 1132 KB Output is correct
27 Correct 32 ms 2924 KB Output is correct
28 Correct 49 ms 3436 KB Output is correct
29 Correct 155 ms 3052 KB Output is correct
30 Correct 177 ms 3436 KB Output is correct
31 Correct 31 ms 2924 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 30 ms 1644 KB Output is correct
34 Correct 44 ms 3180 KB Output is correct
35 Correct 7 ms 620 KB Output is correct
36 Correct 27 ms 2156 KB Output is correct
37 Correct 42 ms 2412 KB Output is correct
38 Correct 46 ms 3308 KB Output is correct
39 Correct 14 ms 1388 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 143 ms 2924 KB Output is correct
42 Correct 52 ms 3308 KB Output is correct
43 Correct 87 ms 2924 KB Output is correct
44 Correct 51 ms 3180 KB Output is correct
45 Correct 44 ms 3436 KB Output is correct
46 Correct 161 ms 3180 KB Output is correct
47 Correct 38 ms 3052 KB Output is correct
48 Correct 70 ms 3052 KB Output is correct
49 Correct 47 ms 2924 KB Output is correct
50 Correct 695 ms 3180 KB Output is correct
51 Correct 742 ms 3308 KB Output is correct
52 Correct 693 ms 3180 KB Output is correct
53 Correct 738 ms 3308 KB Output is correct
54 Correct 691 ms 3052 KB Output is correct
55 Correct 777 ms 3436 KB Output is correct
56 Correct 663 ms 3052 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 28 ms 2284 KB Output is correct
10 Correct 8 ms 876 KB Output is correct
11 Correct 18 ms 1516 KB Output is correct
12 Correct 19 ms 1772 KB Output is correct
13 Correct 25 ms 2028 KB Output is correct
14 Correct 16 ms 1388 KB Output is correct
15 Correct 4 ms 640 KB Output is correct
16 Correct 17 ms 1388 KB Output is correct
17 Correct 40 ms 3180 KB Output is correct
18 Correct 23 ms 1900 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 14 ms 1132 KB Output is correct
35 Correct 32 ms 2924 KB Output is correct
36 Correct 49 ms 3436 KB Output is correct
37 Correct 155 ms 3052 KB Output is correct
38 Correct 177 ms 3436 KB Output is correct
39 Correct 31 ms 2924 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 30 ms 1644 KB Output is correct
42 Correct 44 ms 3180 KB Output is correct
43 Correct 7 ms 620 KB Output is correct
44 Correct 27 ms 2156 KB Output is correct
45 Correct 42 ms 2412 KB Output is correct
46 Correct 46 ms 3308 KB Output is correct
47 Correct 14 ms 1388 KB Output is correct
48 Correct 2 ms 364 KB Output is correct
49 Correct 143 ms 2924 KB Output is correct
50 Correct 52 ms 3308 KB Output is correct
51 Correct 87 ms 2924 KB Output is correct
52 Correct 51 ms 3180 KB Output is correct
53 Correct 44 ms 3436 KB Output is correct
54 Correct 161 ms 3180 KB Output is correct
55 Correct 38 ms 3052 KB Output is correct
56 Correct 70 ms 3052 KB Output is correct
57 Correct 47 ms 2924 KB Output is correct
58 Correct 695 ms 3180 KB Output is correct
59 Correct 742 ms 3308 KB Output is correct
60 Correct 693 ms 3180 KB Output is correct
61 Correct 738 ms 3308 KB Output is correct
62 Correct 691 ms 3052 KB Output is correct
63 Correct 777 ms 3436 KB Output is correct
64 Correct 663 ms 3052 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1229 ms 3308 KB Output is correct
68 Correct 1236 ms 3308 KB Output is correct
69 Incorrect 1035 ms 2924 KB Output isn't correct
70 Halted 0 ms 0 KB -