Submission #914305

# Submission time Handle Problem Language Result Execution time Memory
914305 2024-01-21T15:04:15 Z 3as8 Joker (BOI20_joker) C++14
39 / 100
820 ms 23700 KB
#include <bits/stdc++.h>

#define ll long long
#define endl "\n"
#define fastIO cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false);

#define mid ((l + r) / 2)
#define lChild ((index * 2) + 1)
#define rChild ((index * 2) + 2)

using namespace std;

struct node {
    ll u, i;
};

bool bi(vector<vector<node> >& graph, vector<ll>& color, ll startIndex, ll p, ll col, ll l, ll r) {

    color[startIndex] = col;

    ll ret = true;
    for(auto [el, i] : graph[startIndex]) {
        if(el == p || (l <= i && i <= r)) continue;
        if(color[el] == -1) ret &= bi(graph, color, el, startIndex, !col, l, r);


        if(color[el] != -1 && color[el] == col) return false;
        if(color[el] != col) continue;

    }

    return ret;
}

bool check(vector<vector<node> >& graph, ll i, ll l = 0) {

    ll n = graph.size();

    vector<ll> col(n, -1);

    ll ans = true;
    for(int j = 0; j < n; j++) {
        if(col[j] != -1) continue;
        ans &= bi(graph, col, j, -1, 0, l, i);
    }

    return !ans;
}


void solve(ll _) {

    ll n, m, q; cin>>n>>m>>q;

    vector<vector<node> > graph(n);
    for(int i = 0; i < m; i++) {
        ll x, y; cin>>x>>y;
        x--; y--;

        graph[x].push_back({y, i});
        graph[y].push_back({x, i});
    }

    ll cnt = min({1ll, m - 1, 201ll});
    vector<ll> x(cnt);
    vector<bool> is(cnt);

    for(int k = 0; k < cnt; k++) {
        ll l = 0, r = m - 1;
        while (l < r) {

            bool ck = check(graph, mid, k);

            if (!ck) {
                r = mid - 1;
            } else {
                l = mid + 1;
            }
        }

        is[k] = check(graph, l, k);
        x[k] = l;
    }
    // cout<<" => "<<l<<" "<<r<<endl;

    for(int i = 0; i < q; i++) {
        ll l, r; cin>>l>>r;
        l--; r--;
        //l = 0, r = min(q - 1, (ll)i);

        if(n <= 2050 && q <= 2050) {

            cout<<(check(graph, r, l) ? "YES" : "NO")<<endl;
            continue;
        }
        if( x[l] < r) cout<<"NO"<<endl;
        else if(r < x[l]) cout<<"YES"<<endl;
        else {
            cout<<(is[l] ? "YES" : "NO")<<endl;
        }

    }

}

int main() {
    //fastIO

    //freopen("file.in", "r", stdin);
    //freopen("file.out", "w", stdout);

    ll t = 0; solve(t);
}

Compilation message

Joker.cpp: In function 'bool bi(std::vector<std::vector<node> >&, std::vector<long long int>&, long long int, long long int, long long int, long long int, long long int)':
Joker.cpp:22:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   22 |     for(auto [el, i] : graph[startIndex]) {
      |              ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 50 ms 552 KB Output is correct
30 Correct 104 ms 628 KB Output is correct
31 Correct 101 ms 604 KB Output is correct
32 Correct 71 ms 624 KB Output is correct
33 Correct 48 ms 600 KB Output is correct
34 Correct 107 ms 648 KB Output is correct
35 Correct 110 ms 660 KB Output is correct
36 Correct 30 ms 856 KB Output is correct
37 Correct 59 ms 600 KB Output is correct
38 Correct 50 ms 604 KB Output is correct
39 Correct 76 ms 648 KB Output is correct
40 Correct 63 ms 660 KB Output is correct
41 Correct 65 ms 604 KB Output is correct
42 Correct 70 ms 868 KB Output is correct
43 Correct 33 ms 600 KB Output is correct
44 Correct 65 ms 600 KB Output is correct
45 Correct 79 ms 600 KB Output is correct
46 Correct 86 ms 600 KB Output is correct
47 Correct 61 ms 1116 KB Output is correct
48 Correct 69 ms 600 KB Output is correct
49 Correct 85 ms 604 KB Output is correct
50 Correct 101 ms 620 KB Output is correct
51 Correct 56 ms 624 KB Output is correct
52 Correct 75 ms 644 KB Output is correct
53 Correct 88 ms 604 KB Output is correct
54 Correct 107 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 577 ms 20668 KB Output is correct
4 Correct 716 ms 21520 KB Output is correct
5 Correct 555 ms 18956 KB Output is correct
6 Correct 593 ms 19008 KB Output is correct
7 Correct 595 ms 18708 KB Output is correct
8 Correct 538 ms 17352 KB Output is correct
9 Correct 693 ms 19780 KB Output is correct
10 Correct 744 ms 20392 KB Output is correct
11 Correct 546 ms 17896 KB Output is correct
12 Correct 713 ms 18504 KB Output is correct
13 Correct 433 ms 14424 KB Output is correct
14 Correct 542 ms 17032 KB Output is correct
15 Correct 719 ms 20484 KB Output is correct
16 Correct 820 ms 20392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 577 ms 20668 KB Output is correct
30 Correct 716 ms 21520 KB Output is correct
31 Correct 555 ms 18956 KB Output is correct
32 Correct 593 ms 19008 KB Output is correct
33 Correct 595 ms 18708 KB Output is correct
34 Correct 538 ms 17352 KB Output is correct
35 Correct 693 ms 19780 KB Output is correct
36 Correct 744 ms 20392 KB Output is correct
37 Correct 546 ms 17896 KB Output is correct
38 Correct 713 ms 18504 KB Output is correct
39 Correct 433 ms 14424 KB Output is correct
40 Correct 542 ms 17032 KB Output is correct
41 Correct 719 ms 20484 KB Output is correct
42 Correct 820 ms 20392 KB Output is correct
43 Incorrect 637 ms 19956 KB Output isn't correct
44 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 50 ms 552 KB Output is correct
30 Correct 104 ms 628 KB Output is correct
31 Correct 101 ms 604 KB Output is correct
32 Correct 71 ms 624 KB Output is correct
33 Correct 48 ms 600 KB Output is correct
34 Correct 107 ms 648 KB Output is correct
35 Correct 110 ms 660 KB Output is correct
36 Correct 30 ms 856 KB Output is correct
37 Correct 59 ms 600 KB Output is correct
38 Correct 50 ms 604 KB Output is correct
39 Correct 76 ms 648 KB Output is correct
40 Correct 63 ms 660 KB Output is correct
41 Correct 65 ms 604 KB Output is correct
42 Correct 70 ms 868 KB Output is correct
43 Correct 33 ms 600 KB Output is correct
44 Correct 65 ms 600 KB Output is correct
45 Correct 79 ms 600 KB Output is correct
46 Correct 86 ms 600 KB Output is correct
47 Correct 61 ms 1116 KB Output is correct
48 Correct 69 ms 600 KB Output is correct
49 Correct 85 ms 604 KB Output is correct
50 Correct 101 ms 620 KB Output is correct
51 Correct 56 ms 624 KB Output is correct
52 Correct 75 ms 644 KB Output is correct
53 Correct 88 ms 604 KB Output is correct
54 Correct 107 ms 600 KB Output is correct
55 Incorrect 311 ms 23700 KB Output isn't correct
56 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 50 ms 552 KB Output is correct
30 Correct 104 ms 628 KB Output is correct
31 Correct 101 ms 604 KB Output is correct
32 Correct 71 ms 624 KB Output is correct
33 Correct 48 ms 600 KB Output is correct
34 Correct 107 ms 648 KB Output is correct
35 Correct 110 ms 660 KB Output is correct
36 Correct 30 ms 856 KB Output is correct
37 Correct 59 ms 600 KB Output is correct
38 Correct 50 ms 604 KB Output is correct
39 Correct 76 ms 648 KB Output is correct
40 Correct 63 ms 660 KB Output is correct
41 Correct 65 ms 604 KB Output is correct
42 Correct 70 ms 868 KB Output is correct
43 Correct 33 ms 600 KB Output is correct
44 Correct 65 ms 600 KB Output is correct
45 Correct 79 ms 600 KB Output is correct
46 Correct 86 ms 600 KB Output is correct
47 Correct 61 ms 1116 KB Output is correct
48 Correct 69 ms 600 KB Output is correct
49 Correct 85 ms 604 KB Output is correct
50 Correct 101 ms 620 KB Output is correct
51 Correct 56 ms 624 KB Output is correct
52 Correct 75 ms 644 KB Output is correct
53 Correct 88 ms 604 KB Output is correct
54 Correct 107 ms 600 KB Output is correct
55 Correct 577 ms 20668 KB Output is correct
56 Correct 716 ms 21520 KB Output is correct
57 Correct 555 ms 18956 KB Output is correct
58 Correct 593 ms 19008 KB Output is correct
59 Correct 595 ms 18708 KB Output is correct
60 Correct 538 ms 17352 KB Output is correct
61 Correct 693 ms 19780 KB Output is correct
62 Correct 744 ms 20392 KB Output is correct
63 Correct 546 ms 17896 KB Output is correct
64 Correct 713 ms 18504 KB Output is correct
65 Correct 433 ms 14424 KB Output is correct
66 Correct 542 ms 17032 KB Output is correct
67 Correct 719 ms 20484 KB Output is correct
68 Correct 820 ms 20392 KB Output is correct
69 Incorrect 637 ms 19956 KB Output isn't correct
70 Halted 0 ms 0 KB -