oj.uz

Submission #877239

# Submission time Handle Problem Language Result Execution time Memory
877239 2023-11-23T04:36:53 Z bachhoangxuan Joker (BOI20_joker) C++17
49 / 100
 2000 ms 16464 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
const int base=101;

int n,m,q;
pii p[maxn];
int ans[maxn],ql[maxn],qr[maxn];
vector<int> query[maxn];

namespace DSU{
    bool check=true;
    int par[maxn],d[maxn];
    void reset(){
        check=true;
        for(int i=1;i<=n;i++) par[i]=i,d[i]=0;
    }
    int findpar(int u){
        if(u!=par[u]){
            int nxt=par[u];
            par[u]=findpar(par[u]);
            d[u]^=d[nxt];
            return par[u];
        }
        return u;
    }
    void unions(int u,int v){
        int pu=findpar(u),pv=findpar(v);
        if(pu==pv){
            if(d[u]==d[v]) check=false;
            return;
        }
        par[pv]=pu;
        d[pv]^=d[u]^d[v]^1;
    }
}

void solve(){
    cin >> n >> m >> q;
    for(int i=1;i<=m;i++) cin >> p[i].fi >> p[i].se;
    int Max=0;
    for(int i=1;i<=q;i++){
        cin >> ql[i] >> qr[i];
        Max=max(Max,ql[i]);
        query[ql[i]].push_back(i);
    }
    for(int i=1;i<=Max;i++){
        DSU::reset();
        for(int j=1;j<i;j++) DSU::unions(p[j].fi,p[j].se);
        int cur=m;
        while(cur>=i && DSU::check) DSU::unions(p[cur].fi,p[cur].se),cur--;
        for(int id:query[i]) if(qr[id]<=cur) ans[id]=1;
    }
    for(int i=1;i<=q;i++) cout << (ans[i]?"YES\n":"NO\n");
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 50 ms 12416 KB Output is correct
4 Correct 50 ms 12052 KB Output is correct
5 Correct 53 ms 12952 KB Output is correct
6 Correct 53 ms 15564 KB Output is correct
7 Correct 54 ms 15288 KB Output is correct
8 Correct 50 ms 15052 KB Output is correct
9 Correct 50 ms 15196 KB Output is correct
10 Correct 52 ms 15312 KB Output is correct
11 Correct 53 ms 15564 KB Output is correct
12 Correct 54 ms 15948 KB Output is correct
13 Correct 65 ms 15432 KB Output is correct
14 Correct 59 ms 15308 KB Output is correct
15 Correct 60 ms 15416 KB Output is correct
16 Correct 54 ms 15644 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8536 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8536 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 2 ms 8536 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Correct 2 ms 8792 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 50 ms 12416 KB Output is correct
30 Correct 50 ms 12052 KB Output is correct
31 Correct 53 ms 12952 KB Output is correct
32 Correct 53 ms 15564 KB Output is correct
33 Correct 54 ms 15288 KB Output is correct
34 Correct 50 ms 15052 KB Output is correct
35 Correct 50 ms 15196 KB Output is correct
36 Correct 52 ms 15312 KB Output is correct
37 Correct 53 ms 15564 KB Output is correct
38 Correct 54 ms 15948 KB Output is correct
39 Correct 65 ms 15432 KB Output is correct
40 Correct 59 ms 15308 KB Output is correct
41 Correct 60 ms 15416 KB Output is correct
42 Correct 54 ms 15644 KB Output is correct
43 Correct 228 ms 16260 KB Output is correct
44 Correct 580 ms 15656 KB Output is correct
45 Correct 466 ms 16144 KB Output is correct
46 Correct 82 ms 16032 KB Output is correct
47 Correct 76 ms 15952 KB Output is correct
48 Correct 271 ms 15616 KB Output is correct
49 Correct 407 ms 15952 KB Output is correct
50 Correct 562 ms 16000 KB Output is correct
51 Correct 428 ms 16220 KB Output is correct
52 Correct 400 ms 16464 KB Output is correct
53 Correct 365 ms 15820 KB Output is correct
54 Correct 281 ms 16116 KB Output is correct
55 Correct 380 ms 16212 KB Output is correct
56 Correct 423 ms 16148 KB Output is correct

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8536 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8536 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 2 ms 8536 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Correct 2 ms 8792 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 7 ms 8540 KB Output is correct
30 Correct 14 ms 8540 KB Output is correct
31 Correct 20 ms 8736 KB Output is correct
32 Correct 21 ms 8740 KB Output is correct
33 Correct 19 ms 8716 KB Output is correct
34 Correct 23 ms 8540 KB Output is correct
35 Correct 19 ms 8540 KB Output is correct
36 Correct 14 ms 8744 KB Output is correct
37 Correct 21 ms 8536 KB Output is correct
38 Correct 25 ms 8540 KB Output is correct
39 Correct 19 ms 8740 KB Output is correct
40 Correct 15 ms 8540 KB Output is correct
41 Correct 15 ms 8540 KB Output is correct
42 Correct 15 ms 8540 KB Output is correct
43 Correct 20 ms 8540 KB Output is correct
44 Correct 21 ms 8740 KB Output is correct
45 Correct 19 ms 8540 KB Output is correct
46 Correct 18 ms 8540 KB Output is correct
47 Correct 19 ms 8536 KB Output is correct
48 Correct 19 ms 8540 KB Output is correct
49 Correct 18 ms 8540 KB Output is correct
50 Correct 18 ms 8540 KB Output is correct
51 Correct 20 ms 8744 KB Output is correct
52 Correct 21 ms 8632 KB Output is correct
53 Correct 20 ms 8536 KB Output is correct
54 Correct 18 ms 8540 KB Output is correct
55 Execution timed out 2017 ms 10840 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8536 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8536 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 2 ms 8536 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Correct 2 ms 8792 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 7 ms 8540 KB Output is correct
30 Correct 14 ms 8540 KB Output is correct
31 Correct 20 ms 8736 KB Output is correct
32 Correct 21 ms 8740 KB Output is correct
33 Correct 19 ms 8716 KB Output is correct
34 Correct 23 ms 8540 KB Output is correct
35 Correct 19 ms 8540 KB Output is correct
36 Correct 14 ms 8744 KB Output is correct
37 Correct 21 ms 8536 KB Output is correct
38 Correct 25 ms 8540 KB Output is correct
39 Correct 19 ms 8740 KB Output is correct
40 Correct 15 ms 8540 KB Output is correct
41 Correct 15 ms 8540 KB Output is correct
42 Correct 15 ms 8540 KB Output is correct
43 Correct 20 ms 8540 KB Output is correct
44 Correct 21 ms 8740 KB Output is correct
45 Correct 19 ms 8540 KB Output is correct
46 Correct 18 ms 8540 KB Output is correct
47 Correct 19 ms 8536 KB Output is correct
48 Correct 19 ms 8540 KB Output is correct
49 Correct 18 ms 8540 KB Output is correct
50 Correct 18 ms 8540 KB Output is correct
51 Correct 20 ms 8744 KB Output is correct
52 Correct 21 ms 8632 KB Output is correct
53 Correct 20 ms 8536 KB Output is correct
54 Correct 18 ms 8540 KB Output is correct
55 Correct 50 ms 12416 KB Output is correct
56 Correct 50 ms 12052 KB Output is correct
57 Correct 53 ms 12952 KB Output is correct
58 Correct 53 ms 15564 KB Output is correct
59 Correct 54 ms 15288 KB Output is correct
60 Correct 50 ms 15052 KB Output is correct
61 Correct 50 ms 15196 KB Output is correct
62 Correct 52 ms 15312 KB Output is correct
63 Correct 53 ms 15564 KB Output is correct
64 Correct 54 ms 15948 KB Output is correct
65 Correct 65 ms 15432 KB Output is correct
66 Correct 59 ms 15308 KB Output is correct
67 Correct 60 ms 15416 KB Output is correct
68 Correct 54 ms 15644 KB Output is correct
69 Correct 228 ms 16260 KB Output is correct
70 Correct 580 ms 15656 KB Output is correct
71 Correct 466 ms 16144 KB Output is correct
72 Correct 82 ms 16032 KB Output is correct
73 Correct 76 ms 15952 KB Output is correct
74 Correct 271 ms 15616 KB Output is correct
75 Correct 407 ms 15952 KB Output is correct
76 Correct 562 ms 16000 KB Output is correct
77 Correct 428 ms 16220 KB Output is correct
78 Correct 400 ms 16464 KB Output is correct
79 Correct 365 ms 15820 KB Output is correct
80 Correct 281 ms 16116 KB Output is correct
81 Correct 380 ms 16212 KB Output is correct
82 Correct 423 ms 16148 KB Output is correct
83 Execution timed out 2017 ms 10840 KB Time limit exceeded
84 Halted 0 ms 0 KB -