oj.uz

Submission #925797

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

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#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,200ll);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;
 
}

Compilation message

Joker.cpp: In function 'long long int dfs(long long int)':
Joker.cpp:35:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   35 |     for(auto [i,w]:g[x]){
      |              ^

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11356 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 2 ms 11356 KB Output is correct
4 Correct 3 ms 11356 KB Output is correct
5 Correct 3 ms 11356 KB Output is correct
6 Correct 2 ms 11356 KB Output is correct
7 Correct 3 ms 11356 KB Output is correct
8 Correct 3 ms 11356 KB Output is correct
9 Correct 3 ms 11356 KB Output is correct
10 Correct 3 ms 11356 KB Output is correct
11 Correct 3 ms 11356 KB Output is correct
12 Correct 3 ms 11212 KB Output is correct
13 Correct 2 ms 11356 KB Output is correct
14 Correct 3 ms 11356 KB Output is correct
15 Correct 3 ms 11356 KB Output is correct
16 Correct 3 ms 11356 KB Output is correct
17 Correct 3 ms 11356 KB Output is correct
18 Correct 3 ms 11356 KB Output is correct
19 Correct 3 ms 11352 KB Output is correct
20 Correct 2 ms 11356 KB Output is correct
21 Correct 3 ms 11356 KB Output is correct
22 Correct 3 ms 11356 KB Output is correct
23 Correct 3 ms 11356 KB Output is correct
24 Correct 3 ms 11356 KB Output is correct
25 Correct 3 ms 11356 KB Output is correct
26 Correct 3 ms 11356 KB Output is correct
27 Correct 3 ms 11444 KB Output is correct
28 Correct 5 ms 11356 KB Output is correct
29 Correct 62 ms 11356 KB Output is correct
30 Correct 54 ms 11356 KB Output is correct
31 Correct 41 ms 11356 KB Output is correct
32 Correct 22 ms 11356 KB Output is correct
33 Correct 9 ms 11352 KB Output is correct
34 Correct 38 ms 11544 KB Output is correct
35 Correct 62 ms 11352 KB Output is correct
36 Correct 17 ms 11352 KB Output is correct
37 Correct 80 ms 11356 KB Output is correct
38 Correct 94 ms 11520 KB Output is correct
39 Correct 55 ms 11612 KB Output is correct
40 Correct 22 ms 11356 KB Output is correct
41 Correct 24 ms 11356 KB Output is correct
42 Correct 23 ms 11356 KB Output is correct
43 Correct 4 ms 11352 KB Output is correct
44 Correct 5 ms 11356 KB Output is correct
45 Correct 10 ms 11464 KB Output is correct
46 Correct 12 ms 11356 KB Output is correct
47 Correct 31 ms 11556 KB Output is correct
48 Correct 36 ms 11788 KB Output is correct
49 Correct 41 ms 11356 KB Output is correct
50 Correct 51 ms 11356 KB Output is correct
51 Correct 32 ms 11352 KB Output is correct
52 Correct 35 ms 11356 KB Output is correct
53 Correct 44 ms 11544 KB Output is correct
54 Correct 57 ms 11352 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11356 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 143 ms 25844 KB Output is correct
4 Correct 361 ms 26292 KB Output is correct
5 Correct 212 ms 26060 KB Output is correct
6 Correct 207 ms 27628 KB Output is correct
7 Correct 252 ms 28032 KB Output is correct
8 Correct 181 ms 27612 KB Output is correct
9 Correct 203 ms 27592 KB Output is correct
10 Correct 250 ms 26508 KB Output is correct
11 Correct 194 ms 26632 KB Output is correct
12 Correct 249 ms 27208 KB Output is correct
13 Correct 231 ms 26828 KB Output is correct
14 Correct 229 ms 27584 KB Output is correct
15 Correct 214 ms 27592 KB Output is correct
16 Correct 317 ms 27732 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11356 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 2 ms 11356 KB Output is correct
4 Correct 3 ms 11356 KB Output is correct
5 Correct 3 ms 11356 KB Output is correct
6 Correct 2 ms 11356 KB Output is correct
7 Correct 3 ms 11356 KB Output is correct
8 Correct 3 ms 11356 KB Output is correct
9 Correct 3 ms 11356 KB Output is correct
10 Correct 3 ms 11356 KB Output is correct
11 Correct 3 ms 11356 KB Output is correct
12 Correct 3 ms 11212 KB Output is correct
13 Correct 2 ms 11356 KB Output is correct
14 Correct 3 ms 11356 KB Output is correct
15 Correct 3 ms 11356 KB Output is correct
16 Correct 3 ms 11356 KB Output is correct
17 Correct 3 ms 11356 KB Output is correct
18 Correct 3 ms 11356 KB Output is correct
19 Correct 3 ms 11352 KB Output is correct
20 Correct 2 ms 11356 KB Output is correct
21 Correct 3 ms 11356 KB Output is correct
22 Correct 3 ms 11356 KB Output is correct
23 Correct 3 ms 11356 KB Output is correct
24 Correct 3 ms 11356 KB Output is correct
25 Correct 3 ms 11356 KB Output is correct
26 Correct 3 ms 11356 KB Output is correct
27 Correct 3 ms 11444 KB Output is correct
28 Correct 5 ms 11356 KB Output is correct
29 Correct 143 ms 25844 KB Output is correct
30 Correct 361 ms 26292 KB Output is correct
31 Correct 212 ms 26060 KB Output is correct
32 Correct 207 ms 27628 KB Output is correct
33 Correct 252 ms 28032 KB Output is correct
34 Correct 181 ms 27612 KB Output is correct
35 Correct 203 ms 27592 KB Output is correct
36 Correct 250 ms 26508 KB Output is correct
37 Correct 194 ms 26632 KB Output is correct
38 Correct 249 ms 27208 KB Output is correct
39 Correct 231 ms 26828 KB Output is correct
40 Correct 229 ms 27584 KB Output is correct
41 Correct 214 ms 27592 KB Output is correct
42 Correct 317 ms 27732 KB Output is correct
43 Execution timed out 2103 ms 26140 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11356 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 2 ms 11356 KB Output is correct
4 Correct 3 ms 11356 KB Output is correct
5 Correct 3 ms 11356 KB Output is correct
6 Correct 2 ms 11356 KB Output is correct
7 Correct 3 ms 11356 KB Output is correct
8 Correct 3 ms 11356 KB Output is correct
9 Correct 3 ms 11356 KB Output is correct
10 Correct 3 ms 11356 KB Output is correct
11 Correct 3 ms 11356 KB Output is correct
12 Correct 3 ms 11212 KB Output is correct
13 Correct 2 ms 11356 KB Output is correct
14 Correct 3 ms 11356 KB Output is correct
15 Correct 3 ms 11356 KB Output is correct
16 Correct 3 ms 11356 KB Output is correct
17 Correct 3 ms 11356 KB Output is correct
18 Correct 3 ms 11356 KB Output is correct
19 Correct 3 ms 11352 KB Output is correct
20 Correct 2 ms 11356 KB Output is correct
21 Correct 3 ms 11356 KB Output is correct
22 Correct 3 ms 11356 KB Output is correct
23 Correct 3 ms 11356 KB Output is correct
24 Correct 3 ms 11356 KB Output is correct
25 Correct 3 ms 11356 KB Output is correct
26 Correct 3 ms 11356 KB Output is correct
27 Correct 3 ms 11444 KB Output is correct
28 Correct 5 ms 11356 KB Output is correct
29 Correct 62 ms 11356 KB Output is correct
30 Correct 54 ms 11356 KB Output is correct
31 Correct 41 ms 11356 KB Output is correct
32 Correct 22 ms 11356 KB Output is correct
33 Correct 9 ms 11352 KB Output is correct
34 Correct 38 ms 11544 KB Output is correct
35 Correct 62 ms 11352 KB Output is correct
36 Correct 17 ms 11352 KB Output is correct
37 Correct 80 ms 11356 KB Output is correct
38 Correct 94 ms 11520 KB Output is correct
39 Correct 55 ms 11612 KB Output is correct
40 Correct 22 ms 11356 KB Output is correct
41 Correct 24 ms 11356 KB Output is correct
42 Correct 23 ms 11356 KB Output is correct
43 Correct 4 ms 11352 KB Output is correct
44 Correct 5 ms 11356 KB Output is correct
45 Correct 10 ms 11464 KB Output is correct
46 Correct 12 ms 11356 KB Output is correct
47 Correct 31 ms 11556 KB Output is correct
48 Correct 36 ms 11788 KB Output is correct
49 Correct 41 ms 11356 KB Output is correct
50 Correct 51 ms 11356 KB Output is correct
51 Correct 32 ms 11352 KB Output is correct
52 Correct 35 ms 11356 KB Output is correct
53 Correct 44 ms 11544 KB Output is correct
54 Correct 57 ms 11352 KB Output is correct
55 Incorrect 52 ms 20560 KB Output isn't correct
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11356 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 2 ms 11356 KB Output is correct
4 Correct 3 ms 11356 KB Output is correct
5 Correct 3 ms 11356 KB Output is correct
6 Correct 2 ms 11356 KB Output is correct
7 Correct 3 ms 11356 KB Output is correct
8 Correct 3 ms 11356 KB Output is correct
9 Correct 3 ms 11356 KB Output is correct
10 Correct 3 ms 11356 KB Output is correct
11 Correct 3 ms 11356 KB Output is correct
12 Correct 3 ms 11212 KB Output is correct
13 Correct 2 ms 11356 KB Output is correct
14 Correct 3 ms 11356 KB Output is correct
15 Correct 3 ms 11356 KB Output is correct
16 Correct 3 ms 11356 KB Output is correct
17 Correct 3 ms 11356 KB Output is correct
18 Correct 3 ms 11356 KB Output is correct
19 Correct 3 ms 11352 KB Output is correct
20 Correct 2 ms 11356 KB Output is correct
21 Correct 3 ms 11356 KB Output is correct
22 Correct 3 ms 11356 KB Output is correct
23 Correct 3 ms 11356 KB Output is correct
24 Correct 3 ms 11356 KB Output is correct
25 Correct 3 ms 11356 KB Output is correct
26 Correct 3 ms 11356 KB Output is correct
27 Correct 3 ms 11444 KB Output is correct
28 Correct 5 ms 11356 KB Output is correct
29 Correct 62 ms 11356 KB Output is correct
30 Correct 54 ms 11356 KB Output is correct
31 Correct 41 ms 11356 KB Output is correct
32 Correct 22 ms 11356 KB Output is correct
33 Correct 9 ms 11352 KB Output is correct
34 Correct 38 ms 11544 KB Output is correct
35 Correct 62 ms 11352 KB Output is correct
36 Correct 17 ms 11352 KB Output is correct
37 Correct 80 ms 11356 KB Output is correct
38 Correct 94 ms 11520 KB Output is correct
39 Correct 55 ms 11612 KB Output is correct
40 Correct 22 ms 11356 KB Output is correct
41 Correct 24 ms 11356 KB Output is correct
42 Correct 23 ms 11356 KB Output is correct
43 Correct 4 ms 11352 KB Output is correct
44 Correct 5 ms 11356 KB Output is correct
45 Correct 10 ms 11464 KB Output is correct
46 Correct 12 ms 11356 KB Output is correct
47 Correct 31 ms 11556 KB Output is correct
48 Correct 36 ms 11788 KB Output is correct
49 Correct 41 ms 11356 KB Output is correct
50 Correct 51 ms 11356 KB Output is correct
51 Correct 32 ms 11352 KB Output is correct
52 Correct 35 ms 11356 KB Output is correct
53 Correct 44 ms 11544 KB Output is correct
54 Correct 57 ms 11352 KB Output is correct
55 Correct 143 ms 25844 KB Output is correct
56 Correct 361 ms 26292 KB Output is correct
57 Correct 212 ms 26060 KB Output is correct
58 Correct 207 ms 27628 KB Output is correct
59 Correct 252 ms 28032 KB Output is correct
60 Correct 181 ms 27612 KB Output is correct
61 Correct 203 ms 27592 KB Output is correct
62 Correct 250 ms 26508 KB Output is correct
63 Correct 194 ms 26632 KB Output is correct
64 Correct 249 ms 27208 KB Output is correct
65 Correct 231 ms 26828 KB Output is correct
66 Correct 229 ms 27584 KB Output is correct
67 Correct 214 ms 27592 KB Output is correct
68 Correct 317 ms 27732 KB Output is correct
69 Execution timed out 2103 ms 26140 KB Time limit exceeded
70 Halted 0 ms 0 KB -