oj.uz

Submission #765579

# Submission time Handle Problem Language Result Execution time Memory
765579 2023-06-24T21:12:10 Z oyber Joker (BOI20_joker) C++14
49 / 100
 2000 ms 10612 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
#include <functional>
#include <stack>
using namespace std;

vector<int> u;
vector<int> s;
vector<int> p;

int find(int n) {
    if (u[n] == n) return n;
    return find(u[n]);
}

int parity(int n) {
    if (u[n] == n) return 0;
    return parity(u[n])^p[n];
}

struct UniteInfo {
    int a;
    int b;
    int sa;
};

UniteInfo unite(int a, int b) {
    int ap = find(a);
    int bp = find(b);
    if (s[bp] > s[ap]) {
        swap(a, b);
        swap(ap, bp);
    }
    u[bp] = ap;
    s[ap] += s[bp];
    if (parity(a) == parity(b)) {
        p[bp] = 1;
    } else {
        p[bp] = 0;
    }
    return UniteInfo {
        ap,
        bp,
        s[ap] - s[bp],
    };
}

void undo(UniteInfo info) {
    u[info.b] = info.b;
    s[info.a] = info.sa;
    p[info.b] = 0;
}

struct Query {
    int l;
    int r;
    int i;
};

bool comp_query(Query q1, Query q2) {
    return q1.r > q2.r;
}

bool comp_query2(Query q1, Query q2) {
    return q1.l < q2.l;
}

int main() {
    int n, m, qn;
    scanf("%d %d %d", &n, &m, &qn);

    u.resize(n);
    s.resize(n, 1);
    p.resize(n);


    vector<pair<int, int>> e(m);
    for (int i = 0; i < m; i++) {
        int a, b; 
        scanf("%d %d", &a, &b);
        a--;b--;
        e[i] = make_pair(a, b);
        //printf("%d %d %d\n", a, b, i);
    }

    vector<Query> q(qn);
    for (int i = 0; i < qn; i++) {
        int l, r;
        scanf("%d %d", &l, &r);
        l--;r--;
        q[i] = Query{l,r,i};
    }
    sort(q.begin(), q.end(), comp_query2);

    int group_size = 512;
    int group_num = (q[q.size()-1].l+group_size) / group_size;
    //printf("%d %d\n", int(q[q.size()-1].l), group_num);
    vector<vector<Query>> groups(group_num);
    int j = 0;
    for (int i = 0; i < group_num; i++) {
        while (j < qn) {
            if (q[j].l >= (i+1)*group_size) break;
            groups[i].push_back(q[j]);
            //printf("g: %d q: %d\n", i, q[j].i);
            j++;
        }
        sort(groups[i].begin(), groups[i].end(), comp_query);
    }

    stack<UniteInfo> infos;
    vector<bool> result(qn);
    for (int j = 0; j < group_num; j++) {
        //reset state
        for (int i = 0; i < n; i++) {
            u[i] = i;
            s[i] = 1;
            p[i] = 0;
        }

        bool l_cycle = false;
        int current_l = 0;
        for (; current_l < j*group_size; current_l++) {
            int a = e[current_l].first;
            int b = e[current_l].second;
            //printf("%d %d %d\n", current_l, a, b);
            if (find(a) == find(b)) {
                if (parity(a) == parity(b)) {
                    l_cycle = true;
                    break;
                }
            } else {
                unite(a, b);
            }
        }
        //printf("l: %d\n", current_l);


        int current_r = m-1;
        bool r_cycle = false;
        for (int i = 0; i < int(groups[j].size()); i++) {
            if (r_cycle || l_cycle) {
                result[groups[j][i].i] = true;
                continue;
            }
            int l = groups[j][i].l;
            int r = groups[j][i].r;
            //printf("%d: %d %d\n", i, l, r);

            while (current_r > r) {
                int a = e[current_r].first;
                int b = e[current_r].second;
                //printf("%d %d %d\n", current_r, a, b);
                if (find(a) == find(b)) {
                    if (parity(a) == parity(b)) {
                        r_cycle = true;
                        break;
                    }
                } else {
                    unite(a, b);
                }
                current_r--;
            }

            if (r_cycle) {
                result[groups[j][i].i] = true;
                continue;
            }

            bool cycle = false;
            for (int c_l = current_l; c_l < l; c_l++) {
                int a = e[c_l].first;
                int b = e[c_l].second;
                //printf("%d %d %d\n", current_l, a, b);
                if (find(a) == find(b)) {
                    if (parity(a) == parity(b)) {
                        cycle = true;
                        break;
                    }
                } else {
                    infos.push(unite(a, b));
                }
            }
            if (cycle) {
                result[groups[j][i].i] = true;
            }
            while (infos.size() > 0) {
                undo(infos.top());
                infos.pop();
            }
        }
    }

    for (int i = 0; i < qn; i++) {
        if (result[i]) {
            printf("YES\n");
        } else {
            printf("NO\n");
        }
    }
}

Compilation message

Joker.cpp: In function 'int main()':
Joker.cpp:71:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     scanf("%d %d %d", &n, &m, &qn);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:81:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         scanf("%d %d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~~
Joker.cpp:90:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |         scanf("%d %d", &l, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 288 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 9 ms 340 KB Output is correct
30 Correct 5 ms 340 KB Output is correct
31 Correct 4 ms 380 KB Output is correct
32 Correct 3 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 4 ms 380 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 4 ms 368 KB Output is correct
37 Correct 7 ms 340 KB Output is correct
38 Correct 9 ms 340 KB Output is correct
39 Correct 6 ms 340 KB Output is correct
40 Correct 4 ms 340 KB Output is correct
41 Correct 4 ms 308 KB Output is correct
42 Correct 4 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 4 ms 340 KB Output is correct
47 Correct 4 ms 340 KB Output is correct
48 Correct 4 ms 340 KB Output is correct
49 Correct 4 ms 340 KB Output is correct
50 Correct 4 ms 376 KB Output is correct
51 Correct 4 ms 340 KB Output is correct
52 Correct 4 ms 340 KB Output is correct
53 Correct 4 ms 340 KB Output is correct
54 Correct 5 ms 340 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 77 ms 8532 KB Output is correct
4 Correct 80 ms 9740 KB Output is correct
5 Correct 81 ms 9512 KB Output is correct
6 Correct 74 ms 8556 KB Output is correct
7 Correct 74 ms 8560 KB Output is correct
8 Correct 79 ms 8108 KB Output is correct
9 Correct 74 ms 8564 KB Output is correct
10 Correct 79 ms 9860 KB Output is correct
11 Correct 74 ms 8572 KB Output is correct
12 Correct 76 ms 9468 KB Output is correct
13 Correct 75 ms 7580 KB Output is correct
14 Correct 75 ms 8000 KB Output is correct
15 Correct 77 ms 9028 KB Output is correct
16 Correct 77 ms 9732 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 288 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 77 ms 8532 KB Output is correct
30 Correct 80 ms 9740 KB Output is correct
31 Correct 81 ms 9512 KB Output is correct
32 Correct 74 ms 8556 KB Output is correct
33 Correct 74 ms 8560 KB Output is correct
34 Correct 79 ms 8108 KB Output is correct
35 Correct 74 ms 8564 KB Output is correct
36 Correct 79 ms 9860 KB Output is correct
37 Correct 74 ms 8572 KB Output is correct
38 Correct 76 ms 9468 KB Output is correct
39 Correct 75 ms 7580 KB Output is correct
40 Correct 75 ms 8000 KB Output is correct
41 Correct 77 ms 9028 KB Output is correct
42 Correct 77 ms 9732 KB Output is correct
43 Correct 376 ms 8512 KB Output is correct
44 Correct 428 ms 10612 KB Output is correct
45 Correct 429 ms 10548 KB Output is correct
46 Correct 325 ms 9532 KB Output is correct
47 Correct 338 ms 9356 KB Output is correct
48 Correct 123 ms 9524 KB Output is correct
49 Correct 148 ms 9792 KB Output is correct
50 Correct 284 ms 8296 KB Output is correct
51 Correct 360 ms 9024 KB Output is correct
52 Correct 381 ms 9740 KB Output is correct
53 Correct 224 ms 7616 KB Output is correct
54 Correct 418 ms 8296 KB Output is correct
55 Correct 439 ms 9024 KB Output is correct
56 Correct 464 ms 10136 KB Output is correct

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 288 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 9 ms 340 KB Output is correct
30 Correct 5 ms 340 KB Output is correct
31 Correct 4 ms 380 KB Output is correct
32 Correct 3 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 4 ms 380 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 4 ms 368 KB Output is correct
37 Correct 7 ms 340 KB Output is correct
38 Correct 9 ms 340 KB Output is correct
39 Correct 6 ms 340 KB Output is correct
40 Correct 4 ms 340 KB Output is correct
41 Correct 4 ms 308 KB Output is correct
42 Correct 4 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 4 ms 340 KB Output is correct
47 Correct 4 ms 340 KB Output is correct
48 Correct 4 ms 340 KB Output is correct
49 Correct 4 ms 340 KB Output is correct
50 Correct 4 ms 376 KB Output is correct
51 Correct 4 ms 340 KB Output is correct
52 Correct 4 ms 340 KB Output is correct
53 Correct 4 ms 340 KB Output is correct
54 Correct 5 ms 340 KB Output is correct
55 Correct 916 ms 4012 KB Output is correct
56 Execution timed out 2011 ms 6732 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 288 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 9 ms 340 KB Output is correct
30 Correct 5 ms 340 KB Output is correct
31 Correct 4 ms 380 KB Output is correct
32 Correct 3 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 4 ms 380 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 4 ms 368 KB Output is correct
37 Correct 7 ms 340 KB Output is correct
38 Correct 9 ms 340 KB Output is correct
39 Correct 6 ms 340 KB Output is correct
40 Correct 4 ms 340 KB Output is correct
41 Correct 4 ms 308 KB Output is correct
42 Correct 4 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 4 ms 340 KB Output is correct
47 Correct 4 ms 340 KB Output is correct
48 Correct 4 ms 340 KB Output is correct
49 Correct 4 ms 340 KB Output is correct
50 Correct 4 ms 376 KB Output is correct
51 Correct 4 ms 340 KB Output is correct
52 Correct 4 ms 340 KB Output is correct
53 Correct 4 ms 340 KB Output is correct
54 Correct 5 ms 340 KB Output is correct
55 Correct 77 ms 8532 KB Output is correct
56 Correct 80 ms 9740 KB Output is correct
57 Correct 81 ms 9512 KB Output is correct
58 Correct 74 ms 8556 KB Output is correct
59 Correct 74 ms 8560 KB Output is correct
60 Correct 79 ms 8108 KB Output is correct
61 Correct 74 ms 8564 KB Output is correct
62 Correct 79 ms 9860 KB Output is correct
63 Correct 74 ms 8572 KB Output is correct
64 Correct 76 ms 9468 KB Output is correct
65 Correct 75 ms 7580 KB Output is correct
66 Correct 75 ms 8000 KB Output is correct
67 Correct 77 ms 9028 KB Output is correct
68 Correct 77 ms 9732 KB Output is correct
69 Correct 376 ms 8512 KB Output is correct
70 Correct 428 ms 10612 KB Output is correct
71 Correct 429 ms 10548 KB Output is correct
72 Correct 325 ms 9532 KB Output is correct
73 Correct 338 ms 9356 KB Output is correct
74 Correct 123 ms 9524 KB Output is correct
75 Correct 148 ms 9792 KB Output is correct
76 Correct 284 ms 8296 KB Output is correct
77 Correct 360 ms 9024 KB Output is correct
78 Correct 381 ms 9740 KB Output is correct
79 Correct 224 ms 7616 KB Output is correct
80 Correct 418 ms 8296 KB Output is correct
81 Correct 439 ms 9024 KB Output is correct
82 Correct 464 ms 10136 KB Output is correct
83 Correct 916 ms 4012 KB Output is correct
84 Execution timed out 2011 ms 6732 KB Time limit exceeded
85 Halted 0 ms 0 KB -