oj.uz

답안 #356194

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
356194 2021-01-23T08:05:47 Z CSQ31 다리 (APIO19_bridges) C++14
100 / 100
 2489 ms 32444 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

const int B = 1000;

int n, m, q;

stack<int> stck;
int sz[100001], cmp[100001];

void reset() {
    iota(cmp + 1, cmp + 1 + n, 1);
    fill(sz + 1, sz + n + 1, 1);
}

inline int find(int a) {
    while (cmp[a] != a) a = cmp[a];
    return a;
}

void onion(int a, int b) {
    a = find(a), b = find(b);
    if (a == b) return;
    if (sz[a] > sz[b]) swap(a, b);
    stck.push(a);
    sz[b] += sz[a];
    cmp[a] = cmp[b];
}

void rollback(int x) {
    while (stck.size() > x) {
        int k = stck.top();
        stck.pop();
        sz[cmp[k]] -= sz[k];
        cmp[k] = k;
    }
}

int u[100001], v[100001], w[100001];
int t[100001], x[100001], y[100001];
bool changed[100001];
vector<int> to_join[B];
int ans[100001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    FOR(i, 1, m + 1) cin >> u[i] >> v[i] >> w[i];
    cin >> q;
    FOR(i, 1, q + 1) cin >> t[i] >> x[i] >> y[i];

    for (int l = 1; l <= q; l += B) {
        int r = min(q + 1, l + B);
        reset();
        fill(changed + 1, changed + m + 1, false);

        vector<int> ask, upd, unchanged;
        FOR(i, l, r) {
            if (t[i] == 1) {
                changed[x[i]] = true;
                upd.push_back(i);
            } else ask.push_back(i);
        }
        FOR(i, 1, m + 1) if (!changed[i]) unchanged.push_back(i);

        FOR(i, l, r) {
            if (t[i] == 1) w[x[i]] = y[i];
            else {
                to_join[i - l].clear();
                for (int j : upd) if (w[x[j]] >= y[i]) to_join[i - l].push_back(x[j]);
            }
        }

        sort(ask.begin(), ask.end(), [&](int a, int b) { return y[a] > y[b]; });
        sort(unchanged.begin(), unchanged.end(), [&](int a, int b) { return w[a] > w[b]; });

        int ptr = 0;
        for (int i : ask) {
            while (ptr < unchanged.size() && w[unchanged[ptr]] >= y[i]) {
                onion(u[unchanged[ptr]], v[unchanged[ptr]]);
                ptr++;
            }
            int prev_size = stck.size();
            for (int j : to_join[i - l]) onion(u[j], v[j]);
            ans[i] = sz[find(x[i])];
            rollback(prev_size);
        }
    }

    FOR(i, 1, q + 1) if (t[i] == 2) cout << ans[i] << '\n';
    return 0;
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:33:24: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |     while (stck.size() > x) {
      |            ~~~~~~~~~~~~^~~
bridges.cpp: In function 'int main()':
bridges.cpp:82:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |             while (ptr < unchanged.size() && w[unchanged[ptr]] >= y[i]) {
      |                    ~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 45 ms 2796 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 39 ms 2924 KB Output is correct
6 Correct 43 ms 2668 KB Output is correct
7 Correct 36 ms 3564 KB Output is correct
8 Correct 63 ms 2668 KB Output is correct
9 Correct 47 ms 4332 KB Output is correct
10 Correct 41 ms 2796 KB Output is correct
11 Correct 42 ms 2668 KB Output is correct
12 Correct 50 ms 2924 KB Output is correct
13 Correct 49 ms 2868 KB Output is correct
14 Correct 46 ms 2796 KB Output is correct
15 Correct 54 ms 2668 KB Output is correct
16 Correct 46 ms 4224 KB Output is correct
17 Correct 44 ms 3436 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1459 ms 26288 KB Output is correct
2 Correct 1523 ms 26384 KB Output is correct
3 Correct 1467 ms 26196 KB Output is correct
4 Correct 1613 ms 26176 KB Output is correct
5 Correct 1523 ms 26452 KB Output is correct
6 Correct 2219 ms 28308 KB Output is correct
7 Correct 2227 ms 28104 KB Output is correct
8 Correct 2204 ms 27944 KB Output is correct
9 Correct 43 ms 2160 KB Output is correct
10 Correct 1244 ms 27996 KB Output is correct
11 Correct 1183 ms 29628 KB Output is correct
12 Correct 1309 ms 27344 KB Output is correct
13 Correct 1316 ms 30240 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1212 ms 18732 KB Output is correct
2 Correct 941 ms 9848 KB Output is correct
3 Correct 1453 ms 22700 KB Output is correct
4 Correct 1187 ms 21268 KB Output is correct
5 Correct 42 ms 3564 KB Output is correct
6 Correct 1374 ms 21244 KB Output is correct
7 Correct 1106 ms 20796 KB Output is correct
8 Correct 934 ms 20860 KB Output is correct
9 Correct 804 ms 19508 KB Output is correct
10 Correct 693 ms 19604 KB Output is correct
11 Correct 827 ms 22372 KB Output is correct
12 Correct 735 ms 22268 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1788 ms 24976 KB Output is correct
2 Correct 42 ms 2156 KB Output is correct
3 Correct 184 ms 2984 KB Output is correct
4 Correct 101 ms 2776 KB Output is correct
5 Correct 911 ms 24972 KB Output is correct
6 Correct 1729 ms 24964 KB Output is correct
7 Correct 910 ms 24996 KB Output is correct
8 Correct 830 ms 24032 KB Output is correct
9 Correct 873 ms 24016 KB Output is correct
10 Correct 832 ms 24144 KB Output is correct
11 Correct 1346 ms 24828 KB Output is correct
12 Correct 1327 ms 24792 KB Output is correct
13 Correct 1369 ms 25060 KB Output is correct
14 Correct 848 ms 25068 KB Output is correct
15 Correct 927 ms 24992 KB Output is correct
16 Correct 1870 ms 25148 KB Output is correct
17 Correct 1855 ms 25160 KB Output is correct
18 Correct 1918 ms 25400 KB Output is correct
19 Correct 1797 ms 25356 KB Output is correct
20 Correct 1501 ms 25268 KB Output is correct
21 Correct 1488 ms 25244 KB Output is correct
22 Correct 1709 ms 24824 KB Output is correct
23 Correct 1002 ms 22940 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1459 ms 26288 KB Output is correct
2 Correct 1523 ms 26384 KB Output is correct
3 Correct 1467 ms 26196 KB Output is correct
4 Correct 1613 ms 26176 KB Output is correct
5 Correct 1523 ms 26452 KB Output is correct
6 Correct 2219 ms 28308 KB Output is correct
7 Correct 2227 ms 28104 KB Output is correct
8 Correct 2204 ms 27944 KB Output is correct
9 Correct 43 ms 2160 KB Output is correct
10 Correct 1244 ms 27996 KB Output is correct
11 Correct 1183 ms 29628 KB Output is correct
12 Correct 1309 ms 27344 KB Output is correct
13 Correct 1316 ms 30240 KB Output is correct
14 Correct 1212 ms 18732 KB Output is correct
15 Correct 941 ms 9848 KB Output is correct
16 Correct 1453 ms 22700 KB Output is correct
17 Correct 1187 ms 21268 KB Output is correct
18 Correct 42 ms 3564 KB Output is correct
19 Correct 1374 ms 21244 KB Output is correct
20 Correct 1106 ms 20796 KB Output is correct
21 Correct 934 ms 20860 KB Output is correct
22 Correct 804 ms 19508 KB Output is correct
23 Correct 693 ms 19604 KB Output is correct
24 Correct 827 ms 22372 KB Output is correct
25 Correct 735 ms 22268 KB Output is correct
26 Correct 1620 ms 29080 KB Output is correct
27 Correct 1943 ms 30592 KB Output is correct
28 Correct 1600 ms 28964 KB Output is correct
29 Correct 1194 ms 28472 KB Output is correct
30 Correct 1821 ms 30564 KB Output is correct
31 Correct 1855 ms 30572 KB Output is correct
32 Correct 1875 ms 30532 KB Output is correct
33 Correct 1604 ms 28924 KB Output is correct
34 Correct 1611 ms 28884 KB Output is correct
35 Correct 1629 ms 28948 KB Output is correct
36 Correct 1189 ms 28556 KB Output is correct
37 Correct 1266 ms 28492 KB Output is correct
38 Correct 1262 ms 28496 KB Output is correct
39 Correct 1065 ms 27192 KB Output is correct
40 Correct 982 ms 27312 KB Output is correct
41 Correct 954 ms 27140 KB Output is correct
42 Correct 973 ms 29424 KB Output is correct
43 Correct 945 ms 29152 KB Output is correct
44 Correct 937 ms 29168 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 45 ms 2796 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 39 ms 2924 KB Output is correct
6 Correct 43 ms 2668 KB Output is correct
7 Correct 36 ms 3564 KB Output is correct
8 Correct 63 ms 2668 KB Output is correct
9 Correct 47 ms 4332 KB Output is correct
10 Correct 41 ms 2796 KB Output is correct
11 Correct 42 ms 2668 KB Output is correct
12 Correct 50 ms 2924 KB Output is correct
13 Correct 49 ms 2868 KB Output is correct
14 Correct 46 ms 2796 KB Output is correct
15 Correct 54 ms 2668 KB Output is correct
16 Correct 46 ms 4224 KB Output is correct
17 Correct 44 ms 3436 KB Output is correct
18 Correct 1459 ms 26288 KB Output is correct
19 Correct 1523 ms 26384 KB Output is correct
20 Correct 1467 ms 26196 KB Output is correct
21 Correct 1613 ms 26176 KB Output is correct
22 Correct 1523 ms 26452 KB Output is correct
23 Correct 2219 ms 28308 KB Output is correct
24 Correct 2227 ms 28104 KB Output is correct
25 Correct 2204 ms 27944 KB Output is correct
26 Correct 43 ms 2160 KB Output is correct
27 Correct 1244 ms 27996 KB Output is correct
28 Correct 1183 ms 29628 KB Output is correct
29 Correct 1309 ms 27344 KB Output is correct
30 Correct 1316 ms 30240 KB Output is correct
31 Correct 1212 ms 18732 KB Output is correct
32 Correct 941 ms 9848 KB Output is correct
33 Correct 1453 ms 22700 KB Output is correct
34 Correct 1187 ms 21268 KB Output is correct
35 Correct 42 ms 3564 KB Output is correct
36 Correct 1374 ms 21244 KB Output is correct
37 Correct 1106 ms 20796 KB Output is correct
38 Correct 934 ms 20860 KB Output is correct
39 Correct 804 ms 19508 KB Output is correct
40 Correct 693 ms 19604 KB Output is correct
41 Correct 827 ms 22372 KB Output is correct
42 Correct 735 ms 22268 KB Output is correct
43 Correct 1788 ms 24976 KB Output is correct
44 Correct 42 ms 2156 KB Output is correct
45 Correct 184 ms 2984 KB Output is correct
46 Correct 101 ms 2776 KB Output is correct
47 Correct 911 ms 24972 KB Output is correct
48 Correct 1729 ms 24964 KB Output is correct
49 Correct 910 ms 24996 KB Output is correct
50 Correct 830 ms 24032 KB Output is correct
51 Correct 873 ms 24016 KB Output is correct
52 Correct 832 ms 24144 KB Output is correct
53 Correct 1346 ms 24828 KB Output is correct
54 Correct 1327 ms 24792 KB Output is correct
55 Correct 1369 ms 25060 KB Output is correct
56 Correct 848 ms 25068 KB Output is correct
57 Correct 927 ms 24992 KB Output is correct
58 Correct 1870 ms 25148 KB Output is correct
59 Correct 1855 ms 25160 KB Output is correct
60 Correct 1918 ms 25400 KB Output is correct
61 Correct 1797 ms 25356 KB Output is correct
62 Correct 1501 ms 25268 KB Output is correct
63 Correct 1488 ms 25244 KB Output is correct
64 Correct 1709 ms 24824 KB Output is correct
65 Correct 1002 ms 22940 KB Output is correct
66 Correct 1620 ms 29080 KB Output is correct
67 Correct 1943 ms 30592 KB Output is correct
68 Correct 1600 ms 28964 KB Output is correct
69 Correct 1194 ms 28472 KB Output is correct
70 Correct 1821 ms 30564 KB Output is correct
71 Correct 1855 ms 30572 KB Output is correct
72 Correct 1875 ms 30532 KB Output is correct
73 Correct 1604 ms 28924 KB Output is correct
74 Correct 1611 ms 28884 KB Output is correct
75 Correct 1629 ms 28948 KB Output is correct
76 Correct 1189 ms 28556 KB Output is correct
77 Correct 1266 ms 28492 KB Output is correct
78 Correct 1262 ms 28496 KB Output is correct
79 Correct 1065 ms 27192 KB Output is correct
80 Correct 982 ms 27312 KB Output is correct
81 Correct 954 ms 27140 KB Output is correct
82 Correct 973 ms 29424 KB Output is correct
83 Correct 945 ms 29152 KB Output is correct
84 Correct 937 ms 29168 KB Output is correct
85 Correct 2211 ms 31188 KB Output is correct
86 Correct 208 ms 6668 KB Output is correct
87 Correct 134 ms 8128 KB Output is correct
88 Correct 1387 ms 31260 KB Output is correct
89 Correct 2221 ms 31068 KB Output is correct
90 Correct 1426 ms 31328 KB Output is correct
91 Correct 1613 ms 29036 KB Output is correct
92 Correct 1624 ms 29052 KB Output is correct
93 Correct 2321 ms 30280 KB Output is correct
94 Correct 1894 ms 30476 KB Output is correct
95 Correct 1897 ms 30620 KB Output is correct
96 Correct 2276 ms 32064 KB Output is correct
97 Correct 1092 ms 27824 KB Output is correct
98 Correct 1156 ms 31072 KB Output is correct
99 Correct 2212 ms 31320 KB Output is correct
100 Correct 2221 ms 31260 KB Output is correct
101 Correct 2276 ms 31432 KB Output is correct
102 Correct 2257 ms 31624 KB Output is correct
103 Correct 2489 ms 32404 KB Output is correct
104 Correct 2464 ms 32444 KB Output is correct
105 Correct 1819 ms 32188 KB Output is correct
106 Correct 1507 ms 31952 KB Output is correct
107 Correct 1739 ms 29340 KB Output is correct
108 Correct 2286 ms 31636 KB Output is correct
109 Correct 1704 ms 29172 KB Output is correct