oj.uz

Submission #925805

# Submission time Handle Problem Language Result Execution time Memory
925805 2024-02-12T09:04:30 Z vjudge1 Joker (BOI20_joker) C++17
39 / 100
 2000 ms 20932 KB 
/*
no more temmy :(
*/

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
// #include<icecream.hpp>
// using namespace icecream;
#define ll long long
// #define int ll
// #define ld long double
#define y1 cheza
// mt19937 rng(1983413);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=2e5+100;
const int M=1e6;
const int B=317;
const int mod=998244353;
// const int INF=1e18;
const int lg=64;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const double eps=1e-9;
int n,m,q;
vector<pair<int,int>>g[N];
int a[N];
int lx,rx;
int dfs(int x){

    for(auto [i,w]:g[x]){
        if(lx<=w&&w<=rx)continue;
        if(a[i]==-1){
            a[i]=a[x]^1;
            if(dfs(i)){
                return 1;
            }
        }
        else{
            if(a[i]==a[x]){
                return 1;
            }
        }
    }
    return 0;

}
bool check(){
    for(int i=1;i<=n;i++){
        a[i]=-1;
    }
    for(int i=1;i<=n;i++){
        if(a[i]==-1){
            if(dfs(i)){
                return 1;
            }
        }
    }
    return 0;
}
void solve1(){
    for(;q--;){
        cin>>lx>>rx;
        for(int i=1;i<=n;i++){
            a[i]=-1;
        }
        int ans=0;
        for(int i=1;i<=n;i++){
            if(a[i]==-1){
                if(dfs(i)){
                    ans=1;
                    break;
                }
            }
        }
        if(ans){
            cout<<"YES\n";
        }
        else{
            cout<<"NO\n";
        }


    }
}
vector<pair<int,int>>f[N];
bitset<N> ans;
void test(){
    cin>>n>>m>>q;
    for(int i=1,x,y;i<=m;i++){
        cin>>x>>y;
        g[x].push_back({y,i});
        g[y].push_back({x,i});
    }
    if(n<=2000&&m<=2000&&q<=2000){
        solve1();
        return;
    }
    for(int i=1;i<=q;i++){
        cin>>lx>>rx;
        f[lx].push_back({rx,i});
    }
    for(int i=1;i<=min(n,200);i++){
        sort(f[i].begin(),f[i].end());
        int l=0;
        int r=f[i].size()-1;
        while(l<=r){
            int mid=(l+r)>>1ll;
            lx=i;
            rx=f[i][mid].first;
            if(check()){
                l=mid+1;
            }
            else{
                r=mid-1;
            }
        }
        l--;
        for(int j=0;j<=l;j++){
            ans[f[i][j].second]=1;
        }
    }
    for(int i=1;i<=q;i++){
        if(ans[i]){
            cout<<"YES\n";
        }
        else{
            cout<<"NO\n";
        }
    }


    
}
/*

*/  
 
signed main(){
    // ic.prefix("debug->| ");
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    long long t2=1;
    //  cin>>t2;
    for(int i=1;i<=t2;i++){
        test();
    }
    
    return 0;
 
}

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10588 KB Output is correct
2 Correct 3 ms 10584 KB Output is correct
3 Correct 3 ms 10588 KB Output is correct
4 Correct 3 ms 10588 KB Output is correct
5 Correct 3 ms 10588 KB Output is correct
6 Correct 3 ms 10588 KB Output is correct
7 Correct 3 ms 10588 KB Output is correct
8 Correct 4 ms 10588 KB Output is correct
9 Correct 3 ms 10588 KB Output is correct
10 Correct 3 ms 10588 KB Output is correct
11 Correct 3 ms 10616 KB Output is correct
12 Correct 3 ms 10420 KB Output is correct
13 Correct 3 ms 10588 KB Output is correct
14 Correct 4 ms 10588 KB Output is correct
15 Correct 3 ms 10588 KB Output is correct
16 Correct 3 ms 10588 KB Output is correct
17 Correct 3 ms 10428 KB Output is correct
18 Correct 3 ms 10588 KB Output is correct
19 Correct 3 ms 10588 KB Output is correct
20 Correct 3 ms 10588 KB Output is correct
21 Correct 3 ms 10588 KB Output is correct
22 Correct 3 ms 10588 KB Output is correct
23 Correct 4 ms 10588 KB Output is correct
24 Correct 3 ms 10584 KB Output is correct
25 Correct 3 ms 10836 KB Output is correct
26 Correct 3 ms 10584 KB Output is correct
27 Correct 3 ms 10840 KB Output is correct
28 Correct 3 ms 10588 KB Output is correct
29 Correct 59 ms 10588 KB Output is correct
30 Correct 53 ms 10788 KB Output is correct
31 Correct 44 ms 10588 KB Output is correct
32 Correct 23 ms 10584 KB Output is correct
33 Correct 11 ms 10712 KB Output is correct
34 Correct 35 ms 10584 KB Output is correct
35 Correct 60 ms 10588 KB Output is correct
36 Correct 18 ms 10584 KB Output is correct
37 Correct 87 ms 10832 KB Output is correct
38 Correct 93 ms 10700 KB Output is correct
39 Correct 51 ms 10584 KB Output is correct
40 Correct 24 ms 10584 KB Output is correct
41 Correct 24 ms 10584 KB Output is correct
42 Correct 25 ms 10728 KB Output is correct
43 Correct 5 ms 10584 KB Output is correct
44 Correct 6 ms 10584 KB Output is correct
45 Correct 10 ms 10728 KB Output is correct
46 Correct 14 ms 10716 KB Output is correct
47 Correct 33 ms 10844 KB Output is correct
48 Correct 32 ms 10588 KB Output is correct
49 Correct 42 ms 10732 KB Output is correct
50 Correct 44 ms 10584 KB Output is correct
51 Correct 32 ms 10584 KB Output is correct
52 Correct 35 ms 10584 KB Output is correct
53 Correct 47 ms 10720 KB Output is correct
54 Correct 57 ms 10708 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10588 KB Output is correct
2 Correct 3 ms 10584 KB Output is correct
3 Correct 121 ms 19392 KB Output is correct
4 Correct 312 ms 20932 KB Output is correct
5 Correct 135 ms 20004 KB Output is correct
6 Correct 173 ms 19908 KB Output is correct
7 Correct 174 ms 19144 KB Output is correct
8 Correct 139 ms 19904 KB Output is correct
9 Correct 174 ms 20416 KB Output is correct
10 Correct 232 ms 20144 KB Output is correct
11 Correct 171 ms 18960 KB Output is correct
12 Correct 214 ms 19780 KB Output is correct
13 Correct 188 ms 18812 KB Output is correct
14 Correct 231 ms 19776 KB Output is correct
15 Correct 198 ms 20048 KB Output is correct
16 Correct 232 ms 19796 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10588 KB Output is correct
2 Correct 3 ms 10584 KB Output is correct
3 Correct 3 ms 10588 KB Output is correct
4 Correct 3 ms 10588 KB Output is correct
5 Correct 3 ms 10588 KB Output is correct
6 Correct 3 ms 10588 KB Output is correct
7 Correct 3 ms 10588 KB Output is correct
8 Correct 4 ms 10588 KB Output is correct
9 Correct 3 ms 10588 KB Output is correct
10 Correct 3 ms 10588 KB Output is correct
11 Correct 3 ms 10616 KB Output is correct
12 Correct 3 ms 10420 KB Output is correct
13 Correct 3 ms 10588 KB Output is correct
14 Correct 4 ms 10588 KB Output is correct
15 Correct 3 ms 10588 KB Output is correct
16 Correct 3 ms 10588 KB Output is correct
17 Correct 3 ms 10428 KB Output is correct
18 Correct 3 ms 10588 KB Output is correct
19 Correct 3 ms 10588 KB Output is correct
20 Correct 3 ms 10588 KB Output is correct
21 Correct 3 ms 10588 KB Output is correct
22 Correct 3 ms 10588 KB Output is correct
23 Correct 4 ms 10588 KB Output is correct
24 Correct 3 ms 10584 KB Output is correct
25 Correct 3 ms 10836 KB Output is correct
26 Correct 3 ms 10584 KB Output is correct
27 Correct 3 ms 10840 KB Output is correct
28 Correct 3 ms 10588 KB Output is correct
29 Correct 121 ms 19392 KB Output is correct
30 Correct 312 ms 20932 KB Output is correct
31 Correct 135 ms 20004 KB Output is correct
32 Correct 173 ms 19908 KB Output is correct
33 Correct 174 ms 19144 KB Output is correct
34 Correct 139 ms 19904 KB Output is correct
35 Correct 174 ms 20416 KB Output is correct
36 Correct 232 ms 20144 KB Output is correct
37 Correct 171 ms 18960 KB Output is correct
38 Correct 214 ms 19780 KB Output is correct
39 Correct 188 ms 18812 KB Output is correct
40 Correct 231 ms 19776 KB Output is correct
41 Correct 198 ms 20048 KB Output is correct
42 Correct 232 ms 19796 KB Output is correct
43 Execution timed out 2092 ms 20316 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10588 KB Output is correct
2 Correct 3 ms 10584 KB Output is correct
3 Correct 3 ms 10588 KB Output is correct
4 Correct 3 ms 10588 KB Output is correct
5 Correct 3 ms 10588 KB Output is correct
6 Correct 3 ms 10588 KB Output is correct
7 Correct 3 ms 10588 KB Output is correct
8 Correct 4 ms 10588 KB Output is correct
9 Correct 3 ms 10588 KB Output is correct
10 Correct 3 ms 10588 KB Output is correct
11 Correct 3 ms 10616 KB Output is correct
12 Correct 3 ms 10420 KB Output is correct
13 Correct 3 ms 10588 KB Output is correct
14 Correct 4 ms 10588 KB Output is correct
15 Correct 3 ms 10588 KB Output is correct
16 Correct 3 ms 10588 KB Output is correct
17 Correct 3 ms 10428 KB Output is correct
18 Correct 3 ms 10588 KB Output is correct
19 Correct 3 ms 10588 KB Output is correct
20 Correct 3 ms 10588 KB Output is correct
21 Correct 3 ms 10588 KB Output is correct
22 Correct 3 ms 10588 KB Output is correct
23 Correct 4 ms 10588 KB Output is correct
24 Correct 3 ms 10584 KB Output is correct
25 Correct 3 ms 10836 KB Output is correct
26 Correct 3 ms 10584 KB Output is correct
27 Correct 3 ms 10840 KB Output is correct
28 Correct 3 ms 10588 KB Output is correct
29 Correct 59 ms 10588 KB Output is correct
30 Correct 53 ms 10788 KB Output is correct
31 Correct 44 ms 10588 KB Output is correct
32 Correct 23 ms 10584 KB Output is correct
33 Correct 11 ms 10712 KB Output is correct
34 Correct 35 ms 10584 KB Output is correct
35 Correct 60 ms 10588 KB Output is correct
36 Correct 18 ms 10584 KB Output is correct
37 Correct 87 ms 10832 KB Output is correct
38 Correct 93 ms 10700 KB Output is correct
39 Correct 51 ms 10584 KB Output is correct
40 Correct 24 ms 10584 KB Output is correct
41 Correct 24 ms 10584 KB Output is correct
42 Correct 25 ms 10728 KB Output is correct
43 Correct 5 ms 10584 KB Output is correct
44 Correct 6 ms 10584 KB Output is correct
45 Correct 10 ms 10728 KB Output is correct
46 Correct 14 ms 10716 KB Output is correct
47 Correct 33 ms 10844 KB Output is correct
48 Correct 32 ms 10588 KB Output is correct
49 Correct 42 ms 10732 KB Output is correct
50 Correct 44 ms 10584 KB Output is correct
51 Correct 32 ms 10584 KB Output is correct
52 Correct 35 ms 10584 KB Output is correct
53 Correct 47 ms 10720 KB Output is correct
54 Correct 57 ms 10708 KB Output is correct
55 Incorrect 50 ms 16572 KB Output isn't correct
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10588 KB Output is correct
2 Correct 3 ms 10584 KB Output is correct
3 Correct 3 ms 10588 KB Output is correct
4 Correct 3 ms 10588 KB Output is correct
5 Correct 3 ms 10588 KB Output is correct
6 Correct 3 ms 10588 KB Output is correct
7 Correct 3 ms 10588 KB Output is correct
8 Correct 4 ms 10588 KB Output is correct
9 Correct 3 ms 10588 KB Output is correct
10 Correct 3 ms 10588 KB Output is correct
11 Correct 3 ms 10616 KB Output is correct
12 Correct 3 ms 10420 KB Output is correct
13 Correct 3 ms 10588 KB Output is correct
14 Correct 4 ms 10588 KB Output is correct
15 Correct 3 ms 10588 KB Output is correct
16 Correct 3 ms 10588 KB Output is correct
17 Correct 3 ms 10428 KB Output is correct
18 Correct 3 ms 10588 KB Output is correct
19 Correct 3 ms 10588 KB Output is correct
20 Correct 3 ms 10588 KB Output is correct
21 Correct 3 ms 10588 KB Output is correct
22 Correct 3 ms 10588 KB Output is correct
23 Correct 4 ms 10588 KB Output is correct
24 Correct 3 ms 10584 KB Output is correct
25 Correct 3 ms 10836 KB Output is correct
26 Correct 3 ms 10584 KB Output is correct
27 Correct 3 ms 10840 KB Output is correct
28 Correct 3 ms 10588 KB Output is correct
29 Correct 59 ms 10588 KB Output is correct
30 Correct 53 ms 10788 KB Output is correct
31 Correct 44 ms 10588 KB Output is correct
32 Correct 23 ms 10584 KB Output is correct
33 Correct 11 ms 10712 KB Output is correct
34 Correct 35 ms 10584 KB Output is correct
35 Correct 60 ms 10588 KB Output is correct
36 Correct 18 ms 10584 KB Output is correct
37 Correct 87 ms 10832 KB Output is correct
38 Correct 93 ms 10700 KB Output is correct
39 Correct 51 ms 10584 KB Output is correct
40 Correct 24 ms 10584 KB Output is correct
41 Correct 24 ms 10584 KB Output is correct
42 Correct 25 ms 10728 KB Output is correct
43 Correct 5 ms 10584 KB Output is correct
44 Correct 6 ms 10584 KB Output is correct
45 Correct 10 ms 10728 KB Output is correct
46 Correct 14 ms 10716 KB Output is correct
47 Correct 33 ms 10844 KB Output is correct
48 Correct 32 ms 10588 KB Output is correct
49 Correct 42 ms 10732 KB Output is correct
50 Correct 44 ms 10584 KB Output is correct
51 Correct 32 ms 10584 KB Output is correct
52 Correct 35 ms 10584 KB Output is correct
53 Correct 47 ms 10720 KB Output is correct
54 Correct 57 ms 10708 KB Output is correct
55 Correct 121 ms 19392 KB Output is correct
56 Correct 312 ms 20932 KB Output is correct
57 Correct 135 ms 20004 KB Output is correct
58 Correct 173 ms 19908 KB Output is correct
59 Correct 174 ms 19144 KB Output is correct
60 Correct 139 ms 19904 KB Output is correct
61 Correct 174 ms 20416 KB Output is correct
62 Correct 232 ms 20144 KB Output is correct
63 Correct 171 ms 18960 KB Output is correct
64 Correct 214 ms 19780 KB Output is correct
65 Correct 188 ms 18812 KB Output is correct
66 Correct 231 ms 19776 KB Output is correct
67 Correct 198 ms 20048 KB Output is correct
68 Correct 232 ms 19796 KB Output is correct
69 Execution timed out 2092 ms 20316 KB Time limit exceeded
70 Halted 0 ms 0 KB -