oj.uz

답안 #523558

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
523558 2022-02-07T18:34:55 Z RaresFelix Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 7120 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define MN 107171
using ll = long long;
using namespace std;
int n, k;

namespace AINT {
    int V[4 * MN];
    bool LZ[4 * MN];
    void clear(int u = 1, int s = 1, int d = n) {
        V[u] = LZ[u] = 0;
        if(s != d)
            clear(u * 2, s, (s + d) /2), clear(u * 2 + 1, (s + d) / 2 + 1, d);
    }
    void prp(int u, int s, int d) {
        if(!LZ[u]) return;
        V[u] = d - s + 1 - V[u];
        LZ[u] = 0;
        if(s != d)
            LZ[u * 2] ^= 1, LZ[u * 2 + 1] ^= 1;
    }
    void update(int l, int r, int u = 1, int s = 1, int d = n) {
        prp(u, s, d);
        if(r < s || d < l) return;
        if(l <= s && d <= r) {
            LZ[u] ^= 1;
            prp(u, s, d);
            return;
        }
        update(l, r, u * 2, s, (s + d) / 2);
        update(l, r, u * 2 + 1, (s + d) / 2 + 1, d);
        V[u] = V[u * 2] + V[u * 2 + 1];
    }
}
vector<pair<int, int>> OP[MN];
ll acopera(int l, int c0) {
    if(l == n) return LLONG_MAX;
    ///c0 = 1 daca coloram primul patrat
    AINT::clear();
    for(int i = 1 + (1 - c0) * l; i <= n; i += 2 * l)
        AINT::update(i, i + l - 1);
    ll re = 0;
    for(int i = 1; i <= n; ++i) {
        for(auto [l, r] : OP[i])
            AINT::update(l, r);
        re += AINT::V[1];
        if(i % l == 0)
            AINT::update(1, n);
    }
    return re;
}

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    cin >> n >> k;
    ll re = LLONG_MAX;
    for (int i = 1, a, b, c, d; i <= k; ++i) {
        cin >> a >> b >> c >> d;
        OP[a].emplace_back(b, d);
        OP[c + 1].emplace_back(b, d);
    }
    vector<int> D;
    for (int i = 1; i * i <= n; ++i)
        if (i * i == n) D.push_back(i);
        else if (n % i == 0)
            D.push_back(i), D.push_back(n / i);
    for (auto it: D)
        re = min(re, min(acopera(it, 0), acopera(it, 1)));
    cout << re << "\n";
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 5668 KB Output is correct
2 Correct 24 ms 3532 KB Output is correct
3 Correct 79 ms 5800 KB Output is correct
4 Correct 49 ms 4180 KB Output is correct
5 Correct 88 ms 5392 KB Output is correct
6 Correct 62 ms 4776 KB Output is correct
7 Correct 17 ms 3516 KB Output is correct
8 Correct 76 ms 4680 KB Output is correct
9 Correct 151 ms 5788 KB Output is correct
10 Correct 80 ms 5196 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 2 ms 2764 KB Output is correct
4 Correct 4 ms 2764 KB Output is correct
5 Correct 3 ms 2764 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 3 ms 2768 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 3 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 3 ms 2764 KB Output is correct
12 Correct 3 ms 2764 KB Output is correct
13 Correct 4 ms 2764 KB Output is correct
14 Correct 5 ms 2884 KB Output is correct
15 Correct 3 ms 2764 KB Output is correct
16 Correct 51 ms 3532 KB Output is correct
17 Correct 68 ms 4968 KB Output is correct
18 Correct 172 ms 5068 KB Output is correct
19 Correct 1141 ms 5020 KB Output is correct
20 Correct 1289 ms 5004 KB Output is correct
21 Correct 77 ms 5068 KB Output is correct
22 Correct 8 ms 2868 KB Output is correct
23 Correct 157 ms 3968 KB Output is correct
24 Correct 163 ms 5088 KB Output is correct
25 Correct 39 ms 3080 KB Output is correct
26 Correct 102 ms 4180 KB Output is correct
27 Correct 184 ms 4888 KB Output is correct
28 Correct 174 ms 5008 KB Output is correct
29 Correct 31 ms 3788 KB Output is correct
30 Correct 10 ms 2924 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 5668 KB Output is correct
2 Correct 24 ms 3532 KB Output is correct
3 Correct 79 ms 5800 KB Output is correct
4 Correct 49 ms 4180 KB Output is correct
5 Correct 88 ms 5392 KB Output is correct
6 Correct 62 ms 4776 KB Output is correct
7 Correct 17 ms 3516 KB Output is correct
8 Correct 76 ms 4680 KB Output is correct
9 Correct 151 ms 5788 KB Output is correct
10 Correct 80 ms 5196 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 2 ms 2764 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 4 ms 2764 KB Output is correct
15 Correct 3 ms 2764 KB Output is correct
16 Correct 3 ms 2764 KB Output is correct
17 Correct 3 ms 2768 KB Output is correct
18 Correct 2 ms 2764 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 3 ms 2764 KB Output is correct
22 Correct 3 ms 2764 KB Output is correct
23 Correct 4 ms 2764 KB Output is correct
24 Correct 5 ms 2884 KB Output is correct
25 Correct 3 ms 2764 KB Output is correct
26 Correct 51 ms 3532 KB Output is correct
27 Correct 68 ms 4968 KB Output is correct
28 Correct 172 ms 5068 KB Output is correct
29 Correct 1141 ms 5020 KB Output is correct
30 Correct 1289 ms 5004 KB Output is correct
31 Correct 77 ms 5068 KB Output is correct
32 Correct 8 ms 2868 KB Output is correct
33 Correct 157 ms 3968 KB Output is correct
34 Correct 163 ms 5088 KB Output is correct
35 Correct 39 ms 3080 KB Output is correct
36 Correct 102 ms 4180 KB Output is correct
37 Correct 184 ms 4888 KB Output is correct
38 Correct 174 ms 5008 KB Output is correct
39 Correct 31 ms 3788 KB Output is correct
40 Correct 10 ms 2924 KB Output is correct
41 Execution timed out 2024 ms 7120 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 2 ms 2764 KB Output is correct
4 Correct 1 ms 2764 KB Output is correct
5 Correct 1 ms 2764 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 99 ms 5668 KB Output is correct
10 Correct 24 ms 3532 KB Output is correct
11 Correct 79 ms 5800 KB Output is correct
12 Correct 49 ms 4180 KB Output is correct
13 Correct 88 ms 5392 KB Output is correct
14 Correct 62 ms 4776 KB Output is correct
15 Correct 17 ms 3516 KB Output is correct
16 Correct 76 ms 4680 KB Output is correct
17 Correct 151 ms 5788 KB Output is correct
18 Correct 80 ms 5196 KB Output is correct
19 Correct 2 ms 2764 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 4 ms 2764 KB Output is correct
23 Correct 3 ms 2764 KB Output is correct
24 Correct 3 ms 2764 KB Output is correct
25 Correct 3 ms 2768 KB Output is correct
26 Correct 2 ms 2764 KB Output is correct
27 Correct 3 ms 2764 KB Output is correct
28 Correct 2 ms 2764 KB Output is correct
29 Correct 3 ms 2764 KB Output is correct
30 Correct 3 ms 2764 KB Output is correct
31 Correct 4 ms 2764 KB Output is correct
32 Correct 5 ms 2884 KB Output is correct
33 Correct 3 ms 2764 KB Output is correct
34 Correct 51 ms 3532 KB Output is correct
35 Correct 68 ms 4968 KB Output is correct
36 Correct 172 ms 5068 KB Output is correct
37 Correct 1141 ms 5020 KB Output is correct
38 Correct 1289 ms 5004 KB Output is correct
39 Correct 77 ms 5068 KB Output is correct
40 Correct 8 ms 2868 KB Output is correct
41 Correct 157 ms 3968 KB Output is correct
42 Correct 163 ms 5088 KB Output is correct
43 Correct 39 ms 3080 KB Output is correct
44 Correct 102 ms 4180 KB Output is correct
45 Correct 184 ms 4888 KB Output is correct
46 Correct 174 ms 5008 KB Output is correct
47 Correct 31 ms 3788 KB Output is correct
48 Correct 10 ms 2924 KB Output is correct
49 Execution timed out 2024 ms 7120 KB Time limit exceeded
50 Halted 0 ms 0 KB -