oj.uz

Submission #523557

# Submission time Handle Problem Language Result Execution time Memory
523557 2022-02-07T18:33:34 Z RaresFelix Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 11172 KB 
#include <bits/stdc++.h>

#define MN 107171
using ll = long long;
using namespace std;
int n, k;
tuple<int, int, int, int> R[MN];

namespace AINT {
    int V[4 * MN], 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;
        R[i] = make_tuple(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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 1 ms 2764 KB Output is correct
4 Correct 1 ms 2764 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 2 ms 2836 KB Output is correct
7 Correct 1 ms 2764 KB Output is correct
8 Correct 2 ms 2840 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 6936 KB Output is correct
2 Correct 28 ms 4164 KB Output is correct
3 Correct 100 ms 8132 KB Output is correct
4 Correct 52 ms 5784 KB Output is correct
5 Correct 99 ms 7876 KB Output is correct
6 Correct 67 ms 6596 KB Output is correct
7 Correct 18 ms 3992 KB Output is correct
8 Correct 70 ms 6596 KB Output is correct
9 Correct 141 ms 9460 KB Output is correct
10 Correct 92 ms 7504 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 3 ms 2764 KB Output is correct
4 Correct 4 ms 2904 KB Output is correct
5 Correct 3 ms 2892 KB Output is correct
6 Correct 2 ms 2872 KB Output is correct
7 Correct 3 ms 2892 KB Output is correct
8 Correct 3 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 1 ms 2764 KB Output is correct
11 Correct 3 ms 2832 KB Output is correct
12 Correct 2 ms 2892 KB Output is correct
13 Correct 4 ms 2892 KB Output is correct
14 Correct 4 ms 2892 KB Output is correct
15 Correct 5 ms 2892 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 3 ms 2764 KB Output is correct
4 Correct 4 ms 2904 KB Output is correct
5 Correct 3 ms 2892 KB Output is correct
6 Correct 2 ms 2872 KB Output is correct
7 Correct 3 ms 2892 KB Output is correct
8 Correct 3 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 1 ms 2764 KB Output is correct
11 Correct 3 ms 2832 KB Output is correct
12 Correct 2 ms 2892 KB Output is correct
13 Correct 4 ms 2892 KB Output is correct
14 Correct 4 ms 2892 KB Output is correct
15 Correct 5 ms 2892 KB Output is correct
16 Correct 60 ms 4428 KB Output is correct
17 Correct 79 ms 7820 KB Output is correct
18 Correct 209 ms 8228 KB Output is correct
19 Correct 1412 ms 7960 KB Output is correct
20 Correct 1580 ms 8160 KB Output is correct
21 Correct 75 ms 7748 KB Output is correct
22 Correct 7 ms 2844 KB Output is correct
23 Correct 187 ms 5264 KB Output is correct
24 Correct 187 ms 7972 KB Output is correct
25 Correct 41 ms 3276 KB Output is correct
26 Correct 118 ms 5956 KB Output is correct
27 Correct 221 ms 6944 KB Output is correct
28 Correct 203 ms 8064 KB Output is correct
29 Correct 32 ms 4812 KB Output is correct
30 Correct 8 ms 2980 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 6936 KB Output is correct
2 Correct 28 ms 4164 KB Output is correct
3 Correct 100 ms 8132 KB Output is correct
4 Correct 52 ms 5784 KB Output is correct
5 Correct 99 ms 7876 KB Output is correct
6 Correct 67 ms 6596 KB Output is correct
7 Correct 18 ms 3992 KB Output is correct
8 Correct 70 ms 6596 KB Output is correct
9 Correct 141 ms 9460 KB Output is correct
10 Correct 92 ms 7504 KB Output is correct
11 Correct 3 ms 2764 KB Output is correct
12 Correct 2 ms 2764 KB Output is correct
13 Correct 3 ms 2764 KB Output is correct
14 Correct 4 ms 2904 KB Output is correct
15 Correct 3 ms 2892 KB Output is correct
16 Correct 2 ms 2872 KB Output is correct
17 Correct 3 ms 2892 KB Output is correct
18 Correct 3 ms 2764 KB Output is correct
19 Correct 2 ms 2764 KB Output is correct
20 Correct 1 ms 2764 KB Output is correct
21 Correct 3 ms 2832 KB Output is correct
22 Correct 2 ms 2892 KB Output is correct
23 Correct 4 ms 2892 KB Output is correct
24 Correct 4 ms 2892 KB Output is correct
25 Correct 5 ms 2892 KB Output is correct
26 Correct 60 ms 4428 KB Output is correct
27 Correct 79 ms 7820 KB Output is correct
28 Correct 209 ms 8228 KB Output is correct
29 Correct 1412 ms 7960 KB Output is correct
30 Correct 1580 ms 8160 KB Output is correct
31 Correct 75 ms 7748 KB Output is correct
32 Correct 7 ms 2844 KB Output is correct
33 Correct 187 ms 5264 KB Output is correct
34 Correct 187 ms 7972 KB Output is correct
35 Correct 41 ms 3276 KB Output is correct
36 Correct 118 ms 5956 KB Output is correct
37 Correct 221 ms 6944 KB Output is correct
38 Correct 203 ms 8064 KB Output is correct
39 Correct 32 ms 4812 KB Output is correct
40 Correct 8 ms 2980 KB Output is correct
41 Execution timed out 2027 ms 11172 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 1 ms 2764 KB Output is correct
4 Correct 1 ms 2764 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 2 ms 2836 KB Output is correct
7 Correct 1 ms 2764 KB Output is correct
8 Correct 2 ms 2840 KB Output is correct
9 Correct 113 ms 6936 KB Output is correct
10 Correct 28 ms 4164 KB Output is correct
11 Correct 100 ms 8132 KB Output is correct
12 Correct 52 ms 5784 KB Output is correct
13 Correct 99 ms 7876 KB Output is correct
14 Correct 67 ms 6596 KB Output is correct
15 Correct 18 ms 3992 KB Output is correct
16 Correct 70 ms 6596 KB Output is correct
17 Correct 141 ms 9460 KB Output is correct
18 Correct 92 ms 7504 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 4 ms 2904 KB Output is correct
23 Correct 3 ms 2892 KB Output is correct
24 Correct 2 ms 2872 KB Output is correct
25 Correct 3 ms 2892 KB Output is correct
26 Correct 3 ms 2764 KB Output is correct
27 Correct 2 ms 2764 KB Output is correct
28 Correct 1 ms 2764 KB Output is correct
29 Correct 3 ms 2832 KB Output is correct
30 Correct 2 ms 2892 KB Output is correct
31 Correct 4 ms 2892 KB Output is correct
32 Correct 4 ms 2892 KB Output is correct
33 Correct 5 ms 2892 KB Output is correct
34 Correct 60 ms 4428 KB Output is correct
35 Correct 79 ms 7820 KB Output is correct
36 Correct 209 ms 8228 KB Output is correct
37 Correct 1412 ms 7960 KB Output is correct
38 Correct 1580 ms 8160 KB Output is correct
39 Correct 75 ms 7748 KB Output is correct
40 Correct 7 ms 2844 KB Output is correct
41 Correct 187 ms 5264 KB Output is correct
42 Correct 187 ms 7972 KB Output is correct
43 Correct 41 ms 3276 KB Output is correct
44 Correct 118 ms 5956 KB Output is correct
45 Correct 221 ms 6944 KB Output is correct
46 Correct 203 ms 8064 KB Output is correct
47 Correct 32 ms 4812 KB Output is correct
48 Correct 8 ms 2980 KB Output is correct
49 Execution timed out 2027 ms 11172 KB Time limit exceeded
50 Halted 0 ms 0 KB -