oj.uz

Submission #523561

# Submission time Handle Problem Language Result Execution time Memory
523561 2022-02-07T18:42:39 Z RaresFelix Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 7536 KB 
#include <vector>
#include <iostream>
#include <climits>

//#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[3 * MN];
    bool LZ[3 * MN];
    void clear(const int &u = 1, const int &s = 1, const 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);
    }
    static inline void prp(const int &u, const int &s, const 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(const int &l, const 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) {
    if(l == n) return LLONG_MAX;
    ///c0 = 1 daca coloram primul patrat
    AINT::clear();
    for(int i = 1 + 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{1};
    for (int i = 2; 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) {
        ll v = acopera(it);
        re = min(re, min(v, 1ll * n * n - v));
    }
    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 1 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 1 ms 2764 KB Output is correct
7 Correct 1 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 5676 KB Output is correct
2 Correct 18 ms 3572 KB Output is correct
3 Correct 53 ms 5692 KB Output is correct
4 Correct 33 ms 4100 KB Output is correct
5 Correct 62 ms 5392 KB Output is correct
6 Correct 40 ms 4684 KB Output is correct
7 Correct 11 ms 3404 KB Output is correct
8 Correct 59 ms 4800 KB Output is correct
9 Correct 90 ms 5716 KB Output is correct
10 Correct 52 ms 5060 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2764 KB Output is correct
2 Correct 2 ms 2836 KB Output is correct
3 Correct 2 ms 2764 KB Output is correct
4 Correct 3 ms 2764 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 4 ms 2764 KB Output is correct
8 Correct 3 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 2 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 3 ms 2764 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2764 KB Output is correct
2 Correct 2 ms 2836 KB Output is correct
3 Correct 2 ms 2764 KB Output is correct
4 Correct 3 ms 2764 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 4 ms 2764 KB Output is correct
8 Correct 3 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 2 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 3 ms 2764 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct
16 Correct 33 ms 3532 KB Output is correct
17 Correct 49 ms 4988 KB Output is correct
18 Correct 112 ms 4960 KB Output is correct
19 Correct 698 ms 5020 KB Output is correct
20 Correct 765 ms 5004 KB Output is correct
21 Correct 47 ms 5060 KB Output is correct
22 Correct 4 ms 2868 KB Output is correct
23 Correct 95 ms 3952 KB Output is correct
24 Correct 108 ms 5088 KB Output is correct
25 Correct 22 ms 3020 KB Output is correct
26 Correct 73 ms 4272 KB Output is correct
27 Correct 116 ms 4884 KB Output is correct
28 Correct 104 ms 4940 KB Output is correct
29 Correct 24 ms 3764 KB Output is correct
30 Correct 5 ms 2892 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 5676 KB Output is correct
2 Correct 18 ms 3572 KB Output is correct
3 Correct 53 ms 5692 KB Output is correct
4 Correct 33 ms 4100 KB Output is correct
5 Correct 62 ms 5392 KB Output is correct
6 Correct 40 ms 4684 KB Output is correct
7 Correct 11 ms 3404 KB Output is correct
8 Correct 59 ms 4800 KB Output is correct
9 Correct 90 ms 5716 KB Output is correct
10 Correct 52 ms 5060 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 2 ms 2836 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 3 ms 2764 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct
16 Correct 3 ms 2764 KB Output is correct
17 Correct 4 ms 2764 KB Output is correct
18 Correct 3 ms 2764 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 2 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 2 ms 2764 KB Output is correct
26 Correct 33 ms 3532 KB Output is correct
27 Correct 49 ms 4988 KB Output is correct
28 Correct 112 ms 4960 KB Output is correct
29 Correct 698 ms 5020 KB Output is correct
30 Correct 765 ms 5004 KB Output is correct
31 Correct 47 ms 5060 KB Output is correct
32 Correct 4 ms 2868 KB Output is correct
33 Correct 95 ms 3952 KB Output is correct
34 Correct 108 ms 5088 KB Output is correct
35 Correct 22 ms 3020 KB Output is correct
36 Correct 73 ms 4272 KB Output is correct
37 Correct 116 ms 4884 KB Output is correct
38 Correct 104 ms 4940 KB Output is correct
39 Correct 24 ms 3764 KB Output is correct
40 Correct 5 ms 2892 KB Output is correct
41 Correct 1161 ms 7116 KB Output is correct
42 Correct 214 ms 7372 KB Output is correct
43 Correct 572 ms 7128 KB Output is correct
44 Correct 212 ms 7236 KB Output is correct
45 Correct 123 ms 7536 KB Output is correct
46 Correct 1304 ms 7396 KB Output is correct
47 Correct 112 ms 7236 KB Output is correct
48 Correct 409 ms 7232 KB Output is correct
49 Correct 204 ms 7064 KB Output is correct
50 Execution timed out 2081 ms 7216 KB Time limit exceeded
51 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 1 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 1 ms 2764 KB Output is correct
7 Correct 1 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 72 ms 5676 KB Output is correct
10 Correct 18 ms 3572 KB Output is correct
11 Correct 53 ms 5692 KB Output is correct
12 Correct 33 ms 4100 KB Output is correct
13 Correct 62 ms 5392 KB Output is correct
14 Correct 40 ms 4684 KB Output is correct
15 Correct 11 ms 3404 KB Output is correct
16 Correct 59 ms 4800 KB Output is correct
17 Correct 90 ms 5716 KB Output is correct
18 Correct 52 ms 5060 KB Output is correct
19 Correct 2 ms 2764 KB Output is correct
20 Correct 2 ms 2836 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 3 ms 2764 KB Output is correct
23 Correct 2 ms 2764 KB Output is correct
24 Correct 3 ms 2764 KB Output is correct
25 Correct 4 ms 2764 KB Output is correct
26 Correct 3 ms 2764 KB Output is correct
27 Correct 2 ms 2764 KB Output is correct
28 Correct 2 ms 2764 KB Output is correct
29 Correct 2 ms 2764 KB Output is correct
30 Correct 2 ms 2764 KB Output is correct
31 Correct 3 ms 2764 KB Output is correct
32 Correct 3 ms 2764 KB Output is correct
33 Correct 2 ms 2764 KB Output is correct
34 Correct 33 ms 3532 KB Output is correct
35 Correct 49 ms 4988 KB Output is correct
36 Correct 112 ms 4960 KB Output is correct
37 Correct 698 ms 5020 KB Output is correct
38 Correct 765 ms 5004 KB Output is correct
39 Correct 47 ms 5060 KB Output is correct
40 Correct 4 ms 2868 KB Output is correct
41 Correct 95 ms 3952 KB Output is correct
42 Correct 108 ms 5088 KB Output is correct
43 Correct 22 ms 3020 KB Output is correct
44 Correct 73 ms 4272 KB Output is correct
45 Correct 116 ms 4884 KB Output is correct
46 Correct 104 ms 4940 KB Output is correct
47 Correct 24 ms 3764 KB Output is correct
48 Correct 5 ms 2892 KB Output is correct
49 Correct 1161 ms 7116 KB Output is correct
50 Correct 214 ms 7372 KB Output is correct
51 Correct 572 ms 7128 KB Output is correct
52 Correct 212 ms 7236 KB Output is correct
53 Correct 123 ms 7536 KB Output is correct
54 Correct 1304 ms 7396 KB Output is correct
55 Correct 112 ms 7236 KB Output is correct
56 Correct 409 ms 7232 KB Output is correct
57 Correct 204 ms 7064 KB Output is correct
58 Execution timed out 2081 ms 7216 KB Time limit exceeded
59 Halted 0 ms 0 KB -