oj.uz

Submission #142552

# Submission time Handle Problem Language Result Execution time Memory
142552 2019-08-09T14:08:01 Z imeimi2000 Bridges (APIO19_bridges) C++17
100 / 100
 2824 ms 12628 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#define fs first
#define se second

using namespace std;
typedef long long llong;
typedef pair<int, int> pii;

const int B = 1000;
int n, m, q;
int U[100001], V[100001], D[100001];
int CD[100001];
int T[100001], X[100001], Y[100001];
int ans[100001];

struct union_find {
    int par[100001];
    int sz[100001];
    vector<int> op;
    void init() {
        op.clear();
        for (int i = 1; i <= n; ++i) {
            par[i] = 0;
            sz[i] = 1;
        }
    }
    int find(int x) {
        if (par[x]) return find(par[x]);
        return x;
    }
    bool merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return 0;
        if (sz[x] < sz[y]) swap(x, y);
        par[y] = x;
        sz[x] += sz[y];
        op.push_back(y);
        return 1;
    }
    void restore() {
        int y = op.back();
        op.pop_back();
        int x = par[y];
        par[y] = 0;
        sz[x] -= sz[y];
    }
    int size() {
        return op.size();
    }
} uf;

bool ch[100001];
vector<int> cv;
set<pii> es;
void process_pre(int qs, int qe) {
    for (int i = qs; i <= qe; ++i) {
        if (T[i] == 1) {
            ch[X[i]] = 1;
            cv.push_back(X[i]);
        }
    }
    uf.init();
    sort(cv.begin(), cv.end());
    cv.erase(unique(cv.begin(), cv.end()), cv.end());
}

void process_ans(int qs, int qe) {
    vector<pii> qv;
    for (int i = qs; i <= qe; ++i) {
        if (T[i] == 2) qv.emplace_back(Y[i], i);
    }
    sort(qv.begin(), qv.end());
    auto it = es.begin();
    for (pii i : qv) {
        while (it != es.end() && it->fs <= i.fs) {
            int j = it->se;
            if (!ch[j])
                uf.merge(U[j], V[j]);
            ++it;
        }
        int sz = uf.size();
        for (int j : cv) CD[j] = D[j];
        for (int j = qs; j <= qe; ++j) {
            if (j > i.se) break;
            if (T[j] == 1) CD[X[j]] = Y[j];
        }
        for (int j : cv) if (CD[j] <= i.fs)
            uf.merge(U[j], V[j]);
        ans[i.se] = uf.sz[uf.find(X[i.se])];
        while (sz < uf.size()) uf.restore();
    }
}

void process_end(int qs, int qe) {
    for (int i = qs; i <= qe; ++i) {
        if (T[i] == 1) {
            es.erase(pii(D[X[i]], X[i]));
            D[X[i]] = Y[i];
            es.emplace(D[X[i]], X[i]);
            ch[X[i]] = 0;
        }
    }
    cv.clear();
}

const int inf = 1e9;
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        cin >> U[i] >> V[i] >> D[i];
        D[i] = inf - D[i];
        es.emplace(D[i], i);
    }
    cin >> q;
    for (int i = 1; i <= q; ++i) {
        cin >> T[i] >> X[i] >> Y[i];
        Y[i] = inf - Y[i];
    }
    for (int g = 0; ; ++g) {
        int qs = g * B + 1, qe = (g + 1) * B;
        qe = min(qe, q);
        if (qs > qe) break;
        process_pre(qs, qe);
        process_ans(qs, qe);
        process_end(qs, qe);
    }
    for (int i = 1; i <= q; ++i) {
        if (T[i] == 2) printf("%d\n", ans[i]);
    }
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 39 ms 632 KB Output is correct
4 Correct 12 ms 632 KB Output is correct
5 Correct 18 ms 632 KB Output is correct
6 Correct 17 ms 628 KB Output is correct
7 Correct 19 ms 632 KB Output is correct
8 Correct 20 ms 632 KB Output is correct
9 Correct 17 ms 632 KB Output is correct
10 Correct 19 ms 632 KB Output is correct
11 Correct 18 ms 632 KB Output is correct
12 Correct 19 ms 632 KB Output is correct
13 Correct 24 ms 732 KB Output is correct
14 Correct 23 ms 632 KB Output is correct
15 Correct 21 ms 632 KB Output is correct
16 Correct 19 ms 632 KB Output is correct
17 Correct 21 ms 632 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1547 ms 6184 KB Output is correct
2 Correct 1549 ms 6008 KB Output is correct
3 Correct 1539 ms 6188 KB Output is correct
4 Correct 1563 ms 5928 KB Output is correct
5 Correct 1554 ms 6068 KB Output is correct
6 Correct 2409 ms 6352 KB Output is correct
7 Correct 2343 ms 6264 KB Output is correct
8 Correct 2417 ms 6304 KB Output is correct
9 Correct 95 ms 2168 KB Output is correct
10 Correct 1087 ms 6260 KB Output is correct
11 Correct 1098 ms 6136 KB Output is correct
12 Correct 1081 ms 6536 KB Output is correct
13 Correct 1209 ms 6020 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1270 ms 4740 KB Output is correct
2 Correct 746 ms 2936 KB Output is correct
3 Correct 1507 ms 4676 KB Output is correct
4 Correct 1194 ms 4720 KB Output is correct
5 Correct 95 ms 2168 KB Output is correct
6 Correct 1413 ms 4856 KB Output is correct
7 Correct 1176 ms 4864 KB Output is correct
8 Correct 1020 ms 4740 KB Output is correct
9 Correct 633 ms 4948 KB Output is correct
10 Correct 608 ms 4784 KB Output is correct
11 Correct 787 ms 4744 KB Output is correct
12 Correct 668 ms 4760 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1571 ms 9036 KB Output is correct
2 Correct 94 ms 2168 KB Output is correct
3 Correct 191 ms 6392 KB Output is correct
4 Correct 115 ms 6520 KB Output is correct
5 Correct 1108 ms 9016 KB Output is correct
6 Correct 1787 ms 9164 KB Output is correct
7 Correct 1048 ms 9156 KB Output is correct
8 Correct 703 ms 5868 KB Output is correct
9 Correct 687 ms 5872 KB Output is correct
10 Correct 613 ms 5996 KB Output is correct
11 Correct 1096 ms 7436 KB Output is correct
12 Correct 1126 ms 7548 KB Output is correct
13 Correct 1084 ms 7688 KB Output is correct
14 Correct 1051 ms 9248 KB Output is correct
15 Correct 959 ms 9228 KB Output is correct
16 Correct 1384 ms 8960 KB Output is correct
17 Correct 1463 ms 9032 KB Output is correct
18 Correct 1601 ms 9028 KB Output is correct
19 Correct 1637 ms 9124 KB Output is correct
20 Correct 1294 ms 8348 KB Output is correct
21 Correct 1387 ms 8456 KB Output is correct
22 Correct 1422 ms 8992 KB Output is correct
23 Correct 1079 ms 7876 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1547 ms 6184 KB Output is correct
2 Correct 1549 ms 6008 KB Output is correct
3 Correct 1539 ms 6188 KB Output is correct
4 Correct 1563 ms 5928 KB Output is correct
5 Correct 1554 ms 6068 KB Output is correct
6 Correct 2409 ms 6352 KB Output is correct
7 Correct 2343 ms 6264 KB Output is correct
8 Correct 2417 ms 6304 KB Output is correct
9 Correct 95 ms 2168 KB Output is correct
10 Correct 1087 ms 6260 KB Output is correct
11 Correct 1098 ms 6136 KB Output is correct
12 Correct 1081 ms 6536 KB Output is correct
13 Correct 1209 ms 6020 KB Output is correct
14 Correct 1270 ms 4740 KB Output is correct
15 Correct 746 ms 2936 KB Output is correct
16 Correct 1507 ms 4676 KB Output is correct
17 Correct 1194 ms 4720 KB Output is correct
18 Correct 95 ms 2168 KB Output is correct
19 Correct 1413 ms 4856 KB Output is correct
20 Correct 1176 ms 4864 KB Output is correct
21 Correct 1020 ms 4740 KB Output is correct
22 Correct 633 ms 4948 KB Output is correct
23 Correct 608 ms 4784 KB Output is correct
24 Correct 787 ms 4744 KB Output is correct
25 Correct 668 ms 4760 KB Output is correct
26 Correct 1628 ms 6080 KB Output is correct
27 Correct 2250 ms 6312 KB Output is correct
28 Correct 1826 ms 6100 KB Output is correct
29 Correct 1320 ms 6176 KB Output is correct
30 Correct 2238 ms 6136 KB Output is correct
31 Correct 2366 ms 6132 KB Output is correct
32 Correct 2186 ms 6168 KB Output is correct
33 Correct 1836 ms 6020 KB Output is correct
34 Correct 1822 ms 6200 KB Output is correct
35 Correct 1774 ms 6256 KB Output is correct
36 Correct 1179 ms 6008 KB Output is correct
37 Correct 1156 ms 6004 KB Output is correct
38 Correct 1162 ms 6120 KB Output is correct
39 Correct 844 ms 6140 KB Output is correct
40 Correct 775 ms 6204 KB Output is correct
41 Correct 772 ms 6256 KB Output is correct
42 Correct 824 ms 6040 KB Output is correct
43 Correct 856 ms 6008 KB Output is correct
44 Correct 833 ms 5936 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 39 ms 632 KB Output is correct
4 Correct 12 ms 632 KB Output is correct
5 Correct 18 ms 632 KB Output is correct
6 Correct 17 ms 628 KB Output is correct
7 Correct 19 ms 632 KB Output is correct
8 Correct 20 ms 632 KB Output is correct
9 Correct 17 ms 632 KB Output is correct
10 Correct 19 ms 632 KB Output is correct
11 Correct 18 ms 632 KB Output is correct
12 Correct 19 ms 632 KB Output is correct
13 Correct 24 ms 732 KB Output is correct
14 Correct 23 ms 632 KB Output is correct
15 Correct 21 ms 632 KB Output is correct
16 Correct 19 ms 632 KB Output is correct
17 Correct 21 ms 632 KB Output is correct
18 Correct 1547 ms 6184 KB Output is correct
19 Correct 1549 ms 6008 KB Output is correct
20 Correct 1539 ms 6188 KB Output is correct
21 Correct 1563 ms 5928 KB Output is correct
22 Correct 1554 ms 6068 KB Output is correct
23 Correct 2409 ms 6352 KB Output is correct
24 Correct 2343 ms 6264 KB Output is correct
25 Correct 2417 ms 6304 KB Output is correct
26 Correct 95 ms 2168 KB Output is correct
27 Correct 1087 ms 6260 KB Output is correct
28 Correct 1098 ms 6136 KB Output is correct
29 Correct 1081 ms 6536 KB Output is correct
30 Correct 1209 ms 6020 KB Output is correct
31 Correct 1270 ms 4740 KB Output is correct
32 Correct 746 ms 2936 KB Output is correct
33 Correct 1507 ms 4676 KB Output is correct
34 Correct 1194 ms 4720 KB Output is correct
35 Correct 95 ms 2168 KB Output is correct
36 Correct 1413 ms 4856 KB Output is correct
37 Correct 1176 ms 4864 KB Output is correct
38 Correct 1020 ms 4740 KB Output is correct
39 Correct 633 ms 4948 KB Output is correct
40 Correct 608 ms 4784 KB Output is correct
41 Correct 787 ms 4744 KB Output is correct
42 Correct 668 ms 4760 KB Output is correct
43 Correct 1571 ms 9036 KB Output is correct
44 Correct 94 ms 2168 KB Output is correct
45 Correct 191 ms 6392 KB Output is correct
46 Correct 115 ms 6520 KB Output is correct
47 Correct 1108 ms 9016 KB Output is correct
48 Correct 1787 ms 9164 KB Output is correct
49 Correct 1048 ms 9156 KB Output is correct
50 Correct 703 ms 5868 KB Output is correct
51 Correct 687 ms 5872 KB Output is correct
52 Correct 613 ms 5996 KB Output is correct
53 Correct 1096 ms 7436 KB Output is correct
54 Correct 1126 ms 7548 KB Output is correct
55 Correct 1084 ms 7688 KB Output is correct
56 Correct 1051 ms 9248 KB Output is correct
57 Correct 959 ms 9228 KB Output is correct
58 Correct 1384 ms 8960 KB Output is correct
59 Correct 1463 ms 9032 KB Output is correct
60 Correct 1601 ms 9028 KB Output is correct
61 Correct 1637 ms 9124 KB Output is correct
62 Correct 1294 ms 8348 KB Output is correct
63 Correct 1387 ms 8456 KB Output is correct
64 Correct 1422 ms 8992 KB Output is correct
65 Correct 1079 ms 7876 KB Output is correct
66 Correct 1628 ms 6080 KB Output is correct
67 Correct 2250 ms 6312 KB Output is correct
68 Correct 1826 ms 6100 KB Output is correct
69 Correct 1320 ms 6176 KB Output is correct
70 Correct 2238 ms 6136 KB Output is correct
71 Correct 2366 ms 6132 KB Output is correct
72 Correct 2186 ms 6168 KB Output is correct
73 Correct 1836 ms 6020 KB Output is correct
74 Correct 1822 ms 6200 KB Output is correct
75 Correct 1774 ms 6256 KB Output is correct
76 Correct 1179 ms 6008 KB Output is correct
77 Correct 1156 ms 6004 KB Output is correct
78 Correct 1162 ms 6120 KB Output is correct
79 Correct 844 ms 6140 KB Output is correct
80 Correct 775 ms 6204 KB Output is correct
81 Correct 772 ms 6256 KB Output is correct
82 Correct 824 ms 6040 KB Output is correct
83 Correct 856 ms 6008 KB Output is correct
84 Correct 833 ms 5936 KB Output is correct
85 Correct 2824 ms 9412 KB Output is correct
86 Correct 239 ms 7164 KB Output is correct
87 Correct 150 ms 6904 KB Output is correct
88 Correct 1599 ms 9520 KB Output is correct
89 Correct 2588 ms 9276 KB Output is correct
90 Correct 1618 ms 9188 KB Output is correct
91 Correct 1802 ms 6136 KB Output is correct
92 Correct 1823 ms 6196 KB Output is correct
93 Correct 2740 ms 6224 KB Output is correct
94 Correct 2271 ms 7744 KB Output is correct
95 Correct 2396 ms 7728 KB Output is correct
96 Correct 2136 ms 7856 KB Output is correct
97 Correct 1221 ms 9204 KB Output is correct
98 Correct 1690 ms 8952 KB Output is correct
99 Correct 2713 ms 9428 KB Output is correct
100 Correct 2743 ms 9440 KB Output is correct
101 Correct 2815 ms 9224 KB Output is correct
102 Correct 2762 ms 9112 KB Output is correct
103 Correct 2258 ms 11568 KB Output is correct
104 Correct 2347 ms 11440 KB Output is correct
105 Correct 1830 ms 11264 KB Output is correct
106 Correct 1402 ms 10744 KB Output is correct
107 Correct 1473 ms 11764 KB Output is correct
108 Correct 2477 ms 12628 KB Output is correct
109 Correct 1795 ms 10104 KB Output is correct