oj.uz

답안 #649841

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
649841 2022-10-11T11:55:08 Z welleyth Joker (BOI20_joker) C++17
39 / 100
 2000 ms 35656 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;
        if(Queries[i].size() < __lg(m+1)){
            for(auto&[r,id] : Queries[i]){
                if(can(i,r))
                    answer[id] = 1;
                else
                    answer[id] = 0;
            }
        }
        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;
      |          ^~~~
Joker.cpp: In function 'void solve()':
Joker.cpp:104:30: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  104 |         if(Queries[i].size() < __lg(m+1)){
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 3 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 7 ms 5064 KB Output is correct
9 Correct 6 ms 4948 KB Output is correct
10 Correct 6 ms 4948 KB Output is correct
11 Correct 7 ms 4948 KB Output is correct
12 Correct 7 ms 5064 KB Output is correct
13 Correct 6 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 8 ms 4952 KB Output is correct
16 Correct 6 ms 4948 KB Output is correct
17 Correct 5 ms 4948 KB Output is correct
18 Correct 5 ms 4948 KB Output is correct
19 Correct 7 ms 4948 KB Output is correct
20 Correct 6 ms 4948 KB Output is correct
21 Correct 6 ms 4948 KB Output is correct
22 Correct 6 ms 4948 KB Output is correct
23 Correct 6 ms 4948 KB Output is correct
24 Correct 5 ms 4948 KB Output is correct
25 Correct 7 ms 4948 KB Output is correct
26 Correct 6 ms 5060 KB Output is correct
27 Correct 6 ms 5000 KB Output is correct
28 Correct 6 ms 4948 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 3 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 7 ms 5064 KB Output is correct
9 Correct 6 ms 4948 KB Output is correct
10 Correct 6 ms 4948 KB Output is correct
11 Correct 7 ms 4948 KB Output is correct
12 Correct 7 ms 5064 KB Output is correct
13 Correct 6 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 8 ms 4952 KB Output is correct
16 Correct 6 ms 4948 KB Output is correct
17 Correct 5 ms 4948 KB Output is correct
18 Correct 5 ms 4948 KB Output is correct
19 Correct 7 ms 4948 KB Output is correct
20 Correct 6 ms 4948 KB Output is correct
21 Correct 6 ms 4948 KB Output is correct
22 Correct 6 ms 4948 KB Output is correct
23 Correct 6 ms 4948 KB Output is correct
24 Correct 5 ms 4948 KB Output is correct
25 Correct 7 ms 4948 KB Output is correct
26 Correct 6 ms 5060 KB Output is correct
27 Correct 6 ms 5000 KB Output is correct
28 Correct 6 ms 4948 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 459 ms 5204 KB Output is correct
31 Correct 478 ms 5212 KB Output is correct
32 Correct 362 ms 5204 KB Output is correct
33 Correct 279 ms 5204 KB Output is correct
34 Correct 479 ms 5344 KB Output is correct
35 Correct 510 ms 5344 KB Output is correct
36 Correct 412 ms 5340 KB Output is correct
37 Correct 731 ms 5288 KB Output is correct
38 Correct 6 ms 5076 KB Output is correct
39 Correct 450 ms 5220 KB Output is correct
40 Correct 383 ms 5344 KB Output is correct
41 Correct 372 ms 5216 KB Output is correct
42 Correct 345 ms 5196 KB Output is correct
43 Correct 355 ms 5216 KB Output is correct
44 Correct 394 ms 5196 KB Output is correct
45 Correct 451 ms 5336 KB Output is correct
46 Correct 570 ms 5224 KB Output is correct
47 Correct 332 ms 5196 KB Output is correct
48 Correct 359 ms 5188 KB Output is correct
49 Correct 411 ms 5204 KB Output is correct
50 Correct 483 ms 5204 KB Output is correct
51 Correct 361 ms 5204 KB Output is correct
52 Correct 360 ms 5204 KB Output is correct
53 Correct 444 ms 5204 KB Output is correct
54 Correct 582 ms 5224 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 328 ms 25980 KB Output is correct
4 Correct 135 ms 19108 KB Output is correct
5 Correct 230 ms 22308 KB Output is correct
6 Correct 294 ms 20208 KB Output is correct
7 Correct 228 ms 19176 KB Output is correct
8 Correct 200 ms 20716 KB Output is correct
9 Correct 242 ms 21124 KB Output is correct
10 Correct 437 ms 20932 KB Output is correct
11 Correct 223 ms 19028 KB Output is correct
12 Correct 371 ms 20596 KB Output is correct
13 Correct 194 ms 18408 KB Output is correct
14 Correct 198 ms 20484 KB Output is correct
15 Correct 356 ms 20184 KB Output is correct
16 Correct 423 ms 20892 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 3 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 7 ms 5064 KB Output is correct
9 Correct 6 ms 4948 KB Output is correct
10 Correct 6 ms 4948 KB Output is correct
11 Correct 7 ms 4948 KB Output is correct
12 Correct 7 ms 5064 KB Output is correct
13 Correct 6 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 8 ms 4952 KB Output is correct
16 Correct 6 ms 4948 KB Output is correct
17 Correct 5 ms 4948 KB Output is correct
18 Correct 5 ms 4948 KB Output is correct
19 Correct 7 ms 4948 KB Output is correct
20 Correct 6 ms 4948 KB Output is correct
21 Correct 6 ms 4948 KB Output is correct
22 Correct 6 ms 4948 KB Output is correct
23 Correct 6 ms 4948 KB Output is correct
24 Correct 5 ms 4948 KB Output is correct
25 Correct 7 ms 4948 KB Output is correct
26 Correct 6 ms 5060 KB Output is correct
27 Correct 6 ms 5000 KB Output is correct
28 Correct 6 ms 4948 KB Output is correct
29 Correct 328 ms 25980 KB Output is correct
30 Correct 135 ms 19108 KB Output is correct
31 Correct 230 ms 22308 KB Output is correct
32 Correct 294 ms 20208 KB Output is correct
33 Correct 228 ms 19176 KB Output is correct
34 Correct 200 ms 20716 KB Output is correct
35 Correct 242 ms 21124 KB Output is correct
36 Correct 437 ms 20932 KB Output is correct
37 Correct 223 ms 19028 KB Output is correct
38 Correct 371 ms 20596 KB Output is correct
39 Correct 194 ms 18408 KB Output is correct
40 Correct 198 ms 20484 KB Output is correct
41 Correct 356 ms 20184 KB Output is correct
42 Correct 423 ms 20892 KB Output is correct
43 Execution timed out 2075 ms 35656 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 3 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 7 ms 5064 KB Output is correct
9 Correct 6 ms 4948 KB Output is correct
10 Correct 6 ms 4948 KB Output is correct
11 Correct 7 ms 4948 KB Output is correct
12 Correct 7 ms 5064 KB Output is correct
13 Correct 6 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 8 ms 4952 KB Output is correct
16 Correct 6 ms 4948 KB Output is correct
17 Correct 5 ms 4948 KB Output is correct
18 Correct 5 ms 4948 KB Output is correct
19 Correct 7 ms 4948 KB Output is correct
20 Correct 6 ms 4948 KB Output is correct
21 Correct 6 ms 4948 KB Output is correct
22 Correct 6 ms 4948 KB Output is correct
23 Correct 6 ms 4948 KB Output is correct
24 Correct 5 ms 4948 KB Output is correct
25 Correct 7 ms 4948 KB Output is correct
26 Correct 6 ms 5060 KB Output is correct
27 Correct 6 ms 5000 KB Output is correct
28 Correct 6 ms 4948 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 459 ms 5204 KB Output is correct
31 Correct 478 ms 5212 KB Output is correct
32 Correct 362 ms 5204 KB Output is correct
33 Correct 279 ms 5204 KB Output is correct
34 Correct 479 ms 5344 KB Output is correct
35 Correct 510 ms 5344 KB Output is correct
36 Correct 412 ms 5340 KB Output is correct
37 Correct 731 ms 5288 KB Output is correct
38 Correct 6 ms 5076 KB Output is correct
39 Correct 450 ms 5220 KB Output is correct
40 Correct 383 ms 5344 KB Output is correct
41 Correct 372 ms 5216 KB Output is correct
42 Correct 345 ms 5196 KB Output is correct
43 Correct 355 ms 5216 KB Output is correct
44 Correct 394 ms 5196 KB Output is correct
45 Correct 451 ms 5336 KB Output is correct
46 Correct 570 ms 5224 KB Output is correct
47 Correct 332 ms 5196 KB Output is correct
48 Correct 359 ms 5188 KB Output is correct
49 Correct 411 ms 5204 KB Output is correct
50 Correct 483 ms 5204 KB Output is correct
51 Correct 361 ms 5204 KB Output is correct
52 Correct 360 ms 5204 KB Output is correct
53 Correct 444 ms 5204 KB Output is correct
54 Correct 582 ms 5224 KB Output is correct
55 Execution timed out 2073 ms 19860 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 3 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 7 ms 5064 KB Output is correct
9 Correct 6 ms 4948 KB Output is correct
10 Correct 6 ms 4948 KB Output is correct
11 Correct 7 ms 4948 KB Output is correct
12 Correct 7 ms 5064 KB Output is correct
13 Correct 6 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 8 ms 4952 KB Output is correct
16 Correct 6 ms 4948 KB Output is correct
17 Correct 5 ms 4948 KB Output is correct
18 Correct 5 ms 4948 KB Output is correct
19 Correct 7 ms 4948 KB Output is correct
20 Correct 6 ms 4948 KB Output is correct
21 Correct 6 ms 4948 KB Output is correct
22 Correct 6 ms 4948 KB Output is correct
23 Correct 6 ms 4948 KB Output is correct
24 Correct 5 ms 4948 KB Output is correct
25 Correct 7 ms 4948 KB Output is correct
26 Correct 6 ms 5060 KB Output is correct
27 Correct 6 ms 5000 KB Output is correct
28 Correct 6 ms 4948 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 459 ms 5204 KB Output is correct
31 Correct 478 ms 5212 KB Output is correct
32 Correct 362 ms 5204 KB Output is correct
33 Correct 279 ms 5204 KB Output is correct
34 Correct 479 ms 5344 KB Output is correct
35 Correct 510 ms 5344 KB Output is correct
36 Correct 412 ms 5340 KB Output is correct
37 Correct 731 ms 5288 KB Output is correct
38 Correct 6 ms 5076 KB Output is correct
39 Correct 450 ms 5220 KB Output is correct
40 Correct 383 ms 5344 KB Output is correct
41 Correct 372 ms 5216 KB Output is correct
42 Correct 345 ms 5196 KB Output is correct
43 Correct 355 ms 5216 KB Output is correct
44 Correct 394 ms 5196 KB Output is correct
45 Correct 451 ms 5336 KB Output is correct
46 Correct 570 ms 5224 KB Output is correct
47 Correct 332 ms 5196 KB Output is correct
48 Correct 359 ms 5188 KB Output is correct
49 Correct 411 ms 5204 KB Output is correct
50 Correct 483 ms 5204 KB Output is correct
51 Correct 361 ms 5204 KB Output is correct
52 Correct 360 ms 5204 KB Output is correct
53 Correct 444 ms 5204 KB Output is correct
54 Correct 582 ms 5224 KB Output is correct
55 Correct 328 ms 25980 KB Output is correct
56 Correct 135 ms 19108 KB Output is correct
57 Correct 230 ms 22308 KB Output is correct
58 Correct 294 ms 20208 KB Output is correct
59 Correct 228 ms 19176 KB Output is correct
60 Correct 200 ms 20716 KB Output is correct
61 Correct 242 ms 21124 KB Output is correct
62 Correct 437 ms 20932 KB Output is correct
63 Correct 223 ms 19028 KB Output is correct
64 Correct 371 ms 20596 KB Output is correct
65 Correct 194 ms 18408 KB Output is correct
66 Correct 198 ms 20484 KB Output is correct
67 Correct 356 ms 20184 KB Output is correct
68 Correct 423 ms 20892 KB Output is correct
69 Execution timed out 2075 ms 35656 KB Time limit exceeded
70 Halted 0 ms 0 KB -