oj.uz

Submission #649840

# Submission time Handle Problem Language Result Execution time Memory
649840 2022-10-11T11:53:02 Z welleyth Joker (BOI20_joker) C++17
39 / 100
 2000 ms 35636 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

//#define int long long
#define pb push_back
#define mp make_pair

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

constexpr int N = (int)2e5 + 111;
constexpr int md = (int)2e5 + 111;

mt19937 rnd(time(nullptr));

vector<int> g[N];
bool used[2][N];
bool c[2][N];

bool dfs(int v,int r,int pr = -1){
    used[r][v] = true;
    c[r][v] = true;
    for(auto& to : g[v]){
        if(pr == to)
            continue;
        if(used[r^1][to]){
            if(c[r][v]&c[r][to])
                return true;
            continue;
        }
        c[r^1][to] = true;
        if(dfs(to,r^1,v))
            return true;
    }
    return false;
}

int n,m,q;
vector<pair<int,int>> edges;

bool can(int l,int r){
    for(int j = 0; j <= n; j++){
        used[0][j] = false;
        used[1][j] = false;
        c[0][j] = c[1][j] = 0;
        g[j].clear();
    }
    bool have = false;
    for(int j = 0; j < l-1; j++){
        auto&[a,b] = edges[j];
        g[a].pb(b);
        g[b].pb(a);
    }
    for(int j = r; j < m; j++){
        auto&[a,b] = edges[j];
        g[a].pb(b);
        g[b].pb(a);
    }
    for(int j = 1; j <= n; j++){
        if(!used[0][j] && !used[1][j]){
            c[0][j] = 1;
            if(dfs(j,0)){
                return true;
            }
        }
    }
    return false;
}

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

    for(int i = 0; i < m; i++){
        int a,b;
        cin >> a >> b;
        edges.pb(mp(a,b));
    }

    bool answer[q];
    bool f = true;
    if(!can(1,0))
        f = false;

    vector<pair<int,int>> Queries[m+1];

    for(int i = 0; i < q; i++){
        int l,r;
        cin >> l >> r;
        if(!f){
            cout << "NO\n";
            continue;
        }
        Queries[l].pb(mp(r,i));
    }
    if(!f)
        return;
    for(int i = 0; i <= m; i++){
        if(Queries[i].empty())
            continue;
        sort(Queries[i].rbegin(),Queries[i].rend());
        if(!can(i,i)){
            for(auto&[r,id] : Queries[i]){
                answer[id] = 0;
            }
            continue;
        }
        int L = i, R = m+1;
        while(R - L > 1){
            int mid = (L+R)>>1;
            if(can(i,mid))
                L = mid;
            else
                R = mid;
        }
        for(auto&[r,id] : Queries[i]){
            if(r <= L)
                answer[id] = 1;
            else
                answer[id] = 0;
        }
    }

    for(int i = 0; i < q; i++){
        cout << (answer[i] ? "YES" : "NO") << "\n";
    }

    return;
}

signed main(){
    ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
//    init();
    int tests = 1;
//    cin >> tests;
    for(int test = 1; test <= tests; test++){
//        cerr << "test = " << test << "\n";
        solve();
    }
    return 0;
}
/**
6 8 2
1 3
1 5
1 6
2 5
2 6
3 4
3 5
5 6
4 7
4 8

**/

Compilation message

Joker.cpp: In function 'bool can(int, int)':
Joker.cpp:52:10: warning: unused variable 'have' [-Wunused-variable]
   52 |     bool have = false;
      |          ^~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 6 ms 4948 KB Output is correct
9 Correct 7 ms 4948 KB Output is correct
10 Correct 5 ms 4948 KB Output is correct
11 Correct 7 ms 4948 KB Output is correct
12 Correct 6 ms 4948 KB Output is correct
13 Correct 5 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 7 ms 5060 KB Output is correct
16 Correct 6 ms 4948 KB Output is correct
17 Correct 6 ms 4948 KB Output is correct
18 Correct 6 ms 5060 KB Output is correct
19 Correct 6 ms 4948 KB Output is correct
20 Correct 5 ms 4948 KB Output is correct
21 Correct 6 ms 4948 KB Output is correct
22 Correct 6 ms 5064 KB Output is correct
23 Correct 6 ms 4948 KB Output is correct
24 Correct 6 ms 4948 KB Output is correct
25 Correct 5 ms 4948 KB Output is correct
26 Correct 5 ms 4948 KB Output is correct
27 Correct 6 ms 4948 KB Output is correct
28 Correct 6 ms 4948 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 426 ms 5212 KB Output is correct
31 Correct 402 ms 5212 KB Output is correct
32 Correct 318 ms 5204 KB Output is correct
33 Correct 272 ms 5188 KB Output is correct
34 Correct 434 ms 5232 KB Output is correct
35 Correct 485 ms 5220 KB Output is correct
36 Correct 393 ms 5340 KB Output is correct
37 Correct 606 ms 5288 KB Output is correct
38 Correct 4 ms 5076 KB Output is correct
39 Correct 367 ms 5324 KB Output is correct
40 Correct 314 ms 5216 KB Output is correct
41 Correct 296 ms 5204 KB Output is correct
42 Correct 299 ms 5316 KB Output is correct
43 Correct 294 ms 5204 KB Output is correct
44 Correct 337 ms 5204 KB Output is correct
45 Correct 394 ms 5212 KB Output is correct
46 Correct 481 ms 5220 KB Output is correct
47 Correct 279 ms 5316 KB Output is correct
48 Correct 324 ms 5188 KB Output is correct
49 Correct 338 ms 5204 KB Output is correct
50 Correct 399 ms 5204 KB Output is correct
51 Correct 287 ms 5204 KB Output is correct
52 Correct 310 ms 5208 KB Output is correct
53 Correct 365 ms 5208 KB Output is correct
54 Correct 461 ms 5228 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 262 ms 26020 KB Output is correct
4 Correct 107 ms 19028 KB Output is correct
5 Correct 176 ms 22236 KB Output is correct
6 Correct 230 ms 20124 KB Output is correct
7 Correct 234 ms 19100 KB Output is correct
8 Correct 216 ms 20736 KB Output is correct
9 Correct 238 ms 20924 KB Output is correct
10 Correct 393 ms 20820 KB Output is correct
11 Correct 221 ms 19008 KB Output is correct
12 Correct 317 ms 20516 KB Output is correct
13 Correct 161 ms 18428 KB Output is correct
14 Correct 208 ms 20460 KB Output is correct
15 Correct 340 ms 20188 KB Output is correct
16 Correct 446 ms 20912 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 6 ms 4948 KB Output is correct
9 Correct 7 ms 4948 KB Output is correct
10 Correct 5 ms 4948 KB Output is correct
11 Correct 7 ms 4948 KB Output is correct
12 Correct 6 ms 4948 KB Output is correct
13 Correct 5 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 7 ms 5060 KB Output is correct
16 Correct 6 ms 4948 KB Output is correct
17 Correct 6 ms 4948 KB Output is correct
18 Correct 6 ms 5060 KB Output is correct
19 Correct 6 ms 4948 KB Output is correct
20 Correct 5 ms 4948 KB Output is correct
21 Correct 6 ms 4948 KB Output is correct
22 Correct 6 ms 5064 KB Output is correct
23 Correct 6 ms 4948 KB Output is correct
24 Correct 6 ms 4948 KB Output is correct
25 Correct 5 ms 4948 KB Output is correct
26 Correct 5 ms 4948 KB Output is correct
27 Correct 6 ms 4948 KB Output is correct
28 Correct 6 ms 4948 KB Output is correct
29 Correct 262 ms 26020 KB Output is correct
30 Correct 107 ms 19028 KB Output is correct
31 Correct 176 ms 22236 KB Output is correct
32 Correct 230 ms 20124 KB Output is correct
33 Correct 234 ms 19100 KB Output is correct
34 Correct 216 ms 20736 KB Output is correct
35 Correct 238 ms 20924 KB Output is correct
36 Correct 393 ms 20820 KB Output is correct
37 Correct 221 ms 19008 KB Output is correct
38 Correct 317 ms 20516 KB Output is correct
39 Correct 161 ms 18428 KB Output is correct
40 Correct 208 ms 20460 KB Output is correct
41 Correct 340 ms 20188 KB Output is correct
42 Correct 446 ms 20912 KB Output is correct
43 Execution timed out 2096 ms 35636 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 6 ms 4948 KB Output is correct
9 Correct 7 ms 4948 KB Output is correct
10 Correct 5 ms 4948 KB Output is correct
11 Correct 7 ms 4948 KB Output is correct
12 Correct 6 ms 4948 KB Output is correct
13 Correct 5 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 7 ms 5060 KB Output is correct
16 Correct 6 ms 4948 KB Output is correct
17 Correct 6 ms 4948 KB Output is correct
18 Correct 6 ms 5060 KB Output is correct
19 Correct 6 ms 4948 KB Output is correct
20 Correct 5 ms 4948 KB Output is correct
21 Correct 6 ms 4948 KB Output is correct
22 Correct 6 ms 5064 KB Output is correct
23 Correct 6 ms 4948 KB Output is correct
24 Correct 6 ms 4948 KB Output is correct
25 Correct 5 ms 4948 KB Output is correct
26 Correct 5 ms 4948 KB Output is correct
27 Correct 6 ms 4948 KB Output is correct
28 Correct 6 ms 4948 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 426 ms 5212 KB Output is correct
31 Correct 402 ms 5212 KB Output is correct
32 Correct 318 ms 5204 KB Output is correct
33 Correct 272 ms 5188 KB Output is correct
34 Correct 434 ms 5232 KB Output is correct
35 Correct 485 ms 5220 KB Output is correct
36 Correct 393 ms 5340 KB Output is correct
37 Correct 606 ms 5288 KB Output is correct
38 Correct 4 ms 5076 KB Output is correct
39 Correct 367 ms 5324 KB Output is correct
40 Correct 314 ms 5216 KB Output is correct
41 Correct 296 ms 5204 KB Output is correct
42 Correct 299 ms 5316 KB Output is correct
43 Correct 294 ms 5204 KB Output is correct
44 Correct 337 ms 5204 KB Output is correct
45 Correct 394 ms 5212 KB Output is correct
46 Correct 481 ms 5220 KB Output is correct
47 Correct 279 ms 5316 KB Output is correct
48 Correct 324 ms 5188 KB Output is correct
49 Correct 338 ms 5204 KB Output is correct
50 Correct 399 ms 5204 KB Output is correct
51 Correct 287 ms 5204 KB Output is correct
52 Correct 310 ms 5208 KB Output is correct
53 Correct 365 ms 5208 KB Output is correct
54 Correct 461 ms 5228 KB Output is correct
55 Execution timed out 2101 ms 19904 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 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 6 ms 4948 KB Output is correct
9 Correct 7 ms 4948 KB Output is correct
10 Correct 5 ms 4948 KB Output is correct
11 Correct 7 ms 4948 KB Output is correct
12 Correct 6 ms 4948 KB Output is correct
13 Correct 5 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 7 ms 5060 KB Output is correct
16 Correct 6 ms 4948 KB Output is correct
17 Correct 6 ms 4948 KB Output is correct
18 Correct 6 ms 5060 KB Output is correct
19 Correct 6 ms 4948 KB Output is correct
20 Correct 5 ms 4948 KB Output is correct
21 Correct 6 ms 4948 KB Output is correct
22 Correct 6 ms 5064 KB Output is correct
23 Correct 6 ms 4948 KB Output is correct
24 Correct 6 ms 4948 KB Output is correct
25 Correct 5 ms 4948 KB Output is correct
26 Correct 5 ms 4948 KB Output is correct
27 Correct 6 ms 4948 KB Output is correct
28 Correct 6 ms 4948 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 426 ms 5212 KB Output is correct
31 Correct 402 ms 5212 KB Output is correct
32 Correct 318 ms 5204 KB Output is correct
33 Correct 272 ms 5188 KB Output is correct
34 Correct 434 ms 5232 KB Output is correct
35 Correct 485 ms 5220 KB Output is correct
36 Correct 393 ms 5340 KB Output is correct
37 Correct 606 ms 5288 KB Output is correct
38 Correct 4 ms 5076 KB Output is correct
39 Correct 367 ms 5324 KB Output is correct
40 Correct 314 ms 5216 KB Output is correct
41 Correct 296 ms 5204 KB Output is correct
42 Correct 299 ms 5316 KB Output is correct
43 Correct 294 ms 5204 KB Output is correct
44 Correct 337 ms 5204 KB Output is correct
45 Correct 394 ms 5212 KB Output is correct
46 Correct 481 ms 5220 KB Output is correct
47 Correct 279 ms 5316 KB Output is correct
48 Correct 324 ms 5188 KB Output is correct
49 Correct 338 ms 5204 KB Output is correct
50 Correct 399 ms 5204 KB Output is correct
51 Correct 287 ms 5204 KB Output is correct
52 Correct 310 ms 5208 KB Output is correct
53 Correct 365 ms 5208 KB Output is correct
54 Correct 461 ms 5228 KB Output is correct
55 Correct 262 ms 26020 KB Output is correct
56 Correct 107 ms 19028 KB Output is correct
57 Correct 176 ms 22236 KB Output is correct
58 Correct 230 ms 20124 KB Output is correct
59 Correct 234 ms 19100 KB Output is correct
60 Correct 216 ms 20736 KB Output is correct
61 Correct 238 ms 20924 KB Output is correct
62 Correct 393 ms 20820 KB Output is correct
63 Correct 221 ms 19008 KB Output is correct
64 Correct 317 ms 20516 KB Output is correct
65 Correct 161 ms 18428 KB Output is correct
66 Correct 208 ms 20460 KB Output is correct
67 Correct 340 ms 20188 KB Output is correct
68 Correct 446 ms 20912 KB Output is correct
69 Execution timed out 2096 ms 35636 KB Time limit exceeded
70 Halted 0 ms 0 KB -