oj.uz

Submission #679025

# Submission time Handle Problem Language Result Execution time Memory
679025 2023-01-07T08:08:26 Z qwerasdfzxcl Bridges (APIO19_bridges) C++17
100 / 100
 1392 ms 6532 KB 
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
constexpr int B = 369;
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;


struct Seg{
    int tree[100100], sz;
    void init(int n, int a[]){
        sz = n;
        for (int i=sz;i<sz*2;i++) tree[i] = a[i-sz];
        for (int i=sz-1;i;i--) tree[i] = min(tree[i<<1], tree[i<<1|1]);
    }
    void update(int p, int x){
        for (tree[p+=sz]=x;p>1;p>>=1) tree[p>>1] = min(tree[p], tree[p^1]);
    }
    int query(int l, int r){
        ++r;
        int ret = 1e9;
        for (l+=sz, r+=sz;l<r;l>>=1, r>>=1){
            if (l&1) ret = min(ret, tree[l++]);
            if (r&1) ret = min(ret, tree[--r]);
        }
        return ret;
    }
}tree;

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

void solve_subtask2(int n, int m, int q){
    tree.init(m+1, D);
    for (int i=1;i<=q;i++){
        if (op[i]==1) tree.update(qa[i], qb[i]);
        else{
            int L = qa[i], R = qa[i];

            int tl = 1, tr = qa[i] - 1;
            while(tl<=tr){
                int tm = (tl+tr)>>1;
                if (tree.query(tm, qa[i]-1) >= qb[i]) L = tm, tr = tm-1;
                else tl = tm+1;
            }

            tl = qa[i], tr = m;
            while(tl<=tr){
                int tm = (tl+tr)>>1;
                if (tree.query(qa[i], tm) >= qb[i]) R = tm+1, tl = tm+1;
                else tr = tm-1;
            }

            printf("%d\n", R-L+1);
        }
    }
    exit(0);
}

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

    bool subtask2 = true;
    for (int i=1;i<=m;i++){
        scanf("%d %d %d", U+i, V+i, D+i);
        if (m!=n-1 || U[i]!=i || V[i]!=i+1) subtask2 = false;
        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);
    }

    if (subtask2) solve_subtask2(n, m, q);

    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:101:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
bridges.cpp:106:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  106 |         scanf("%d %d %d", U+i, V+i, D+i);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:112:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
bridges.cpp:114:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |         scanf("%d %d %d", op+i, qa+i, qb+i);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 28 ms 656 KB Output is correct
4 Correct 3 ms 624 KB Output is correct
5 Correct 32 ms 644 KB Output is correct
6 Correct 24 ms 596 KB Output is correct
7 Correct 27 ms 632 KB Output is correct
8 Correct 32 ms 648 KB Output is correct
9 Correct 29 ms 656 KB Output is correct
10 Correct 32 ms 648 KB Output is correct
11 Correct 32 ms 644 KB Output is correct
12 Correct 36 ms 632 KB Output is correct
13 Correct 36 ms 640 KB Output is correct
14 Correct 34 ms 644 KB Output is correct
15 Correct 37 ms 628 KB Output is correct
16 Correct 30 ms 648 KB Output is correct
17 Correct 31 ms 596 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 3592 KB Output is correct
2 Correct 127 ms 3596 KB Output is correct
3 Correct 124 ms 3648 KB Output is correct
4 Correct 140 ms 3660 KB Output is correct
5 Correct 128 ms 3656 KB Output is correct
6 Correct 189 ms 3752 KB Output is correct
7 Correct 177 ms 3868 KB Output is correct
8 Correct 174 ms 3784 KB Output is correct
9 Correct 30 ms 2640 KB Output is correct
10 Correct 152 ms 3776 KB Output is correct
11 Correct 144 ms 3748 KB Output is correct
12 Correct 308 ms 4072 KB Output is correct
13 Correct 72 ms 3656 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 735 ms 4284 KB Output is correct
2 Correct 607 ms 3160 KB Output is correct
3 Correct 865 ms 4536 KB Output is correct
4 Correct 736 ms 4420 KB Output is correct
5 Correct 31 ms 2476 KB Output is correct
6 Correct 802 ms 4412 KB Output is correct
7 Correct 664 ms 4480 KB Output is correct
8 Correct 591 ms 4288 KB Output is correct
9 Correct 1049 ms 4580 KB Output is correct
10 Correct 805 ms 4236 KB Output is correct
11 Correct 506 ms 4132 KB Output is correct
12 Correct 469 ms 4220 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 5768 KB Output is correct
2 Correct 30 ms 2576 KB Output is correct
3 Correct 44 ms 2884 KB Output is correct
4 Correct 35 ms 2872 KB Output is correct
5 Correct 78 ms 5660 KB Output is correct
6 Correct 98 ms 5760 KB Output is correct
7 Correct 76 ms 5712 KB Output is correct
8 Correct 77 ms 4620 KB Output is correct
9 Correct 77 ms 4628 KB Output is correct
10 Correct 78 ms 4676 KB Output is correct
11 Correct 90 ms 5320 KB Output is correct
12 Correct 86 ms 5388 KB Output is correct
13 Correct 88 ms 5388 KB Output is correct
14 Correct 75 ms 5832 KB Output is correct
15 Correct 74 ms 5768 KB Output is correct
16 Correct 100 ms 5704 KB Output is correct
17 Correct 102 ms 5648 KB Output is correct
18 Correct 101 ms 5768 KB Output is correct
19 Correct 102 ms 5900 KB Output is correct
20 Correct 93 ms 5428 KB Output is correct
21 Correct 93 ms 5448 KB Output is correct
22 Correct 97 ms 5692 KB Output is correct
23 Correct 69 ms 5340 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 3592 KB Output is correct
2 Correct 127 ms 3596 KB Output is correct
3 Correct 124 ms 3648 KB Output is correct
4 Correct 140 ms 3660 KB Output is correct
5 Correct 128 ms 3656 KB Output is correct
6 Correct 189 ms 3752 KB Output is correct
7 Correct 177 ms 3868 KB Output is correct
8 Correct 174 ms 3784 KB Output is correct
9 Correct 30 ms 2640 KB Output is correct
10 Correct 152 ms 3776 KB Output is correct
11 Correct 144 ms 3748 KB Output is correct
12 Correct 308 ms 4072 KB Output is correct
13 Correct 72 ms 3656 KB Output is correct
14 Correct 735 ms 4284 KB Output is correct
15 Correct 607 ms 3160 KB Output is correct
16 Correct 865 ms 4536 KB Output is correct
17 Correct 736 ms 4420 KB Output is correct
18 Correct 31 ms 2476 KB Output is correct
19 Correct 802 ms 4412 KB Output is correct
20 Correct 664 ms 4480 KB Output is correct
21 Correct 591 ms 4288 KB Output is correct
22 Correct 1049 ms 4580 KB Output is correct
23 Correct 805 ms 4236 KB Output is correct
24 Correct 506 ms 4132 KB Output is correct
25 Correct 469 ms 4220 KB Output is correct
26 Correct 967 ms 5000 KB Output is correct
27 Correct 1139 ms 4888 KB Output is correct
28 Correct 952 ms 4936 KB Output is correct
29 Correct 707 ms 4856 KB Output is correct
30 Correct 1103 ms 4884 KB Output is correct
31 Correct 1093 ms 4956 KB Output is correct
32 Correct 1132 ms 4884 KB Output is correct
33 Correct 946 ms 4896 KB Output is correct
34 Correct 958 ms 4864 KB Output is correct
35 Correct 957 ms 4880 KB Output is correct
36 Correct 741 ms 4920 KB Output is correct
37 Correct 746 ms 4904 KB Output is correct
38 Correct 731 ms 5004 KB Output is correct
39 Correct 667 ms 4916 KB Output is correct
40 Correct 639 ms 4924 KB Output is correct
41 Correct 630 ms 4876 KB Output is correct
42 Correct 700 ms 4876 KB Output is correct
43 Correct 723 ms 4916 KB Output is correct
44 Correct 715 ms 5024 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 28 ms 656 KB Output is correct
4 Correct 3 ms 624 KB Output is correct
5 Correct 32 ms 644 KB Output is correct
6 Correct 24 ms 596 KB Output is correct
7 Correct 27 ms 632 KB Output is correct
8 Correct 32 ms 648 KB Output is correct
9 Correct 29 ms 656 KB Output is correct
10 Correct 32 ms 648 KB Output is correct
11 Correct 32 ms 644 KB Output is correct
12 Correct 36 ms 632 KB Output is correct
13 Correct 36 ms 640 KB Output is correct
14 Correct 34 ms 644 KB Output is correct
15 Correct 37 ms 628 KB Output is correct
16 Correct 30 ms 648 KB Output is correct
17 Correct 31 ms 596 KB Output is correct
18 Correct 129 ms 3592 KB Output is correct
19 Correct 127 ms 3596 KB Output is correct
20 Correct 124 ms 3648 KB Output is correct
21 Correct 140 ms 3660 KB Output is correct
22 Correct 128 ms 3656 KB Output is correct
23 Correct 189 ms 3752 KB Output is correct
24 Correct 177 ms 3868 KB Output is correct
25 Correct 174 ms 3784 KB Output is correct
26 Correct 30 ms 2640 KB Output is correct
27 Correct 152 ms 3776 KB Output is correct
28 Correct 144 ms 3748 KB Output is correct
29 Correct 308 ms 4072 KB Output is correct
30 Correct 72 ms 3656 KB Output is correct
31 Correct 735 ms 4284 KB Output is correct
32 Correct 607 ms 3160 KB Output is correct
33 Correct 865 ms 4536 KB Output is correct
34 Correct 736 ms 4420 KB Output is correct
35 Correct 31 ms 2476 KB Output is correct
36 Correct 802 ms 4412 KB Output is correct
37 Correct 664 ms 4480 KB Output is correct
38 Correct 591 ms 4288 KB Output is correct
39 Correct 1049 ms 4580 KB Output is correct
40 Correct 805 ms 4236 KB Output is correct
41 Correct 506 ms 4132 KB Output is correct
42 Correct 469 ms 4220 KB Output is correct
43 Correct 99 ms 5768 KB Output is correct
44 Correct 30 ms 2576 KB Output is correct
45 Correct 44 ms 2884 KB Output is correct
46 Correct 35 ms 2872 KB Output is correct
47 Correct 78 ms 5660 KB Output is correct
48 Correct 98 ms 5760 KB Output is correct
49 Correct 76 ms 5712 KB Output is correct
50 Correct 77 ms 4620 KB Output is correct
51 Correct 77 ms 4628 KB Output is correct
52 Correct 78 ms 4676 KB Output is correct
53 Correct 90 ms 5320 KB Output is correct
54 Correct 86 ms 5388 KB Output is correct
55 Correct 88 ms 5388 KB Output is correct
56 Correct 75 ms 5832 KB Output is correct
57 Correct 74 ms 5768 KB Output is correct
58 Correct 100 ms 5704 KB Output is correct
59 Correct 102 ms 5648 KB Output is correct
60 Correct 101 ms 5768 KB Output is correct
61 Correct 102 ms 5900 KB Output is correct
62 Correct 93 ms 5428 KB Output is correct
63 Correct 93 ms 5448 KB Output is correct
64 Correct 97 ms 5692 KB Output is correct
65 Correct 69 ms 5340 KB Output is correct
66 Correct 967 ms 5000 KB Output is correct
67 Correct 1139 ms 4888 KB Output is correct
68 Correct 952 ms 4936 KB Output is correct
69 Correct 707 ms 4856 KB Output is correct
70 Correct 1103 ms 4884 KB Output is correct
71 Correct 1093 ms 4956 KB Output is correct
72 Correct 1132 ms 4884 KB Output is correct
73 Correct 946 ms 4896 KB Output is correct
74 Correct 958 ms 4864 KB Output is correct
75 Correct 957 ms 4880 KB Output is correct
76 Correct 741 ms 4920 KB Output is correct
77 Correct 746 ms 4904 KB Output is correct
78 Correct 731 ms 5004 KB Output is correct
79 Correct 667 ms 4916 KB Output is correct
80 Correct 639 ms 4924 KB Output is correct
81 Correct 630 ms 4876 KB Output is correct
82 Correct 700 ms 4876 KB Output is correct
83 Correct 723 ms 4916 KB Output is correct
84 Correct 715 ms 5024 KB Output is correct
85 Correct 1152 ms 6532 KB Output is correct
86 Correct 123 ms 3492 KB Output is correct
87 Correct 101 ms 3480 KB Output is correct
88 Correct 986 ms 6464 KB Output is correct
89 Correct 1164 ms 6292 KB Output is correct
90 Correct 992 ms 6276 KB Output is correct
91 Correct 980 ms 4936 KB Output is correct
92 Correct 964 ms 4936 KB Output is correct
93 Correct 1392 ms 4912 KB Output is correct
94 Correct 1089 ms 5940 KB Output is correct
95 Correct 1073 ms 5748 KB Output is correct
96 Correct 1147 ms 5824 KB Output is correct
97 Correct 754 ms 6032 KB Output is correct
98 Correct 1231 ms 6256 KB Output is correct
99 Correct 1188 ms 6328 KB Output is correct
100 Correct 1177 ms 6452 KB Output is correct
101 Correct 1232 ms 6420 KB Output is correct
102 Correct 1239 ms 6296 KB Output is correct
103 Correct 1263 ms 5884 KB Output is correct
104 Correct 1249 ms 5792 KB Output is correct
105 Correct 1286 ms 5832 KB Output is correct
106 Correct 1153 ms 5620 KB Output is correct
107 Correct 1197 ms 5764 KB Output is correct
108 Correct 1151 ms 5992 KB Output is correct
109 Correct 1046 ms 5624 KB Output is correct