oj.uz

답안 #870960

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
870960 2023-11-09T15:38:50 Z LOLOLO 다리 (APIO19_bridges) C++17
100 / 100
 1474 ms 13484 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 5e4 + 100;
const int M = 1e5 + 100;
const int L = 1000;

int p[N], sz[N], u[M], v[M], d[M], s[M], w[M], in[M], t[M], ans[M];
bool change[M];

vector <int> save[L + 1];
int action[M], st[M], cc = 0;

inline int find(int n) {
    while (p[n])
        n = p[n];

    return n;
}

void unite(int a, int b) {
    a = find(a);
    b = find(b);
    if (a == b)
        return;

    if (sz[a] < sz[b])
        swap(a, b);

    st[cc] = b;
    cc++;
    p[b] = a;
    sz[a] += sz[b];
    assert(cc < M);
}

void rollback(int x) {
    while (cc > x) {
        cc--;
        int t = st[cc];

        sz[p[t]] -= sz[t];
        p[t] = 0;
    }
}

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

    int n, m;
    cin >> n >> m;

    for (int i = 1; i <= m; i++) {
        cin >> u[i] >> v[i] >> d[i];
    }

    int q;
    cin >> q;

    for (int i = 1; i <= q; i++) {
        cin >> t[i] >> s[i] >> w[i];
    }

    for (int k = 1; k <= q; k += L) {
        cc = 0;
        int l = k, r = min(q, k + L - 1);
        fill(sz + 1, sz + 1 + n, 1);
        fill(p + 1, p + 1 + n, 0);

        vector <int> ask, up, un;

        for (int i = l; i <= r; i++) {
            if (t[i] == 1) {
                change[s[i]] = 1;
            } else {
                ask.pb(i);
            }
        }

        for (int i = 1; i <= m; i++) {
            if (change[i] == 0) {
                un.pb(i);
            } else {
                up.pb(i);
            }
        }

        for (int i = l; i <= r; i++) {
            if (t[i] == 1) {
                d[s[i]] = w[i]; 
            } else {
                save[i - l].clear();
                for (int j : up) {
                    if (d[j] >= w[i]) {
                        save[i - l].pb(j);
                    }
                }
            }
        }

        sort(ask.begin(), ask.end(), [&](int a, int b) { return w[a] > w[b]; });
        sort(un.begin(), un.end(), [&](int a, int b) { return d[a] > d[b]; });
        int j = 0;

        for (int x : ask) {
            while (j < sz(un) && w[x] <= d[un[j]]) {
                unite(u[un[j]], v[un[j]]);
                j++;
            }

            int tmp = cc;
            for (int t : save[x - l]) {
                unite(u[t], v[t]);
            }

            ans[x] = sz[find(s[x])];
            rollback(tmp);
        }

        for (int x : up)
            change[x] = 0;
    }

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

    return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 19 ms 6780 KB Output is correct
4 Correct 3 ms 4696 KB Output is correct
5 Correct 7 ms 5124 KB Output is correct
6 Correct 6 ms 4956 KB Output is correct
7 Correct 6 ms 4956 KB Output is correct
8 Correct 7 ms 5212 KB Output is correct
9 Correct 6 ms 4956 KB Output is correct
10 Correct 7 ms 5212 KB Output is correct
11 Correct 7 ms 5228 KB Output is correct
12 Correct 7 ms 5212 KB Output is correct
13 Correct 10 ms 5444 KB Output is correct
14 Correct 9 ms 5464 KB Output is correct
15 Correct 8 ms 5208 KB Output is correct
16 Correct 6 ms 4952 KB Output is correct
17 Correct 7 ms 4952 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 733 ms 10604 KB Output is correct
2 Correct 724 ms 10816 KB Output is correct
3 Correct 728 ms 10796 KB Output is correct
4 Correct 729 ms 10868 KB Output is correct
5 Correct 735 ms 10888 KB Output is correct
6 Correct 902 ms 12064 KB Output is correct
7 Correct 833 ms 12148 KB Output is correct
8 Correct 840 ms 12064 KB Output is correct
9 Correct 26 ms 5976 KB Output is correct
10 Correct 441 ms 11536 KB Output is correct
11 Correct 438 ms 11212 KB Output is correct
12 Correct 658 ms 8456 KB Output is correct
13 Correct 665 ms 12312 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 579 ms 10112 KB Output is correct
2 Correct 316 ms 10084 KB Output is correct
3 Correct 611 ms 11496 KB Output is correct
4 Correct 562 ms 10068 KB Output is correct
5 Correct 25 ms 5968 KB Output is correct
6 Correct 559 ms 9908 KB Output is correct
7 Correct 513 ms 9692 KB Output is correct
8 Correct 462 ms 9720 KB Output is correct
9 Correct 390 ms 7924 KB Output is correct
10 Correct 379 ms 8032 KB Output is correct
11 Correct 414 ms 11728 KB Output is correct
12 Correct 415 ms 11560 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1162 ms 9740 KB Output is correct
2 Correct 27 ms 6080 KB Output is correct
3 Correct 126 ms 7312 KB Output is correct
4 Correct 55 ms 7440 KB Output is correct
5 Correct 550 ms 8304 KB Output is correct
6 Correct 1095 ms 9948 KB Output is correct
7 Correct 599 ms 8348 KB Output is correct
8 Correct 530 ms 8200 KB Output is correct
9 Correct 516 ms 8152 KB Output is correct
10 Correct 519 ms 7880 KB Output is correct
11 Correct 855 ms 9240 KB Output is correct
12 Correct 851 ms 9168 KB Output is correct
13 Correct 858 ms 8760 KB Output is correct
14 Correct 482 ms 8220 KB Output is correct
15 Correct 521 ms 8240 KB Output is correct
16 Correct 1132 ms 10176 KB Output is correct
17 Correct 1180 ms 10096 KB Output is correct
18 Correct 1164 ms 9964 KB Output is correct
19 Correct 1171 ms 10200 KB Output is correct
20 Correct 987 ms 9324 KB Output is correct
21 Correct 942 ms 9524 KB Output is correct
22 Correct 1126 ms 9496 KB Output is correct
23 Correct 626 ms 8064 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 733 ms 10604 KB Output is correct
2 Correct 724 ms 10816 KB Output is correct
3 Correct 728 ms 10796 KB Output is correct
4 Correct 729 ms 10868 KB Output is correct
5 Correct 735 ms 10888 KB Output is correct
6 Correct 902 ms 12064 KB Output is correct
7 Correct 833 ms 12148 KB Output is correct
8 Correct 840 ms 12064 KB Output is correct
9 Correct 26 ms 5976 KB Output is correct
10 Correct 441 ms 11536 KB Output is correct
11 Correct 438 ms 11212 KB Output is correct
12 Correct 658 ms 8456 KB Output is correct
13 Correct 665 ms 12312 KB Output is correct
14 Correct 579 ms 10112 KB Output is correct
15 Correct 316 ms 10084 KB Output is correct
16 Correct 611 ms 11496 KB Output is correct
17 Correct 562 ms 10068 KB Output is correct
18 Correct 25 ms 5968 KB Output is correct
19 Correct 559 ms 9908 KB Output is correct
20 Correct 513 ms 9692 KB Output is correct
21 Correct 462 ms 9720 KB Output is correct
22 Correct 390 ms 7924 KB Output is correct
23 Correct 379 ms 8032 KB Output is correct
24 Correct 414 ms 11728 KB Output is correct
25 Correct 415 ms 11560 KB Output is correct
26 Correct 722 ms 10840 KB Output is correct
27 Correct 839 ms 12492 KB Output is correct
28 Correct 775 ms 10720 KB Output is correct
29 Correct 646 ms 10600 KB Output is correct
30 Correct 824 ms 12188 KB Output is correct
31 Correct 799 ms 12384 KB Output is correct
32 Correct 829 ms 12328 KB Output is correct
33 Correct 758 ms 10696 KB Output is correct
34 Correct 767 ms 10616 KB Output is correct
35 Correct 762 ms 10704 KB Output is correct
36 Correct 647 ms 10372 KB Output is correct
37 Correct 664 ms 10376 KB Output is correct
38 Correct 665 ms 10684 KB Output is correct
39 Correct 594 ms 8772 KB Output is correct
40 Correct 550 ms 8656 KB Output is correct
41 Correct 566 ms 8864 KB Output is correct
42 Correct 546 ms 11996 KB Output is correct
43 Correct 545 ms 11664 KB Output is correct
44 Correct 548 ms 11584 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 19 ms 6780 KB Output is correct
4 Correct 3 ms 4696 KB Output is correct
5 Correct 7 ms 5124 KB Output is correct
6 Correct 6 ms 4956 KB Output is correct
7 Correct 6 ms 4956 KB Output is correct
8 Correct 7 ms 5212 KB Output is correct
9 Correct 6 ms 4956 KB Output is correct
10 Correct 7 ms 5212 KB Output is correct
11 Correct 7 ms 5228 KB Output is correct
12 Correct 7 ms 5212 KB Output is correct
13 Correct 10 ms 5444 KB Output is correct
14 Correct 9 ms 5464 KB Output is correct
15 Correct 8 ms 5208 KB Output is correct
16 Correct 6 ms 4952 KB Output is correct
17 Correct 7 ms 4952 KB Output is correct
18 Correct 733 ms 10604 KB Output is correct
19 Correct 724 ms 10816 KB Output is correct
20 Correct 728 ms 10796 KB Output is correct
21 Correct 729 ms 10868 KB Output is correct
22 Correct 735 ms 10888 KB Output is correct
23 Correct 902 ms 12064 KB Output is correct
24 Correct 833 ms 12148 KB Output is correct
25 Correct 840 ms 12064 KB Output is correct
26 Correct 26 ms 5976 KB Output is correct
27 Correct 441 ms 11536 KB Output is correct
28 Correct 438 ms 11212 KB Output is correct
29 Correct 658 ms 8456 KB Output is correct
30 Correct 665 ms 12312 KB Output is correct
31 Correct 579 ms 10112 KB Output is correct
32 Correct 316 ms 10084 KB Output is correct
33 Correct 611 ms 11496 KB Output is correct
34 Correct 562 ms 10068 KB Output is correct
35 Correct 25 ms 5968 KB Output is correct
36 Correct 559 ms 9908 KB Output is correct
37 Correct 513 ms 9692 KB Output is correct
38 Correct 462 ms 9720 KB Output is correct
39 Correct 390 ms 7924 KB Output is correct
40 Correct 379 ms 8032 KB Output is correct
41 Correct 414 ms 11728 KB Output is correct
42 Correct 415 ms 11560 KB Output is correct
43 Correct 1162 ms 9740 KB Output is correct
44 Correct 27 ms 6080 KB Output is correct
45 Correct 126 ms 7312 KB Output is correct
46 Correct 55 ms 7440 KB Output is correct
47 Correct 550 ms 8304 KB Output is correct
48 Correct 1095 ms 9948 KB Output is correct
49 Correct 599 ms 8348 KB Output is correct
50 Correct 530 ms 8200 KB Output is correct
51 Correct 516 ms 8152 KB Output is correct
52 Correct 519 ms 7880 KB Output is correct
53 Correct 855 ms 9240 KB Output is correct
54 Correct 851 ms 9168 KB Output is correct
55 Correct 858 ms 8760 KB Output is correct
56 Correct 482 ms 8220 KB Output is correct
57 Correct 521 ms 8240 KB Output is correct
58 Correct 1132 ms 10176 KB Output is correct
59 Correct 1180 ms 10096 KB Output is correct
60 Correct 1164 ms 9964 KB Output is correct
61 Correct 1171 ms 10200 KB Output is correct
62 Correct 987 ms 9324 KB Output is correct
63 Correct 942 ms 9524 KB Output is correct
64 Correct 1126 ms 9496 KB Output is correct
65 Correct 626 ms 8064 KB Output is correct
66 Correct 722 ms 10840 KB Output is correct
67 Correct 839 ms 12492 KB Output is correct
68 Correct 775 ms 10720 KB Output is correct
69 Correct 646 ms 10600 KB Output is correct
70 Correct 824 ms 12188 KB Output is correct
71 Correct 799 ms 12384 KB Output is correct
72 Correct 829 ms 12328 KB Output is correct
73 Correct 758 ms 10696 KB Output is correct
74 Correct 767 ms 10616 KB Output is correct
75 Correct 762 ms 10704 KB Output is correct
76 Correct 647 ms 10372 KB Output is correct
77 Correct 664 ms 10376 KB Output is correct
78 Correct 665 ms 10684 KB Output is correct
79 Correct 594 ms 8772 KB Output is correct
80 Correct 550 ms 8656 KB Output is correct
81 Correct 566 ms 8864 KB Output is correct
82 Correct 546 ms 11996 KB Output is correct
83 Correct 545 ms 11664 KB Output is correct
84 Correct 548 ms 11584 KB Output is correct
85 Correct 1362 ms 12024 KB Output is correct
86 Correct 140 ms 9316 KB Output is correct
87 Correct 72 ms 10748 KB Output is correct
88 Correct 768 ms 12192 KB Output is correct
89 Correct 1387 ms 12440 KB Output is correct
90 Correct 732 ms 12916 KB Output is correct
91 Correct 765 ms 10564 KB Output is correct
92 Correct 770 ms 10592 KB Output is correct
93 Correct 886 ms 11776 KB Output is correct
94 Correct 1106 ms 11592 KB Output is correct
95 Correct 1102 ms 12068 KB Output is correct
96 Correct 1169 ms 13484 KB Output is correct
97 Correct 626 ms 8668 KB Output is correct
98 Correct 673 ms 12096 KB Output is correct
99 Correct 1460 ms 12336 KB Output is correct
100 Correct 1387 ms 11932 KB Output is correct
101 Correct 1474 ms 12608 KB Output is correct
102 Correct 1463 ms 12140 KB Output is correct
103 Correct 1322 ms 13208 KB Output is correct
104 Correct 1271 ms 13204 KB Output is correct
105 Correct 1089 ms 13240 KB Output is correct
106 Correct 889 ms 12980 KB Output is correct
107 Correct 1061 ms 9456 KB Output is correct
108 Correct 1350 ms 12436 KB Output is correct
109 Correct 834 ms 11944 KB Output is correct