oj.uz

Submission #1108864

# Submission time Handle Problem Language Result Execution time Memory
1108864 2024-11-05T12:14:18 Z AverageAmogusEnjoyer Joker (BOI20_joker) C++17
71 / 100
 2000 ms 24904 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> bool cmin(T &i, T j) { return i > j ? i=j,true:false; }
template<class T> bool cmax(T &i, T j) { return i < j ? i=j,true:false; }

constexpr int nax = 200200,block_size = 450;
vector<tuple<int,int,int>> queries[block_size]; // r,l,idx
vector<bool> ans;
int edges[nax][2];
int n,m;

struct dsu_save {
    int x,y,lzx,lzy,szx,szy,parx,pary;
    dsu_save(int x,int y,int lzx,int lzy,int szx,int szy,int parx,int pary): x(x), y(y), lzx(lzx), lzy(lzy), szx(szx), szy(szy), parx(parx), pary(pary) {}
    void print() {
        cout << "x: " << x + 1 << endl;
        cout << "y: " << y + 1 << endl;
        cout << "lzx: " << lzx << ", lzy: " << lzy << ", szx: " << szx << ", szy: " << szy << ", parx: " << parx << ", pary: " << pary << endl;
    }
};

struct DSU {
    int lz[nax];
    int par[nax];
    int sz[nax];
    stack<dsu_save> stk;
    DSU(int N) {
        for (int i = 0; i < N; i++)
            lz[i] = 0, par[i] = i, sz[i] = 1;
    }
    int get(int x,int &cx) {
        cx ^= lz[x];
        return (x == par[x] ? x : get(par[x],cx));
    }
    bool need_reset = 0;
    bool unite(int x,int y) {
        assert(!need_reset);

        // cout << "Adding edge: " << x + 1 << " " << y + 1 << endl;

        int cx = 0,cy = 0;
        int px = get(x,cx), py = get(y,cy);

        // cout << px + 1 << " " << py + 1 << " " << cx << " " << cy << endl;
        if (sz[px] < sz[py]) 
            swap(px,py);
        stk.emplace(px,py,lz[px],lz[py],sz[px],sz[py],par[px],par[py]);
        if (cx == cy) {
            if (px == py) {
                need_reset = 1;
                return 1;
            } else {
                lz[py] ^= 1;
                sz[px] += sz[py];
                par[py] = px;
            }
        } else {
            if (px != py) {
                sz[px] += sz[py];
                par[py] = px;
            }
        }
        return 0;
    }
    void rollback(int k) {
        need_reset = 0;
        // do stuff
        assert(stk.size() >= k);
        while(k--) {
            auto c = stk.top(); stk.pop();
            // c.print();
            lz[c.x] = c.lzx,lz[c.y] = c.lzy,par[c.x] = c.parx,par[c.y] = c.pary,sz[c.x] = c.szx,sz[c.y] = c.szy;
        }
    }
};

DSU dsu(nax); 

bool solve_block(int block) {
    int current_r = m - 1;
    for (int i = max(0,(block - 1) * block_size); i < min(m,block * block_size); i++) {
        // cout << "edge index: " << i + 1 << endl;
        if (dsu.unite(edges[i][0],edges[i][1])) {
            for (int B = block; B < block_size; B++) 
                for (auto &[r,l,idx]: queries[B])
                    ans[idx] = 1;
            return 1;
        }
    }
    for (int i = 0; i < queries[block].size(); i++) {
        auto &[r,l,idx] = queries[block][i];
        while(current_r >= r) {
            // cout << "edge index: " << current_r + 1 << endl;
            if (dsu.unite(edges[current_r][0],edges[current_r][1])) {
                for (int j = i; j < queries[block].size(); j++) {
                    int idx2 = get<2>(queries[block][j]);
                    ans[idx2] = 1;
                }
                dsu.rollback(m - current_r); // potrebbero essere necessari dei +- 1
                return 0;
            }
            current_r--;
        }
        --l;
        int inserted = 0;
        while(l >= block * block_size) {
            // devo inserirlo
            inserted++;
            // cout << "edge index: " << l + 1 << endl;
            if (dsu.unite(edges[l][0],edges[l][1])) {
                ans[idx] = 1;
                break;
            }
            l--;
        }
        dsu.rollback(inserted);
    }
    dsu.rollback(m - current_r - 1);
    return 0;
}

vector<bool> trova_cicli(int N, int M, int Q, vector<int> A, vector<int> B, vector<int> L, vector<int> R) {
    n = N, m = M;
    for (int i = 0; i < M; i++)
        edges[i][0] = A[i],edges[i][1] = B[i];
    ans.resize(Q);
    for (int i = 0; i < Q; i++) 
        queries[L[i] / block_size].emplace_back(R[i],L[i],i);
    for (int i = 0; i < block_size; i++) 
        sort(queries[i].rbegin(),queries[i].rend());
    for (int i = 0; i < block_size; i++) 
        if (solve_block(i))
            break;
    return ans;
}

int main() {

    int N,M,Q;
    cin >> N >> M >> Q;
    vector<int> A(M),B(M),L(Q),R(Q);
    for (int i = 0; i < M; i++) {
        cin >> A[i] >> B[i];
        --A[i],--B[i];
    }
    for (int i = 0; i < Q; i++) {
        cin >> L[i] >> R[i];
        --L[i];
    }
    auto res = trova_cicli(N,M,Q,A,B,L,R);
    for (int i = 0; i < Q; i++) 
        cout << (res[i] ? "YES" : "NO") << "\n";

}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from Joker.cpp:1:
Joker.cpp: In member function 'void DSU::rollback(int)':
Joker.cpp:69:27: warning: comparison of integer expressions of different signedness: 'std::stack<dsu_save>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   69 |         assert(stk.size() >= k);
      |                ~~~~~~~~~~~^~~~
Joker.cpp: In function 'bool solve_block(int)':
Joker.cpp:91:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     for (int i = 0; i < queries[block].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:96:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |                 for (int j = i; j < queries[block].size(); j++) {
      |                                 ~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 2 ms 2664 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 2 ms 2808 KB Output is correct
8 Correct 2 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2808 KB Output is correct
11 Correct 2 ms 2640 KB Output is correct
12 Correct 2 ms 2820 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 2 ms 2640 KB Output is correct
15 Correct 2 ms 2640 KB Output is correct
16 Correct 2 ms 2640 KB Output is correct
17 Correct 1 ms 2640 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 2 ms 2640 KB Output is correct
20 Correct 1 ms 2640 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 2 ms 2640 KB Output is correct
23 Correct 2 ms 2640 KB Output is correct
24 Correct 2 ms 2640 KB Output is correct
25 Correct 2 ms 2640 KB Output is correct
26 Correct 2 ms 2640 KB Output is correct
27 Correct 2 ms 2808 KB Output is correct
28 Correct 2 ms 2640 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 2 ms 2664 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 2 ms 2808 KB Output is correct
8 Correct 2 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2808 KB Output is correct
11 Correct 2 ms 2640 KB Output is correct
12 Correct 2 ms 2820 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 2 ms 2640 KB Output is correct
15 Correct 2 ms 2640 KB Output is correct
16 Correct 2 ms 2640 KB Output is correct
17 Correct 1 ms 2640 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 2 ms 2640 KB Output is correct
20 Correct 1 ms 2640 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 2 ms 2640 KB Output is correct
23 Correct 2 ms 2640 KB Output is correct
24 Correct 2 ms 2640 KB Output is correct
25 Correct 2 ms 2640 KB Output is correct
26 Correct 2 ms 2640 KB Output is correct
27 Correct 2 ms 2808 KB Output is correct
28 Correct 2 ms 2640 KB Output is correct
29 Correct 9 ms 2896 KB Output is correct
30 Correct 7 ms 2896 KB Output is correct
31 Correct 5 ms 2896 KB Output is correct
32 Correct 4 ms 2896 KB Output is correct
33 Correct 4 ms 2896 KB Output is correct
34 Correct 5 ms 2896 KB Output is correct
35 Correct 6 ms 3064 KB Output is correct
36 Correct 5 ms 2896 KB Output is correct
37 Correct 9 ms 2896 KB Output is correct
38 Correct 10 ms 2896 KB Output is correct
39 Correct 8 ms 2896 KB Output is correct
40 Correct 5 ms 2924 KB Output is correct
41 Correct 5 ms 2800 KB Output is correct
42 Correct 5 ms 2896 KB Output is correct
43 Correct 3 ms 2896 KB Output is correct
44 Correct 3 ms 2896 KB Output is correct
45 Correct 3 ms 2924 KB Output is correct
46 Correct 4 ms 2896 KB Output is correct
47 Correct 6 ms 2868 KB Output is correct
48 Correct 6 ms 2896 KB Output is correct
49 Correct 6 ms 2896 KB Output is correct
50 Correct 6 ms 2896 KB Output is correct
51 Correct 5 ms 2972 KB Output is correct
52 Correct 6 ms 2896 KB Output is correct
53 Correct 6 ms 2896 KB Output is correct
54 Correct 7 ms 2896 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 163 ms 16316 KB Output is correct
4 Correct 184 ms 19384 KB Output is correct
5 Correct 171 ms 18872 KB Output is correct
6 Correct 167 ms 16316 KB Output is correct
7 Correct 163 ms 16292 KB Output is correct
8 Correct 156 ms 16316 KB Output is correct
9 Correct 151 ms 16288 KB Output is correct
10 Correct 172 ms 16316 KB Output is correct
11 Correct 165 ms 16316 KB Output is correct
12 Correct 165 ms 16316 KB Output is correct
13 Correct 161 ms 16284 KB Output is correct
14 Correct 165 ms 16292 KB Output is correct
15 Correct 159 ms 16292 KB Output is correct
16 Correct 172 ms 16316 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 2 ms 2664 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 2 ms 2808 KB Output is correct
8 Correct 2 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2808 KB Output is correct
11 Correct 2 ms 2640 KB Output is correct
12 Correct 2 ms 2820 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 2 ms 2640 KB Output is correct
15 Correct 2 ms 2640 KB Output is correct
16 Correct 2 ms 2640 KB Output is correct
17 Correct 1 ms 2640 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 2 ms 2640 KB Output is correct
20 Correct 1 ms 2640 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 2 ms 2640 KB Output is correct
23 Correct 2 ms 2640 KB Output is correct
24 Correct 2 ms 2640 KB Output is correct
25 Correct 2 ms 2640 KB Output is correct
26 Correct 2 ms 2640 KB Output is correct
27 Correct 2 ms 2808 KB Output is correct
28 Correct 2 ms 2640 KB Output is correct
29 Correct 163 ms 16316 KB Output is correct
30 Correct 184 ms 19384 KB Output is correct
31 Correct 171 ms 18872 KB Output is correct
32 Correct 167 ms 16316 KB Output is correct
33 Correct 163 ms 16292 KB Output is correct
34 Correct 156 ms 16316 KB Output is correct
35 Correct 151 ms 16288 KB Output is correct
36 Correct 172 ms 16316 KB Output is correct
37 Correct 165 ms 16316 KB Output is correct
38 Correct 165 ms 16316 KB Output is correct
39 Correct 161 ms 16284 KB Output is correct
40 Correct 165 ms 16292 KB Output is correct
41 Correct 159 ms 16292 KB Output is correct
42 Correct 172 ms 16316 KB Output is correct
43 Correct 385 ms 16320 KB Output is correct
44 Correct 417 ms 19384 KB Output is correct
45 Correct 427 ms 19388 KB Output is correct
46 Correct 342 ms 16312 KB Output is correct
47 Correct 366 ms 16212 KB Output is correct
48 Correct 187 ms 16308 KB Output is correct
49 Correct 212 ms 16312 KB Output is correct
50 Correct 378 ms 16312 KB Output is correct
51 Correct 381 ms 16292 KB Output is correct
52 Correct 388 ms 16568 KB Output is correct
53 Correct 414 ms 16212 KB Output is correct
54 Correct 420 ms 16296 KB Output is correct
55 Correct 453 ms 16288 KB Output is correct
56 Correct 447 ms 16312 KB Output is correct

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 2 ms 2664 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 2 ms 2808 KB Output is correct
8 Correct 2 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2808 KB Output is correct
11 Correct 2 ms 2640 KB Output is correct
12 Correct 2 ms 2820 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 2 ms 2640 KB Output is correct
15 Correct 2 ms 2640 KB Output is correct
16 Correct 2 ms 2640 KB Output is correct
17 Correct 1 ms 2640 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 2 ms 2640 KB Output is correct
20 Correct 1 ms 2640 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 2 ms 2640 KB Output is correct
23 Correct 2 ms 2640 KB Output is correct
24 Correct 2 ms 2640 KB Output is correct
25 Correct 2 ms 2640 KB Output is correct
26 Correct 2 ms 2640 KB Output is correct
27 Correct 2 ms 2808 KB Output is correct
28 Correct 2 ms 2640 KB Output is correct
29 Correct 9 ms 2896 KB Output is correct
30 Correct 7 ms 2896 KB Output is correct
31 Correct 5 ms 2896 KB Output is correct
32 Correct 4 ms 2896 KB Output is correct
33 Correct 4 ms 2896 KB Output is correct
34 Correct 5 ms 2896 KB Output is correct
35 Correct 6 ms 3064 KB Output is correct
36 Correct 5 ms 2896 KB Output is correct
37 Correct 9 ms 2896 KB Output is correct
38 Correct 10 ms 2896 KB Output is correct
39 Correct 8 ms 2896 KB Output is correct
40 Correct 5 ms 2924 KB Output is correct
41 Correct 5 ms 2800 KB Output is correct
42 Correct 5 ms 2896 KB Output is correct
43 Correct 3 ms 2896 KB Output is correct
44 Correct 3 ms 2896 KB Output is correct
45 Correct 3 ms 2924 KB Output is correct
46 Correct 4 ms 2896 KB Output is correct
47 Correct 6 ms 2868 KB Output is correct
48 Correct 6 ms 2896 KB Output is correct
49 Correct 6 ms 2896 KB Output is correct
50 Correct 6 ms 2896 KB Output is correct
51 Correct 5 ms 2972 KB Output is correct
52 Correct 6 ms 2896 KB Output is correct
53 Correct 6 ms 2896 KB Output is correct
54 Correct 7 ms 2896 KB Output is correct
55 Correct 383 ms 13180 KB Output is correct
56 Correct 1431 ms 16676 KB Output is correct
57 Correct 105 ms 15944 KB Output is correct
58 Correct 82 ms 13128 KB Output is correct
59 Correct 185 ms 13128 KB Output is correct
60 Correct 395 ms 13128 KB Output is correct
61 Correct 228 ms 13128 KB Output is correct
62 Correct 420 ms 13628 KB Output is correct
63 Correct 114 ms 12936 KB Output is correct
64 Correct 242 ms 13128 KB Output is correct
65 Correct 438 ms 13128 KB Output is correct

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 2 ms 2664 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 2 ms 2808 KB Output is correct
8 Correct 2 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2808 KB Output is correct
11 Correct 2 ms 2640 KB Output is correct
12 Correct 2 ms 2820 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 2 ms 2640 KB Output is correct
15 Correct 2 ms 2640 KB Output is correct
16 Correct 2 ms 2640 KB Output is correct
17 Correct 1 ms 2640 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 2 ms 2640 KB Output is correct
20 Correct 1 ms 2640 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 2 ms 2640 KB Output is correct
23 Correct 2 ms 2640 KB Output is correct
24 Correct 2 ms 2640 KB Output is correct
25 Correct 2 ms 2640 KB Output is correct
26 Correct 2 ms 2640 KB Output is correct
27 Correct 2 ms 2808 KB Output is correct
28 Correct 2 ms 2640 KB Output is correct
29 Correct 9 ms 2896 KB Output is correct
30 Correct 7 ms 2896 KB Output is correct
31 Correct 5 ms 2896 KB Output is correct
32 Correct 4 ms 2896 KB Output is correct
33 Correct 4 ms 2896 KB Output is correct
34 Correct 5 ms 2896 KB Output is correct
35 Correct 6 ms 3064 KB Output is correct
36 Correct 5 ms 2896 KB Output is correct
37 Correct 9 ms 2896 KB Output is correct
38 Correct 10 ms 2896 KB Output is correct
39 Correct 8 ms 2896 KB Output is correct
40 Correct 5 ms 2924 KB Output is correct
41 Correct 5 ms 2800 KB Output is correct
42 Correct 5 ms 2896 KB Output is correct
43 Correct 3 ms 2896 KB Output is correct
44 Correct 3 ms 2896 KB Output is correct
45 Correct 3 ms 2924 KB Output is correct
46 Correct 4 ms 2896 KB Output is correct
47 Correct 6 ms 2868 KB Output is correct
48 Correct 6 ms 2896 KB Output is correct
49 Correct 6 ms 2896 KB Output is correct
50 Correct 6 ms 2896 KB Output is correct
51 Correct 5 ms 2972 KB Output is correct
52 Correct 6 ms 2896 KB Output is correct
53 Correct 6 ms 2896 KB Output is correct
54 Correct 7 ms 2896 KB Output is correct
55 Correct 163 ms 16316 KB Output is correct
56 Correct 184 ms 19384 KB Output is correct
57 Correct 171 ms 18872 KB Output is correct
58 Correct 167 ms 16316 KB Output is correct
59 Correct 163 ms 16292 KB Output is correct
60 Correct 156 ms 16316 KB Output is correct
61 Correct 151 ms 16288 KB Output is correct
62 Correct 172 ms 16316 KB Output is correct
63 Correct 165 ms 16316 KB Output is correct
64 Correct 165 ms 16316 KB Output is correct
65 Correct 161 ms 16284 KB Output is correct
66 Correct 165 ms 16292 KB Output is correct
67 Correct 159 ms 16292 KB Output is correct
68 Correct 172 ms 16316 KB Output is correct
69 Correct 385 ms 16320 KB Output is correct
70 Correct 417 ms 19384 KB Output is correct
71 Correct 427 ms 19388 KB Output is correct
72 Correct 342 ms 16312 KB Output is correct
73 Correct 366 ms 16212 KB Output is correct
74 Correct 187 ms 16308 KB Output is correct
75 Correct 212 ms 16312 KB Output is correct
76 Correct 378 ms 16312 KB Output is correct
77 Correct 381 ms 16292 KB Output is correct
78 Correct 388 ms 16568 KB Output is correct
79 Correct 414 ms 16212 KB Output is correct
80 Correct 420 ms 16296 KB Output is correct
81 Correct 453 ms 16288 KB Output is correct
82 Correct 447 ms 16312 KB Output is correct
83 Correct 383 ms 13180 KB Output is correct
84 Correct 1431 ms 16676 KB Output is correct
85 Correct 105 ms 15944 KB Output is correct
86 Correct 82 ms 13128 KB Output is correct
87 Correct 185 ms 13128 KB Output is correct
88 Correct 395 ms 13128 KB Output is correct
89 Correct 228 ms 13128 KB Output is correct
90 Correct 420 ms 13628 KB Output is correct
91 Correct 114 ms 12936 KB Output is correct
92 Correct 242 ms 13128 KB Output is correct
93 Correct 438 ms 13128 KB Output is correct
94 Correct 758 ms 21608 KB Output is correct
95 Execution timed out 2061 ms 24904 KB Time limit exceeded
96 Halted 0 ms 0 KB -