oj.uz

Submission #1047726

# Submission time Handle Problem Language Result Execution time Memory
1047726 2024-08-07T15:21:57 Z Lobo Joker (BOI20_joker) C++17
100 / 100
 158 ms 13248 KB 
#include<bits/stdc++.h>
using namespace std;
const long long inf = 1e9 + 10;
// #define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const int maxn = 2e5+10;
// L,R
// (1,L) + (R,M)
// (L+1,R-1)

int n, m, q, isbip = 1, dsz[maxn], ans[maxn];
pair<int,int> ds[maxn], edg[maxn];
vector<pair<pair<int,int>,int>> roll;

pair<int,int> find(int u) {
    if(ds[u].fr == u) return mp(u,0);
    auto aux = find(ds[u].fr);
    return mp(aux.fr,(ds[u].sc^aux.sc));
}
void add(int i) {
    if(i == 0 or i == m+1) {
        roll.pb(mp(mp(0,0),0));
        return;
    }
    int u = edg[i].fr;
    auto auxu = find(u);
    u = auxu.fr;
    int paru = auxu.sc;

    int v = edg[i].sc;
    auto auxv = find(v);
    v = auxv.fr;
    int parv = auxv.sc;
    
    if(u == v && paru == parv) {
        roll.pb(mp(mp(u,v),isbip));
        isbip = 0;
    }
    else if(u != v) {
        if(dsz[u] < dsz[v]) {
            swap(u,v);
            swap(paru,parv);
        }
        roll.pb(mp(mp(u,v),isbip));
        dsz[u]+= dsz[v];
        ds[v].fr = u;
        ds[v].sc = (1^paru^parv);
    }
    else {
        roll.pb(mp(mp(u,v),isbip));
    }
}

void rollback() {
    assert(roll.size());
    if(roll.back().fr.fr == 0) {
        roll.pop_back();
        return;
    }
    int u = roll.back().fr.fr;
    int v = roll.back().fr.sc;
    isbip = roll.back().sc;
    roll.pop_back();
    if(u == v) return;
    ds[u] = mp(u,0);
    ds[v] = mp(v,0);
    dsz[u]-= dsz[v];
}

// pra cada l, eu vejo qual o menor r em que
// cada l, min r -> (1,l) + (r,m) eh bipartido
// comeca sendo 0 m 1 m+1
// (5,7,1,2) pode acontecer (da certo pra tudo)

void sol(int l1, int l2, int r1, int r2) {
    if(l1 > l2) return;
    int l = (l1+l2)/2;
    for(int i = l1+1; i <= l; i++) {
        add(i);
    }
    if(isbip == false) {
        for(int i = l; i <= l2; i++) {
            ans[i] = inf;
        }
        for(int i = l; i >= l1+1; i--) {
            rollback();
        }
        sol(l1,l-1,r1,r2);
        return;
    }
    int r = r2;
    if(isbip == true) {
        while(r-1 >= r1) {
            r--;
            add(r);
            if(isbip == false) {
                rollback();
                r++;
                break;
            }
        }
    }
    ans[l] = r;
    int R = r;
    while(r != r2) {
        r++;
        rollback();
    }
    // r = r2
    add(l+1);
    sol(l+1,l2,R,r2);
    for(int i = l+1; i >= l1+1; i--) {
        rollback();
    }
    while(r != R) {
        r--;
        add(r);
    }
    // r = R
    sol(l1,l-1,r1,R);

    while(r != r2) {
        r++;
        rollback();
    }
    // r = r2
}

void solve() {
    cin >> n >> m >> q;

    for(int i = 1; i <= n; i++) {
        ds[i] = mp(i,0);
        dsz[i] = 1;
    }

    for(int i = 1; i <= m; i++) {
        int u,v;
        cin >> u >> v;
        edg[i] = mp(u,v);
    }
    
    isbip = 1;
    roll.pb(mp(mp(0,0),0));
    roll.pb(mp(mp(0,0),0));
    sol(0,m,1,m+1);
    for(int i = 1; i <= q; i++) {
        int l,r;
        cin >> l >> r;
        if(ans[l-1] <= r+1) {
            cout << "NO" << endl;
        }
        else {
            cout << "YES" << endl;
        }
    }
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    #ifndef ONLINE_JUDGE
    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    #endif

    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
    }

}

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 0 ms 4444 KB Output is correct
3 Correct 103 ms 7948 KB Output is correct
4 Correct 148 ms 12232 KB Output is correct
5 Correct 67 ms 8908 KB Output is correct
6 Correct 65 ms 8900 KB Output is correct
7 Correct 69 ms 7876 KB Output is correct
8 Correct 76 ms 8912 KB Output is correct
9 Correct 83 ms 9252 KB Output is correct
10 Correct 106 ms 8904 KB Output is correct
11 Correct 83 ms 7884 KB Output is correct
12 Correct 90 ms 8144 KB Output is correct
13 Correct 88 ms 7884 KB Output is correct
14 Correct 79 ms 7876 KB Output is correct
15 Correct 125 ms 8644 KB Output is correct
16 Correct 108 ms 8132 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 0 ms 4444 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 0 ms 4444 KB Output is correct
6 Correct 0 ms 4444 KB Output is correct
7 Correct 0 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 0 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 0 ms 4444 KB Output is correct
13 Correct 0 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 0 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 0 ms 4444 KB Output is correct
18 Correct 0 ms 4444 KB Output is correct
19 Correct 0 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 0 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 0 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 103 ms 7948 KB Output is correct
30 Correct 148 ms 12232 KB Output is correct
31 Correct 67 ms 8908 KB Output is correct
32 Correct 65 ms 8900 KB Output is correct
33 Correct 69 ms 7876 KB Output is correct
34 Correct 76 ms 8912 KB Output is correct
35 Correct 83 ms 9252 KB Output is correct
36 Correct 106 ms 8904 KB Output is correct
37 Correct 83 ms 7884 KB Output is correct
38 Correct 90 ms 8144 KB Output is correct
39 Correct 88 ms 7884 KB Output is correct
40 Correct 79 ms 7876 KB Output is correct
41 Correct 125 ms 8644 KB Output is correct
42 Correct 108 ms 8132 KB Output is correct
43 Correct 95 ms 8900 KB Output is correct
44 Correct 149 ms 13248 KB Output is correct
45 Correct 115 ms 9160 KB Output is correct
46 Correct 72 ms 9168 KB Output is correct
47 Correct 65 ms 7880 KB Output is correct
48 Correct 95 ms 8472 KB Output is correct
49 Correct 109 ms 8144 KB Output is correct
50 Correct 88 ms 8400 KB Output is correct
51 Correct 89 ms 8144 KB Output is correct
52 Correct 124 ms 8136 KB Output is correct
53 Correct 88 ms 7880 KB Output is correct
54 Correct 118 ms 7880 KB Output is correct
55 Correct 129 ms 8904 KB Output is correct
56 Correct 115 ms 9168 KB Output is correct

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 0 ms 4444 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 0 ms 4444 KB Output is correct
6 Correct 0 ms 4444 KB Output is correct
7 Correct 0 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 0 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 0 ms 4444 KB Output is correct
13 Correct 0 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 0 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 0 ms 4444 KB Output is correct
18 Correct 0 ms 4444 KB Output is correct
19 Correct 0 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 0 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 0 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4440 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 2 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4444 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 2 ms 4444 KB Output is correct
44 Correct 1 ms 4440 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Correct 1 ms 4444 KB Output is correct
47 Correct 1 ms 4444 KB Output is correct
48 Correct 1 ms 4444 KB Output is correct
49 Correct 1 ms 4444 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct
51 Correct 2 ms 4444 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 2 ms 4444 KB Output is correct
54 Correct 2 ms 4444 KB Output is correct
55 Correct 91 ms 7880 KB Output is correct
56 Correct 158 ms 12228 KB Output is correct
57 Correct 46 ms 9036 KB Output is correct
58 Correct 47 ms 8392 KB Output is correct
59 Correct 74 ms 7944 KB Output is correct
60 Correct 120 ms 8656 KB Output is correct
61 Correct 98 ms 8904 KB Output is correct
62 Correct 77 ms 8144 KB Output is correct
63 Correct 65 ms 8644 KB Output is correct
64 Correct 98 ms 7884 KB Output is correct
65 Correct 89 ms 8208 KB Output is correct

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 0 ms 4444 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 0 ms 4444 KB Output is correct
6 Correct 0 ms 4444 KB Output is correct
7 Correct 0 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 0 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 0 ms 4444 KB Output is correct
13 Correct 0 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 0 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 0 ms 4444 KB Output is correct
18 Correct 0 ms 4444 KB Output is correct
19 Correct 0 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 0 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 0 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4440 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 2 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4444 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 2 ms 4444 KB Output is correct
44 Correct 1 ms 4440 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Correct 1 ms 4444 KB Output is correct
47 Correct 1 ms 4444 KB Output is correct
48 Correct 1 ms 4444 KB Output is correct
49 Correct 1 ms 4444 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct
51 Correct 2 ms 4444 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 2 ms 4444 KB Output is correct
54 Correct 2 ms 4444 KB Output is correct
55 Correct 103 ms 7948 KB Output is correct
56 Correct 148 ms 12232 KB Output is correct
57 Correct 67 ms 8908 KB Output is correct
58 Correct 65 ms 8900 KB Output is correct
59 Correct 69 ms 7876 KB Output is correct
60 Correct 76 ms 8912 KB Output is correct
61 Correct 83 ms 9252 KB Output is correct
62 Correct 106 ms 8904 KB Output is correct
63 Correct 83 ms 7884 KB Output is correct
64 Correct 90 ms 8144 KB Output is correct
65 Correct 88 ms 7884 KB Output is correct
66 Correct 79 ms 7876 KB Output is correct
67 Correct 125 ms 8644 KB Output is correct
68 Correct 108 ms 8132 KB Output is correct
69 Correct 95 ms 8900 KB Output is correct
70 Correct 149 ms 13248 KB Output is correct
71 Correct 115 ms 9160 KB Output is correct
72 Correct 72 ms 9168 KB Output is correct
73 Correct 65 ms 7880 KB Output is correct
74 Correct 95 ms 8472 KB Output is correct
75 Correct 109 ms 8144 KB Output is correct
76 Correct 88 ms 8400 KB Output is correct
77 Correct 89 ms 8144 KB Output is correct
78 Correct 124 ms 8136 KB Output is correct
79 Correct 88 ms 7880 KB Output is correct
80 Correct 118 ms 7880 KB Output is correct
81 Correct 129 ms 8904 KB Output is correct
82 Correct 115 ms 9168 KB Output is correct
83 Correct 91 ms 7880 KB Output is correct
84 Correct 158 ms 12228 KB Output is correct
85 Correct 46 ms 9036 KB Output is correct
86 Correct 47 ms 8392 KB Output is correct
87 Correct 74 ms 7944 KB Output is correct
88 Correct 120 ms 8656 KB Output is correct
89 Correct 98 ms 8904 KB Output is correct
90 Correct 77 ms 8144 KB Output is correct
91 Correct 65 ms 8644 KB Output is correct
92 Correct 98 ms 7884 KB Output is correct
93 Correct 89 ms 8208 KB Output is correct
94 Correct 78 ms 7888 KB Output is correct
95 Correct 103 ms 9624 KB Output is correct
96 Correct 78 ms 9296 KB Output is correct
97 Correct 96 ms 9424 KB Output is correct
98 Correct 72 ms 7888 KB Output is correct
99 Correct 87 ms 9276 KB Output is correct
100 Correct 103 ms 8140 KB Output is correct
101 Correct 118 ms 7880 KB Output is correct
102 Correct 94 ms 8068 KB Output is correct
103 Correct 106 ms 9164 KB Output is correct
104 Correct 92 ms 7884 KB Output is correct
105 Correct 104 ms 7884 KB Output is correct
106 Correct 111 ms 8144 KB Output is correct
107 Correct 64 ms 9676 KB Output is correct
108 Correct 86 ms 9416 KB Output is correct
109 Correct 112 ms 8912 KB Output is correct
110 Correct 85 ms 7936 KB Output is correct
111 Correct 78 ms 7884 KB Output is correct
112 Correct 77 ms 8996 KB Output is correct
113 Correct 79 ms 9164 KB Output is correct
114 Correct 79 ms 9424 KB Output is correct
115 Correct 78 ms 7884 KB Output is correct
116 Correct 79 ms 8912 KB Output is correct