oj.uz

Submission #679011

# Submission time Handle Problem Language Result Execution time Memory
679011 2023-01-07T07:56:49 Z qwerasdfzxcl Bridges (APIO19_bridges) C++17
100 / 100
 1976 ms 10180 KB 
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
constexpr int B = 400;
struct DSU{
    int path[50050], sz[50050];
    vector<pair<int, int>> mylog;

    void init(int n){mylog.clear(); for (int i=1;i<=n;i++) path[i] = i, sz[i] = 1;}

    int find(int s){
        if (s==path[s]) return s;
        return find(path[s]);
    }
    bool merge(int s, int v){
        s = find(s), v = find(v);
        if (s==v) return 0;
        if (sz[s] > sz[v]) swap(s, v);

        mylog.emplace_back(s, sz[s]);
        path[s] = v;
        sz[v] += sz[s];
        return 1;
    }
    int size(int s){return sz[find(s)];}
    void rollback(int c){
        for (int z=0;z<c;z++){
            auto [s, _sz] = mylog.back(); mylog.pop_back();
            sz[path[s]] -= _sz;
            path[s] = s;
        }
    }
}dsu;

int U[100100], V[100100], D[100100], op[100100], qa[100100], qb[100100], uc[100100], ans[100100], chk[100100];

bool cmp(int i, int j){return D[i] > D[j];}
bool cmp2(int i, int j){
    if (uc[i]/B == uc[j]/B){
        if (op[i]==op[j]){
            if (op[i]==1) return uc[i] < uc[j];
            return qb[i] > qb[j];
        }
        return op[i] < op[j];
    }
    return uc[i]/B < uc[j]/B;
}


int main(){
    int n, m;
    scanf("%d %d", &n, &m);
    vector<int> I, qI;

    for (int i=1;i<=m;i++){
        scanf("%d %d %d", U+i, V+i, D+i);
        I.push_back(i);
    }

    int q;
    scanf("%d", &q);
    for (int i=1;i<=q;i++){
        scanf("%d %d %d", op+i, qa+i, qb+i);
        uc[i] = uc[i-1] + (op[i]==1);
        qI.push_back(i);
    }

    sort(I.begin(), I.end(), cmp);
    sort(qI.begin(), qI.end(), cmp2);

    for (int i=0;i<q;){
        int r = i, r2 = i;
        while(r<q && uc[qI[i]]/B == uc[qI[r]]/B) ++r;
        while(r2<q && op[qI[r2]]==1){
            chk[qa[qI[r2]]] = D[qa[qI[r2]]];
            ++r2;
        }

        dsu.init(n);
        int pt = 0;
        for (int j=r2;j<r;j++){
            assert(op[qI[j]]==2);
            while(pt < m && qb[qI[j]] <= D[I[pt]]){
                if (chk[I[pt]]) {++pt; continue;}
                dsu.merge(U[I[pt]], V[I[pt]]);
                ++pt;
            }

            for (int k=i;k<r2;k++){
                if (uc[qI[k]] > uc[qI[j]]) break;
                chk[qa[qI[k]]] = qb[qI[k]];
            }

            int cnt = 0;
            for (int k=i;k<r2;k++){
                if (chk[qa[qI[k]]] >= qb[qI[j]]){
                    if (dsu.merge(U[qa[qI[k]]], V[qa[qI[k]]])) cnt++;
                }
            }

            for (int k=i;k<r2;k++){
                if (uc[qI[k]] > uc[qI[j]]) break;
                chk[qa[qI[k]]] = D[qa[qI[k]]];
            }

            ans[qI[j]] = dsu.size(qa[qI[j]]);
            //printf("ok ans[%d] = %d\n", qI[j], ans[qI[j]]);

            dsu.rollback(cnt);
        }

        vector<int> I1, I2;
        for (auto &x:I){
            if (chk[x]){
                I2.push_back(x);
                chk[x] = 0;
            }
            else I1.push_back(x);
        }

        for (int j=i;j<r2;j++) D[qa[qI[j]]] = qb[qI[j]];
        sort(I2.begin(), I2.end(), cmp);
        merge(I1.begin(), I1.end(), I2.begin(), I2.end(), I.begin(), cmp);

        i = r;
    }

    for (int i=1;i<=q;i++) if (op[i]==2) printf("%d\n", ans[i]);
    return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
bridges.cpp:57:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         scanf("%d %d %d", U+i, V+i, D+i);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:62:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
bridges.cpp:64:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |         scanf("%d %d %d", op+i, qa+i, qb+i);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 29 ms 664 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 36 ms 708 KB Output is correct
6 Correct 28 ms 728 KB Output is correct
7 Correct 29 ms 596 KB Output is correct
8 Correct 36 ms 724 KB Output is correct
9 Correct 31 ms 688 KB Output is correct
10 Correct 35 ms 732 KB Output is correct
11 Correct 36 ms 724 KB Output is correct
12 Correct 40 ms 740 KB Output is correct
13 Correct 39 ms 724 KB Output is correct
14 Correct 41 ms 704 KB Output is correct
15 Correct 44 ms 732 KB Output is correct
16 Correct 38 ms 804 KB Output is correct
17 Correct 37 ms 800 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 932 ms 4924 KB Output is correct
2 Correct 989 ms 7608 KB Output is correct
3 Correct 955 ms 7564 KB Output is correct
4 Correct 957 ms 7672 KB Output is correct
5 Correct 964 ms 7628 KB Output is correct
6 Correct 1433 ms 7396 KB Output is correct
7 Correct 1429 ms 7372 KB Output is correct
8 Correct 1405 ms 7388 KB Output is correct
9 Correct 63 ms 4264 KB Output is correct
10 Correct 1000 ms 6656 KB Output is correct
11 Correct 919 ms 6660 KB Output is correct
12 Correct 1976 ms 7396 KB Output is correct
13 Correct 772 ms 7652 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 788 ms 4404 KB Output is correct
2 Correct 646 ms 4760 KB Output is correct
3 Correct 845 ms 6488 KB Output is correct
4 Correct 760 ms 6808 KB Output is correct
5 Correct 51 ms 4264 KB Output is correct
6 Correct 857 ms 6600 KB Output is correct
7 Correct 700 ms 6568 KB Output is correct
8 Correct 609 ms 6588 KB Output is correct
9 Correct 1150 ms 6876 KB Output is correct
10 Correct 831 ms 6704 KB Output is correct
11 Correct 494 ms 6468 KB Output is correct
12 Correct 460 ms 6560 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 5708 KB Output is correct
2 Correct 59 ms 2884 KB Output is correct
3 Correct 47 ms 2940 KB Output is correct
4 Correct 39 ms 3036 KB Output is correct
5 Correct 74 ms 5716 KB Output is correct
6 Correct 99 ms 5688 KB Output is correct
7 Correct 77 ms 5652 KB Output is correct
8 Correct 78 ms 4612 KB Output is correct
9 Correct 78 ms 4684 KB Output is correct
10 Correct 77 ms 4692 KB Output is correct
11 Correct 91 ms 5384 KB Output is correct
12 Correct 89 ms 5364 KB Output is correct
13 Correct 90 ms 5324 KB Output is correct
14 Correct 82 ms 5652 KB Output is correct
15 Correct 75 ms 5672 KB Output is correct
16 Correct 101 ms 5704 KB Output is correct
17 Correct 100 ms 5768 KB Output is correct
18 Correct 103 ms 5736 KB Output is correct
19 Correct 100 ms 5728 KB Output is correct
20 Correct 95 ms 5512 KB Output is correct
21 Correct 92 ms 5504 KB Output is correct
22 Correct 98 ms 5708 KB Output is correct
23 Correct 72 ms 5320 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 932 ms 4924 KB Output is correct
2 Correct 989 ms 7608 KB Output is correct
3 Correct 955 ms 7564 KB Output is correct
4 Correct 957 ms 7672 KB Output is correct
5 Correct 964 ms 7628 KB Output is correct
6 Correct 1433 ms 7396 KB Output is correct
7 Correct 1429 ms 7372 KB Output is correct
8 Correct 1405 ms 7388 KB Output is correct
9 Correct 63 ms 4264 KB Output is correct
10 Correct 1000 ms 6656 KB Output is correct
11 Correct 919 ms 6660 KB Output is correct
12 Correct 1976 ms 7396 KB Output is correct
13 Correct 772 ms 7652 KB Output is correct
14 Correct 788 ms 4404 KB Output is correct
15 Correct 646 ms 4760 KB Output is correct
16 Correct 845 ms 6488 KB Output is correct
17 Correct 760 ms 6808 KB Output is correct
18 Correct 51 ms 4264 KB Output is correct
19 Correct 857 ms 6600 KB Output is correct
20 Correct 700 ms 6568 KB Output is correct
21 Correct 609 ms 6588 KB Output is correct
22 Correct 1150 ms 6876 KB Output is correct
23 Correct 831 ms 6704 KB Output is correct
24 Correct 494 ms 6468 KB Output is correct
25 Correct 460 ms 6560 KB Output is correct
26 Correct 992 ms 7884 KB Output is correct
27 Correct 1211 ms 7448 KB Output is correct
28 Correct 982 ms 7656 KB Output is correct
29 Correct 709 ms 7692 KB Output is correct
30 Correct 1156 ms 7524 KB Output is correct
31 Correct 1150 ms 7556 KB Output is correct
32 Correct 1152 ms 7432 KB Output is correct
33 Correct 957 ms 7660 KB Output is correct
34 Correct 981 ms 7668 KB Output is correct
35 Correct 976 ms 7660 KB Output is correct
36 Correct 734 ms 7728 KB Output is correct
37 Correct 725 ms 7620 KB Output is correct
38 Correct 723 ms 7612 KB Output is correct
39 Correct 695 ms 7656 KB Output is correct
40 Correct 675 ms 7816 KB Output is correct
41 Correct 661 ms 7656 KB Output is correct
42 Correct 661 ms 7560 KB Output is correct
43 Correct 692 ms 7588 KB Output is correct
44 Correct 665 ms 7628 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 29 ms 664 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 36 ms 708 KB Output is correct
6 Correct 28 ms 728 KB Output is correct
7 Correct 29 ms 596 KB Output is correct
8 Correct 36 ms 724 KB Output is correct
9 Correct 31 ms 688 KB Output is correct
10 Correct 35 ms 732 KB Output is correct
11 Correct 36 ms 724 KB Output is correct
12 Correct 40 ms 740 KB Output is correct
13 Correct 39 ms 724 KB Output is correct
14 Correct 41 ms 704 KB Output is correct
15 Correct 44 ms 732 KB Output is correct
16 Correct 38 ms 804 KB Output is correct
17 Correct 37 ms 800 KB Output is correct
18 Correct 932 ms 4924 KB Output is correct
19 Correct 989 ms 7608 KB Output is correct
20 Correct 955 ms 7564 KB Output is correct
21 Correct 957 ms 7672 KB Output is correct
22 Correct 964 ms 7628 KB Output is correct
23 Correct 1433 ms 7396 KB Output is correct
24 Correct 1429 ms 7372 KB Output is correct
25 Correct 1405 ms 7388 KB Output is correct
26 Correct 63 ms 4264 KB Output is correct
27 Correct 1000 ms 6656 KB Output is correct
28 Correct 919 ms 6660 KB Output is correct
29 Correct 1976 ms 7396 KB Output is correct
30 Correct 772 ms 7652 KB Output is correct
31 Correct 788 ms 4404 KB Output is correct
32 Correct 646 ms 4760 KB Output is correct
33 Correct 845 ms 6488 KB Output is correct
34 Correct 760 ms 6808 KB Output is correct
35 Correct 51 ms 4264 KB Output is correct
36 Correct 857 ms 6600 KB Output is correct
37 Correct 700 ms 6568 KB Output is correct
38 Correct 609 ms 6588 KB Output is correct
39 Correct 1150 ms 6876 KB Output is correct
40 Correct 831 ms 6704 KB Output is correct
41 Correct 494 ms 6468 KB Output is correct
42 Correct 460 ms 6560 KB Output is correct
43 Correct 106 ms 5708 KB Output is correct
44 Correct 59 ms 2884 KB Output is correct
45 Correct 47 ms 2940 KB Output is correct
46 Correct 39 ms 3036 KB Output is correct
47 Correct 74 ms 5716 KB Output is correct
48 Correct 99 ms 5688 KB Output is correct
49 Correct 77 ms 5652 KB Output is correct
50 Correct 78 ms 4612 KB Output is correct
51 Correct 78 ms 4684 KB Output is correct
52 Correct 77 ms 4692 KB Output is correct
53 Correct 91 ms 5384 KB Output is correct
54 Correct 89 ms 5364 KB Output is correct
55 Correct 90 ms 5324 KB Output is correct
56 Correct 82 ms 5652 KB Output is correct
57 Correct 75 ms 5672 KB Output is correct
58 Correct 101 ms 5704 KB Output is correct
59 Correct 100 ms 5768 KB Output is correct
60 Correct 103 ms 5736 KB Output is correct
61 Correct 100 ms 5728 KB Output is correct
62 Correct 95 ms 5512 KB Output is correct
63 Correct 92 ms 5504 KB Output is correct
64 Correct 98 ms 5708 KB Output is correct
65 Correct 72 ms 5320 KB Output is correct
66 Correct 992 ms 7884 KB Output is correct
67 Correct 1211 ms 7448 KB Output is correct
68 Correct 982 ms 7656 KB Output is correct
69 Correct 709 ms 7692 KB Output is correct
70 Correct 1156 ms 7524 KB Output is correct
71 Correct 1150 ms 7556 KB Output is correct
72 Correct 1152 ms 7432 KB Output is correct
73 Correct 957 ms 7660 KB Output is correct
74 Correct 981 ms 7668 KB Output is correct
75 Correct 976 ms 7660 KB Output is correct
76 Correct 734 ms 7728 KB Output is correct
77 Correct 725 ms 7620 KB Output is correct
78 Correct 723 ms 7612 KB Output is correct
79 Correct 695 ms 7656 KB Output is correct
80 Correct 675 ms 7816 KB Output is correct
81 Correct 661 ms 7656 KB Output is correct
82 Correct 661 ms 7560 KB Output is correct
83 Correct 692 ms 7588 KB Output is correct
84 Correct 665 ms 7628 KB Output is correct
85 Correct 1120 ms 10180 KB Output is correct
86 Correct 112 ms 5332 KB Output is correct
87 Correct 101 ms 5460 KB Output is correct
88 Correct 978 ms 8692 KB Output is correct
89 Correct 1132 ms 10100 KB Output is correct
90 Correct 946 ms 8328 KB Output is correct
91 Correct 998 ms 7528 KB Output is correct
92 Correct 980 ms 7656 KB Output is correct
93 Correct 1420 ms 7472 KB Output is correct
94 Correct 1067 ms 8868 KB Output is correct
95 Correct 1062 ms 9036 KB Output is correct
96 Correct 1187 ms 8740 KB Output is correct
97 Correct 777 ms 8364 KB Output is correct
98 Correct 1143 ms 8476 KB Output is correct
99 Correct 1173 ms 10048 KB Output is correct
100 Correct 1157 ms 10056 KB Output is correct
101 Correct 1253 ms 10116 KB Output is correct
102 Correct 1254 ms 10124 KB Output is correct
103 Correct 1279 ms 9052 KB Output is correct
104 Correct 1301 ms 9172 KB Output is correct
105 Correct 1231 ms 9368 KB Output is correct
106 Correct 1145 ms 9096 KB Output is correct
107 Correct 1320 ms 9076 KB Output is correct
108 Correct 1121 ms 9616 KB Output is correct
109 Correct 999 ms 7740 KB Output is correct