oj.uz

Submission #914276

# Submission time Handle Problem Language Result Execution time Memory
914276 2024-01-21T13:49:14 Z 3as8 Joker (BOI20_joker) C++14
14 / 100
 2000 ms 25152 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;
}

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});
    }

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

        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, r);
          /*  cout<<ans<<endl;
            for(auto el : col) cout<<el<<" ";
            cout<<endl;*/
        }

        cout<<(!ans ? "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]) {
      |              ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 412 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 600 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 344 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 436 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 412 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 600 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 344 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 436 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 50 ms 348 KB Output is correct
30 Correct 108 ms 660 KB Output is correct
31 Correct 96 ms 604 KB Output is correct
32 Correct 72 ms 604 KB Output is correct
33 Correct 46 ms 600 KB Output is correct
34 Correct 106 ms 680 KB Output is correct
35 Correct 109 ms 604 KB Output is correct
36 Correct 29 ms 604 KB Output is correct
37 Correct 64 ms 704 KB Output is correct
38 Correct 51 ms 760 KB Output is correct
39 Correct 80 ms 672 KB Output is correct
40 Correct 63 ms 600 KB Output is correct
41 Correct 70 ms 924 KB Output is correct
42 Correct 63 ms 600 KB Output is correct
43 Correct 36 ms 604 KB Output is correct
44 Correct 60 ms 604 KB Output is correct
45 Correct 85 ms 604 KB Output is correct
46 Correct 89 ms 600 KB Output is correct
47 Correct 57 ms 600 KB Output is correct
48 Correct 75 ms 604 KB Output is correct
49 Correct 84 ms 656 KB Output is correct
50 Correct 104 ms 604 KB Output is correct
51 Correct 54 ms 644 KB Output is correct
52 Correct 75 ms 660 KB Output is correct
53 Correct 87 ms 672 KB Output is correct
54 Correct 111 ms 676 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 2041 ms 22428 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 412 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 600 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 344 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 436 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Execution timed out 2041 ms 22428 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 412 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 600 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 344 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 436 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 50 ms 348 KB Output is correct
30 Correct 108 ms 660 KB Output is correct
31 Correct 96 ms 604 KB Output is correct
32 Correct 72 ms 604 KB Output is correct
33 Correct 46 ms 600 KB Output is correct
34 Correct 106 ms 680 KB Output is correct
35 Correct 109 ms 604 KB Output is correct
36 Correct 29 ms 604 KB Output is correct
37 Correct 64 ms 704 KB Output is correct
38 Correct 51 ms 760 KB Output is correct
39 Correct 80 ms 672 KB Output is correct
40 Correct 63 ms 600 KB Output is correct
41 Correct 70 ms 924 KB Output is correct
42 Correct 63 ms 600 KB Output is correct
43 Correct 36 ms 604 KB Output is correct
44 Correct 60 ms 604 KB Output is correct
45 Correct 85 ms 604 KB Output is correct
46 Correct 89 ms 600 KB Output is correct
47 Correct 57 ms 600 KB Output is correct
48 Correct 75 ms 604 KB Output is correct
49 Correct 84 ms 656 KB Output is correct
50 Correct 104 ms 604 KB Output is correct
51 Correct 54 ms 644 KB Output is correct
52 Correct 75 ms 660 KB Output is correct
53 Correct 87 ms 672 KB Output is correct
54 Correct 111 ms 676 KB Output is correct
55 Execution timed out 2035 ms 25152 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 412 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 600 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 344 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 436 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 50 ms 348 KB Output is correct
30 Correct 108 ms 660 KB Output is correct
31 Correct 96 ms 604 KB Output is correct
32 Correct 72 ms 604 KB Output is correct
33 Correct 46 ms 600 KB Output is correct
34 Correct 106 ms 680 KB Output is correct
35 Correct 109 ms 604 KB Output is correct
36 Correct 29 ms 604 KB Output is correct
37 Correct 64 ms 704 KB Output is correct
38 Correct 51 ms 760 KB Output is correct
39 Correct 80 ms 672 KB Output is correct
40 Correct 63 ms 600 KB Output is correct
41 Correct 70 ms 924 KB Output is correct
42 Correct 63 ms 600 KB Output is correct
43 Correct 36 ms 604 KB Output is correct
44 Correct 60 ms 604 KB Output is correct
45 Correct 85 ms 604 KB Output is correct
46 Correct 89 ms 600 KB Output is correct
47 Correct 57 ms 600 KB Output is correct
48 Correct 75 ms 604 KB Output is correct
49 Correct 84 ms 656 KB Output is correct
50 Correct 104 ms 604 KB Output is correct
51 Correct 54 ms 644 KB Output is correct
52 Correct 75 ms 660 KB Output is correct
53 Correct 87 ms 672 KB Output is correct
54 Correct 111 ms 676 KB Output is correct
55 Execution timed out 2041 ms 22428 KB Time limit exceeded
56 Halted 0 ms 0 KB -