oj.uz

Submission #1108858

# Submission time Handle Problem Language Result Execution time Memory
1108858 2024-11-05T11:44:59 Z AverageAmogusEnjoyer Joker (BOI20_joker) C++17
41 / 100
 483 ms 26020 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), swap(cx,cy);
        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);
    }
    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 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2808 KB Output is correct
7 Correct 2 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2640 KB Output is correct
11 Correct 2 ms 2640 KB Output is correct
12 Correct 2 ms 2640 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 2 ms 2640 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 1 ms 2640 KB Output is correct
20 Correct 2 ms 2808 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 2 ms 2808 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 2668 KB Output is correct
28 Correct 2 ms 2640 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2808 KB Output is correct
7 Correct 2 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2640 KB Output is correct
11 Correct 2 ms 2640 KB Output is correct
12 Correct 2 ms 2640 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 2 ms 2640 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 1 ms 2640 KB Output is correct
20 Correct 2 ms 2808 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 2 ms 2808 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 2668 KB Output is correct
28 Correct 2 ms 2640 KB Output is correct
29 Correct 9 ms 3064 KB Output is correct
30 Correct 7 ms 2896 KB Output is correct
31 Correct 6 ms 3068 KB Output is correct
32 Correct 5 ms 2896 KB Output is correct
33 Correct 4 ms 2896 KB Output is correct
34 Correct 6 ms 2896 KB Output is correct
35 Correct 7 ms 2896 KB Output is correct
36 Correct 5 ms 2896 KB Output is correct
37 Incorrect 6 ms 2896 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 160 ms 16316 KB Output is correct
4 Correct 164 ms 26020 KB Output is correct
5 Correct 170 ms 18872 KB Output is correct
6 Correct 175 ms 16316 KB Output is correct
7 Correct 169 ms 16316 KB Output is correct
8 Correct 146 ms 16316 KB Output is correct
9 Correct 150 ms 16316 KB Output is correct
10 Correct 148 ms 16292 KB Output is correct
11 Correct 155 ms 16316 KB Output is correct
12 Correct 159 ms 16316 KB Output is correct
13 Correct 157 ms 16288 KB Output is correct
14 Correct 170 ms 16280 KB Output is correct
15 Correct 163 ms 16328 KB Output is correct
16 Correct 165 ms 16292 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2808 KB Output is correct
7 Correct 2 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2640 KB Output is correct
11 Correct 2 ms 2640 KB Output is correct
12 Correct 2 ms 2640 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 2 ms 2640 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 1 ms 2640 KB Output is correct
20 Correct 2 ms 2808 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 2 ms 2808 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 2668 KB Output is correct
28 Correct 2 ms 2640 KB Output is correct
29 Correct 160 ms 16316 KB Output is correct
30 Correct 164 ms 26020 KB Output is correct
31 Correct 170 ms 18872 KB Output is correct
32 Correct 175 ms 16316 KB Output is correct
33 Correct 169 ms 16316 KB Output is correct
34 Correct 146 ms 16316 KB Output is correct
35 Correct 150 ms 16316 KB Output is correct
36 Correct 148 ms 16292 KB Output is correct
37 Correct 155 ms 16316 KB Output is correct
38 Correct 159 ms 16316 KB Output is correct
39 Correct 157 ms 16288 KB Output is correct
40 Correct 170 ms 16280 KB Output is correct
41 Correct 163 ms 16328 KB Output is correct
42 Correct 165 ms 16292 KB Output is correct
43 Correct 399 ms 16228 KB Output is correct
44 Correct 443 ms 26016 KB Output is correct
45 Correct 445 ms 19384 KB Output is correct
46 Correct 331 ms 16292 KB Output is correct
47 Correct 368 ms 16232 KB Output is correct
48 Correct 197 ms 16292 KB Output is correct
49 Correct 208 ms 16216 KB Output is correct
50 Correct 386 ms 16220 KB Output is correct
51 Correct 394 ms 16312 KB Output is correct
52 Correct 382 ms 16564 KB Output is correct
53 Correct 464 ms 16312 KB Output is correct
54 Correct 422 ms 16212 KB Output is correct
55 Correct 429 ms 16312 KB Output is correct
56 Correct 483 ms 16300 KB Output is correct

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2808 KB Output is correct
7 Correct 2 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2640 KB Output is correct
11 Correct 2 ms 2640 KB Output is correct
12 Correct 2 ms 2640 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 2 ms 2640 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 1 ms 2640 KB Output is correct
20 Correct 2 ms 2808 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 2 ms 2808 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 2668 KB Output is correct
28 Correct 2 ms 2640 KB Output is correct
29 Correct 9 ms 3064 KB Output is correct
30 Correct 7 ms 2896 KB Output is correct
31 Correct 6 ms 3068 KB Output is correct
32 Correct 5 ms 2896 KB Output is correct
33 Correct 4 ms 2896 KB Output is correct
34 Correct 6 ms 2896 KB Output is correct
35 Correct 7 ms 2896 KB Output is correct
36 Correct 5 ms 2896 KB Output is correct
37 Incorrect 6 ms 2896 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2808 KB Output is correct
7 Correct 2 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2640 KB Output is correct
11 Correct 2 ms 2640 KB Output is correct
12 Correct 2 ms 2640 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 2 ms 2640 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 1 ms 2640 KB Output is correct
20 Correct 2 ms 2808 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 2 ms 2808 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 2668 KB Output is correct
28 Correct 2 ms 2640 KB Output is correct
29 Correct 9 ms 3064 KB Output is correct
30 Correct 7 ms 2896 KB Output is correct
31 Correct 6 ms 3068 KB Output is correct
32 Correct 5 ms 2896 KB Output is correct
33 Correct 4 ms 2896 KB Output is correct
34 Correct 6 ms 2896 KB Output is correct
35 Correct 7 ms 2896 KB Output is correct
36 Correct 5 ms 2896 KB Output is correct
37 Incorrect 6 ms 2896 KB Output isn't correct
38 Halted 0 ms 0 KB -