oj.uz

답안 #839312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
839312 2023-08-29T16:23:32 Z Dec0Dedd 다리 (APIO19_bridges) C++14
100 / 100
 1702 ms 10052 KB 
#include <bits/stdc++.h>

using namespace std;

#pragma GCC optimize("O3")

const int N = 1e5+10;
const int S = 2e3;

struct dsu {
    struct save {
        int v, u, szv, szu;
        save() {};
        save(int _v, int _u, int _szv, int _szu) : v(_v), u(_u), szv(_szv), szu(_szu) {}
    };

    vector<int> p, sz;
    vector<save> op;

    void init(int n) {
        p.resize(n+1), sz.resize(n+1);
        for (int i=0; i<=n; ++i) p[i]=i, sz[i]=1;
    }

    int f(int x) {
        while (p[x] != x) x=p[x];
        return x;
    }

    bool mrg(int v, int u) {
        v=f(v), u=f(u);
        if (v == u) return false;
        if (sz[u] > sz[v]) swap(v, u);
        op.push_back(save(v, u, sz[v], sz[u]));
        sz[v]+=sz[u]; p[u]=v;
        return true;
    }

    void roll() {
        if (op.empty()) return;
        save x=op.back(); op.pop_back();
        p[x.v]=x.v, p[x.u]=x.u;
        sz[x.v]=x.szv, sz[x.u]=x.szu;
    }
};

int n, m, q, a[N], b[N], w[N], tpw[N], t[N], x[N], y[N], ans[N], qs[N], chv[N], unchv[N];
bool us[N], chg[N];

void fs(int &number) {
    register int c;
    number = 0;

    c = getchar();
    for (; (c>47 && c<58); c=getchar()) number = number*10+c-48;
}

bool cmpw(int i, int j) {
    return w[i] > w[j];
}

bool cmpq(int i, int j) {
    return y[i] > y[j];
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    fs(n), fs(m);
    for (int i=1; i<=m; ++i) fs(a[i]), fs(b[i]), fs(w[i]);

    fs(q);
    for (int i=1; i<=q; ++i) fs(t[i]), fs(x[i]), fs(y[i]);

    for (int l=1; l<=q; l+=S) {
        int r=min(q, l+S-1);

        int qsz=0, chsz=0, unchsz=0;
        for (int i=l; i<=r; ++i) {
            if (t[i] == 1) chg[x[i]]=true;
            else qs[qsz++]=i;
        } sort(qs, qs+qsz, cmpq);

        for (int i=1; i<=m; ++i) {
            tpw[i]=w[i];
            if (chg[i]) chv[chsz++]=i;
            else unchv[unchsz++]=i;
        } sort(unchv, unchv+unchsz, cmpw);

        dsu d; d.init(n+1);

        int p=0;
        for (int h=0; h<qsz; ++h) {
            int u=qs[h];
            int wu=y[u]; assert(t[u] == 2);

            while (p < unchsz) {
                if (wu <= w[unchv[p]]) {
                    d.mrg(a[unchv[p]], b[unchv[p]]), ++p;
                } else break;
            }

            for (int i=l; i<u; ++i) {
                if (t[i] == 2) continue;
                tpw[x[i]]=y[i];
            }

            int cnt=0;
            for (int j=0; j<chsz; ++j) {
                int g=chv[j];
                if (tpw[g] >= wu) cnt+=d.mrg(a[g], b[g]);
                tpw[g]=w[g];
            } ans[u]=d.sz[d.f(x[u])];

            while (cnt--) d.roll();
        }

        for (int i=l; i<=r; ++i) {
            if (t[i] == 2) continue;
            w[x[i]]=y[i], chg[x[i]]=false; 
        }
    }

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

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 36 ms 708 KB Output is correct
4 Correct 9 ms 596 KB Output is correct
5 Correct 21 ms 596 KB Output is correct
6 Correct 20 ms 596 KB Output is correct
7 Correct 21 ms 596 KB Output is correct
8 Correct 22 ms 596 KB Output is correct
9 Correct 22 ms 596 KB Output is correct
10 Correct 22 ms 672 KB Output is correct
11 Correct 22 ms 596 KB Output is correct
12 Correct 22 ms 596 KB Output is correct
13 Correct 24 ms 596 KB Output is correct
14 Correct 23 ms 724 KB Output is correct
15 Correct 22 ms 696 KB Output is correct
16 Correct 21 ms 612 KB Output is correct
17 Correct 22 ms 604 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1086 ms 7788 KB Output is correct
2 Correct 1016 ms 7864 KB Output is correct
3 Correct 1124 ms 7900 KB Output is correct
4 Correct 1026 ms 7924 KB Output is correct
5 Correct 1004 ms 7960 KB Output is correct
6 Correct 1491 ms 7728 KB Output is correct
7 Correct 1468 ms 7756 KB Output is correct
8 Correct 1453 ms 7700 KB Output is correct
9 Correct 83 ms 3420 KB Output is correct
10 Correct 977 ms 6756 KB Output is correct
11 Correct 883 ms 6772 KB Output is correct
12 Correct 845 ms 7568 KB Output is correct
13 Correct 643 ms 7836 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 918 ms 6212 KB Output is correct
2 Correct 703 ms 4104 KB Output is correct
3 Correct 999 ms 5956 KB Output is correct
4 Correct 923 ms 6136 KB Output is correct
5 Correct 86 ms 3372 KB Output is correct
6 Correct 1010 ms 6152 KB Output is correct
7 Correct 820 ms 6224 KB Output is correct
8 Correct 725 ms 6168 KB Output is correct
9 Correct 548 ms 6244 KB Output is correct
10 Correct 476 ms 6120 KB Output is correct
11 Correct 437 ms 6088 KB Output is correct
12 Correct 378 ms 6140 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 787 ms 8900 KB Output is correct
2 Correct 81 ms 3408 KB Output is correct
3 Correct 79 ms 4304 KB Output is correct
4 Correct 39 ms 4448 KB Output is correct
5 Correct 456 ms 8280 KB Output is correct
6 Correct 774 ms 9836 KB Output is correct
7 Correct 432 ms 8320 KB Output is correct
8 Correct 417 ms 7756 KB Output is correct
9 Correct 426 ms 7892 KB Output is correct
10 Correct 416 ms 7608 KB Output is correct
11 Correct 609 ms 8784 KB Output is correct
12 Correct 592 ms 8884 KB Output is correct
13 Correct 616 ms 8600 KB Output is correct
14 Correct 412 ms 8284 KB Output is correct
15 Correct 419 ms 8236 KB Output is correct
16 Correct 781 ms 9752 KB Output is correct
17 Correct 790 ms 9744 KB Output is correct
18 Correct 797 ms 9888 KB Output is correct
19 Correct 820 ms 10000 KB Output is correct
20 Correct 674 ms 8872 KB Output is correct
21 Correct 688 ms 8832 KB Output is correct
22 Correct 768 ms 9424 KB Output is correct
23 Correct 474 ms 7620 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1086 ms 7788 KB Output is correct
2 Correct 1016 ms 7864 KB Output is correct
3 Correct 1124 ms 7900 KB Output is correct
4 Correct 1026 ms 7924 KB Output is correct
5 Correct 1004 ms 7960 KB Output is correct
6 Correct 1491 ms 7728 KB Output is correct
7 Correct 1468 ms 7756 KB Output is correct
8 Correct 1453 ms 7700 KB Output is correct
9 Correct 83 ms 3420 KB Output is correct
10 Correct 977 ms 6756 KB Output is correct
11 Correct 883 ms 6772 KB Output is correct
12 Correct 845 ms 7568 KB Output is correct
13 Correct 643 ms 7836 KB Output is correct
14 Correct 918 ms 6212 KB Output is correct
15 Correct 703 ms 4104 KB Output is correct
16 Correct 999 ms 5956 KB Output is correct
17 Correct 923 ms 6136 KB Output is correct
18 Correct 86 ms 3372 KB Output is correct
19 Correct 1010 ms 6152 KB Output is correct
20 Correct 820 ms 6224 KB Output is correct
21 Correct 725 ms 6168 KB Output is correct
22 Correct 548 ms 6244 KB Output is correct
23 Correct 476 ms 6120 KB Output is correct
24 Correct 437 ms 6088 KB Output is correct
25 Correct 378 ms 6140 KB Output is correct
26 Correct 1104 ms 7876 KB Output is correct
27 Correct 1381 ms 7688 KB Output is correct
28 Correct 1119 ms 7924 KB Output is correct
29 Correct 799 ms 7976 KB Output is correct
30 Correct 1349 ms 7832 KB Output is correct
31 Correct 1294 ms 7720 KB Output is correct
32 Correct 1432 ms 7756 KB Output is correct
33 Correct 1187 ms 8048 KB Output is correct
34 Correct 1123 ms 8072 KB Output is correct
35 Correct 1157 ms 7920 KB Output is correct
36 Correct 856 ms 7868 KB Output is correct
37 Correct 834 ms 7848 KB Output is correct
38 Correct 848 ms 7856 KB Output is correct
39 Correct 609 ms 7940 KB Output is correct
40 Correct 576 ms 7872 KB Output is correct
41 Correct 566 ms 7868 KB Output is correct
42 Correct 516 ms 7844 KB Output is correct
43 Correct 492 ms 7804 KB Output is correct
44 Correct 498 ms 7784 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 36 ms 708 KB Output is correct
4 Correct 9 ms 596 KB Output is correct
5 Correct 21 ms 596 KB Output is correct
6 Correct 20 ms 596 KB Output is correct
7 Correct 21 ms 596 KB Output is correct
8 Correct 22 ms 596 KB Output is correct
9 Correct 22 ms 596 KB Output is correct
10 Correct 22 ms 672 KB Output is correct
11 Correct 22 ms 596 KB Output is correct
12 Correct 22 ms 596 KB Output is correct
13 Correct 24 ms 596 KB Output is correct
14 Correct 23 ms 724 KB Output is correct
15 Correct 22 ms 696 KB Output is correct
16 Correct 21 ms 612 KB Output is correct
17 Correct 22 ms 604 KB Output is correct
18 Correct 1086 ms 7788 KB Output is correct
19 Correct 1016 ms 7864 KB Output is correct
20 Correct 1124 ms 7900 KB Output is correct
21 Correct 1026 ms 7924 KB Output is correct
22 Correct 1004 ms 7960 KB Output is correct
23 Correct 1491 ms 7728 KB Output is correct
24 Correct 1468 ms 7756 KB Output is correct
25 Correct 1453 ms 7700 KB Output is correct
26 Correct 83 ms 3420 KB Output is correct
27 Correct 977 ms 6756 KB Output is correct
28 Correct 883 ms 6772 KB Output is correct
29 Correct 845 ms 7568 KB Output is correct
30 Correct 643 ms 7836 KB Output is correct
31 Correct 918 ms 6212 KB Output is correct
32 Correct 703 ms 4104 KB Output is correct
33 Correct 999 ms 5956 KB Output is correct
34 Correct 923 ms 6136 KB Output is correct
35 Correct 86 ms 3372 KB Output is correct
36 Correct 1010 ms 6152 KB Output is correct
37 Correct 820 ms 6224 KB Output is correct
38 Correct 725 ms 6168 KB Output is correct
39 Correct 548 ms 6244 KB Output is correct
40 Correct 476 ms 6120 KB Output is correct
41 Correct 437 ms 6088 KB Output is correct
42 Correct 378 ms 6140 KB Output is correct
43 Correct 787 ms 8900 KB Output is correct
44 Correct 81 ms 3408 KB Output is correct
45 Correct 79 ms 4304 KB Output is correct
46 Correct 39 ms 4448 KB Output is correct
47 Correct 456 ms 8280 KB Output is correct
48 Correct 774 ms 9836 KB Output is correct
49 Correct 432 ms 8320 KB Output is correct
50 Correct 417 ms 7756 KB Output is correct
51 Correct 426 ms 7892 KB Output is correct
52 Correct 416 ms 7608 KB Output is correct
53 Correct 609 ms 8784 KB Output is correct
54 Correct 592 ms 8884 KB Output is correct
55 Correct 616 ms 8600 KB Output is correct
56 Correct 412 ms 8284 KB Output is correct
57 Correct 419 ms 8236 KB Output is correct
58 Correct 781 ms 9752 KB Output is correct
59 Correct 790 ms 9744 KB Output is correct
60 Correct 797 ms 9888 KB Output is correct
61 Correct 820 ms 10000 KB Output is correct
62 Correct 674 ms 8872 KB Output is correct
63 Correct 688 ms 8832 KB Output is correct
64 Correct 768 ms 9424 KB Output is correct
65 Correct 474 ms 7620 KB Output is correct
66 Correct 1104 ms 7876 KB Output is correct
67 Correct 1381 ms 7688 KB Output is correct
68 Correct 1119 ms 7924 KB Output is correct
69 Correct 799 ms 7976 KB Output is correct
70 Correct 1349 ms 7832 KB Output is correct
71 Correct 1294 ms 7720 KB Output is correct
72 Correct 1432 ms 7756 KB Output is correct
73 Correct 1187 ms 8048 KB Output is correct
74 Correct 1123 ms 8072 KB Output is correct
75 Correct 1157 ms 7920 KB Output is correct
76 Correct 856 ms 7868 KB Output is correct
77 Correct 834 ms 7848 KB Output is correct
78 Correct 848 ms 7856 KB Output is correct
79 Correct 609 ms 7940 KB Output is correct
80 Correct 576 ms 7872 KB Output is correct
81 Correct 566 ms 7868 KB Output is correct
82 Correct 516 ms 7844 KB Output is correct
83 Correct 492 ms 7804 KB Output is correct
84 Correct 498 ms 7784 KB Output is correct
85 Correct 1506 ms 9988 KB Output is correct
86 Correct 132 ms 4416 KB Output is correct
87 Correct 87 ms 4504 KB Output is correct
88 Correct 1034 ms 8400 KB Output is correct
89 Correct 1480 ms 9952 KB Output is correct
90 Correct 1072 ms 8328 KB Output is correct
91 Correct 1158 ms 7848 KB Output is correct
92 Correct 1169 ms 8124 KB Output is correct
93 Correct 1702 ms 7740 KB Output is correct
94 Correct 1373 ms 8792 KB Output is correct
95 Correct 1362 ms 9092 KB Output is correct
96 Correct 1517 ms 8748 KB Output is correct
97 Correct 624 ms 8436 KB Output is correct
98 Correct 607 ms 8332 KB Output is correct
99 Correct 1486 ms 9948 KB Output is correct
100 Correct 1461 ms 10052 KB Output is correct
101 Correct 1574 ms 9968 KB Output is correct
102 Correct 1535 ms 10036 KB Output is correct
103 Correct 1547 ms 9060 KB Output is correct
104 Correct 1550 ms 8988 KB Output is correct
105 Correct 980 ms 9136 KB Output is correct
106 Correct 732 ms 8832 KB Output is correct
107 Correct 965 ms 9020 KB Output is correct
108 Correct 1521 ms 9568 KB Output is correct
109 Correct 1143 ms 7776 KB Output is correct