oj.uz

Submission #391411

# Submission time Handle Problem Language Result Execution time Memory
391411 2021-04-18T17:21:09 Z phathnv Bridges (APIO19_bridges) C++11
100 / 100
 2371 ms 3224 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 5e4 + 7;
const int M = 1e5 + 7;
const int BLOCK_SIZE = 1000;

struct Edge {
    int u, v, c;
};

struct Query {
    int type, a, b;
};

struct Dsu {
    int root[N], sz[N];
    stack<int> his;
    void init(int n) {
        for(int i = 1; i <= n; i++) {
            root[i] = i;
            sz[i] = 1;
        }
        while (!his.empty())
            his.pop();
    }
    int findRoot(int u) {
        if (u == root[u])
            return u;
        return findRoot(root[u]);
    }
    int getSz(int u) {
        return sz[findRoot(u)];
    }
    void unite(int u, int v) {
        u = findRoot(u);
        v = findRoot(v);
        if (u == v)
            return;
        if (sz[u] < sz[v])
            swap(u, v);
        root[v] = u;
        sz[u] += sz[v];
        his.push(v);
    }
    int backup() {
        return his.size();
    }
    void rollback(int ver) {
        while ((int) his.size() > ver) {
            int v = his.top();
            int u = root[v];
            root[v] = v;
            while (true) {
                sz[u] -= sz[v];
                if (u == root[u])
                    break;
                u = root[u];
            }
            his.pop();
        }
    }
} dsu;

int n, m, q, ordEdge[M];
Edge eds[M];
bool changed[M];

void Process(const vector<Query> &queries) {
    vector<int> ordType1, ordType2;
    vector<pair<int, int>> changedEdges;
    for(int i = 1; i <= m; i++) {
        changed[i] = 0;
        ordEdge[i] = i;
    }
    for(int i = 0; i < (int) queries.size(); i++)
        if (queries[i].type == 2) {
            ordType2.push_back(i);
        } else {
            ordType1.push_back(i);
            changed[queries[i].a] = 1;
            changedEdges.push_back({queries[i].a, eds[queries[i].a].c});
        }

    sort(ordType2.begin(), ordType2.end(), [&](const int &a, const int &b) {
        return queries[a].b > queries[b].b;
    });
    sort(ordEdge + 1, ordEdge + 1 + m, [&](const int &a, const int &b) {
        return eds[a].c > eds[b].c;
    });

    dsu.init(n);
    vector<pair<int, int>> answer;
    int ptr = 1;
    for(int ind : ordType2) {
        int u = queries[ind].a;
        int c = queries[ind].b;
        while (ptr <= m && eds[ordEdge[ptr]].c >= c) {
            if (!changed[ordEdge[ptr]])
                dsu.unite(eds[ordEdge[ptr]].u, eds[ordEdge[ptr]].v);
            ptr++;
        }
        int ver = dsu.backup();
        for(int x : ordType1){
            if (x > ind)
                break;
            eds[queries[x].a].c = queries[x].b;
        }
        for(auto p : changedEdges) {
            if (eds[p.first].c >= c)
                dsu.unite(eds[p.first].u, eds[p.first].v);
        }
        answer.push_back({ind, dsu.getSz(u)});
        for(auto p : changedEdges)
            eds[p.first].c = p.second;
        dsu.rollback(ver);
    }
    sort(answer.begin(), answer.end());
    for(auto p : answer)
        cout << p.second << '\n';
    for(Query q : queries)
        if (q.type == 1)
            eds[q.a].c = q.b;
}

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

    cin >> n >> m;
    for(int i = 1; i <= m; i++)
        cin >> eds[i].u >> eds[i].v >> eds[i].c;
    cin >> q;

    vector<Query> queries;
    for(int i = 1; i <= q; i++) {
        Query query;
        cin >> query.type >> query.a >> query.b;
        queries.push_back(query);
        if (queries.size() == BLOCK_SIZE) {
            Process(queries);
            queries.clear();
        }
    }
    Process(queries);
    queries.clear();

    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 44 ms 472 KB Output is correct
4 Correct 5 ms 332 KB Output is correct
5 Correct 46 ms 460 KB Output is correct
6 Correct 38 ms 480 KB Output is correct
7 Correct 35 ms 424 KB Output is correct
8 Correct 52 ms 448 KB Output is correct
9 Correct 44 ms 416 KB Output is correct
10 Correct 51 ms 448 KB Output is correct
11 Correct 44 ms 424 KB Output is correct
12 Correct 58 ms 456 KB Output is correct
13 Correct 60 ms 452 KB Output is correct
14 Correct 47 ms 460 KB Output is correct
15 Correct 58 ms 456 KB Output is correct
16 Correct 48 ms 428 KB Output is correct
17 Correct 50 ms 436 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1638 ms 1892 KB Output is correct
2 Correct 1631 ms 2036 KB Output is correct
3 Correct 1643 ms 2116 KB Output is correct
4 Correct 1688 ms 2192 KB Output is correct
5 Correct 1635 ms 2052 KB Output is correct
6 Correct 2315 ms 2224 KB Output is correct
7 Correct 2305 ms 2228 KB Output is correct
8 Correct 2357 ms 2204 KB Output is correct
9 Correct 45 ms 656 KB Output is correct
10 Correct 1321 ms 2076 KB Output is correct
11 Correct 1297 ms 2304 KB Output is correct
12 Correct 1360 ms 2436 KB Output is correct
13 Correct 1364 ms 2084 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1288 ms 1596 KB Output is correct
2 Correct 1004 ms 848 KB Output is correct
3 Correct 1497 ms 1740 KB Output is correct
4 Correct 1268 ms 1692 KB Output is correct
5 Correct 48 ms 568 KB Output is correct
6 Correct 1429 ms 1756 KB Output is correct
7 Correct 1167 ms 1612 KB Output is correct
8 Correct 1092 ms 1464 KB Output is correct
9 Correct 843 ms 1724 KB Output is correct
10 Correct 755 ms 1604 KB Output is correct
11 Correct 857 ms 1440 KB Output is correct
12 Correct 763 ms 1552 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1749 ms 3224 KB Output is correct
2 Correct 58 ms 512 KB Output is correct
3 Correct 187 ms 1988 KB Output is correct
4 Correct 83 ms 1944 KB Output is correct
5 Correct 854 ms 3064 KB Output is correct
6 Correct 1688 ms 2920 KB Output is correct
7 Correct 841 ms 3056 KB Output is correct
8 Correct 846 ms 1940 KB Output is correct
9 Correct 865 ms 2064 KB Output is correct
10 Correct 839 ms 2116 KB Output is correct
11 Correct 1299 ms 2444 KB Output is correct
12 Correct 1273 ms 2436 KB Output is correct
13 Correct 1316 ms 2676 KB Output is correct
14 Correct 720 ms 3208 KB Output is correct
15 Correct 766 ms 3156 KB Output is correct
16 Correct 1733 ms 2968 KB Output is correct
17 Correct 1737 ms 3004 KB Output is correct
18 Correct 1732 ms 3040 KB Output is correct
19 Correct 1706 ms 2896 KB Output is correct
20 Correct 1444 ms 2868 KB Output is correct
21 Correct 1449 ms 2816 KB Output is correct
22 Correct 1656 ms 3116 KB Output is correct
23 Correct 913 ms 2760 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1638 ms 1892 KB Output is correct
2 Correct 1631 ms 2036 KB Output is correct
3 Correct 1643 ms 2116 KB Output is correct
4 Correct 1688 ms 2192 KB Output is correct
5 Correct 1635 ms 2052 KB Output is correct
6 Correct 2315 ms 2224 KB Output is correct
7 Correct 2305 ms 2228 KB Output is correct
8 Correct 2357 ms 2204 KB Output is correct
9 Correct 45 ms 656 KB Output is correct
10 Correct 1321 ms 2076 KB Output is correct
11 Correct 1297 ms 2304 KB Output is correct
12 Correct 1360 ms 2436 KB Output is correct
13 Correct 1364 ms 2084 KB Output is correct
14 Correct 1288 ms 1596 KB Output is correct
15 Correct 1004 ms 848 KB Output is correct
16 Correct 1497 ms 1740 KB Output is correct
17 Correct 1268 ms 1692 KB Output is correct
18 Correct 48 ms 568 KB Output is correct
19 Correct 1429 ms 1756 KB Output is correct
20 Correct 1167 ms 1612 KB Output is correct
21 Correct 1092 ms 1464 KB Output is correct
22 Correct 843 ms 1724 KB Output is correct
23 Correct 755 ms 1604 KB Output is correct
24 Correct 857 ms 1440 KB Output is correct
25 Correct 763 ms 1552 KB Output is correct
26 Correct 1624 ms 2372 KB Output is correct
27 Correct 2001 ms 2120 KB Output is correct
28 Correct 1684 ms 2244 KB Output is correct
29 Correct 1313 ms 2008 KB Output is correct
30 Correct 1901 ms 2380 KB Output is correct
31 Correct 1934 ms 2244 KB Output is correct
32 Correct 1909 ms 2100 KB Output is correct
33 Correct 1670 ms 2028 KB Output is correct
34 Correct 1671 ms 2024 KB Output is correct
35 Correct 1672 ms 2116 KB Output is correct
36 Correct 1379 ms 2080 KB Output is correct
37 Correct 1337 ms 1900 KB Output is correct
38 Correct 1319 ms 2084 KB Output is correct
39 Correct 1010 ms 2188 KB Output is correct
40 Correct 1018 ms 2068 KB Output is correct
41 Correct 1010 ms 2268 KB Output is correct
42 Correct 1020 ms 1924 KB Output is correct
43 Correct 1040 ms 1924 KB Output is correct
44 Correct 1038 ms 1852 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 44 ms 472 KB Output is correct
4 Correct 5 ms 332 KB Output is correct
5 Correct 46 ms 460 KB Output is correct
6 Correct 38 ms 480 KB Output is correct
7 Correct 35 ms 424 KB Output is correct
8 Correct 52 ms 448 KB Output is correct
9 Correct 44 ms 416 KB Output is correct
10 Correct 51 ms 448 KB Output is correct
11 Correct 44 ms 424 KB Output is correct
12 Correct 58 ms 456 KB Output is correct
13 Correct 60 ms 452 KB Output is correct
14 Correct 47 ms 460 KB Output is correct
15 Correct 58 ms 456 KB Output is correct
16 Correct 48 ms 428 KB Output is correct
17 Correct 50 ms 436 KB Output is correct
18 Correct 1638 ms 1892 KB Output is correct
19 Correct 1631 ms 2036 KB Output is correct
20 Correct 1643 ms 2116 KB Output is correct
21 Correct 1688 ms 2192 KB Output is correct
22 Correct 1635 ms 2052 KB Output is correct
23 Correct 2315 ms 2224 KB Output is correct
24 Correct 2305 ms 2228 KB Output is correct
25 Correct 2357 ms 2204 KB Output is correct
26 Correct 45 ms 656 KB Output is correct
27 Correct 1321 ms 2076 KB Output is correct
28 Correct 1297 ms 2304 KB Output is correct
29 Correct 1360 ms 2436 KB Output is correct
30 Correct 1364 ms 2084 KB Output is correct
31 Correct 1288 ms 1596 KB Output is correct
32 Correct 1004 ms 848 KB Output is correct
33 Correct 1497 ms 1740 KB Output is correct
34 Correct 1268 ms 1692 KB Output is correct
35 Correct 48 ms 568 KB Output is correct
36 Correct 1429 ms 1756 KB Output is correct
37 Correct 1167 ms 1612 KB Output is correct
38 Correct 1092 ms 1464 KB Output is correct
39 Correct 843 ms 1724 KB Output is correct
40 Correct 755 ms 1604 KB Output is correct
41 Correct 857 ms 1440 KB Output is correct
42 Correct 763 ms 1552 KB Output is correct
43 Correct 1749 ms 3224 KB Output is correct
44 Correct 58 ms 512 KB Output is correct
45 Correct 187 ms 1988 KB Output is correct
46 Correct 83 ms 1944 KB Output is correct
47 Correct 854 ms 3064 KB Output is correct
48 Correct 1688 ms 2920 KB Output is correct
49 Correct 841 ms 3056 KB Output is correct
50 Correct 846 ms 1940 KB Output is correct
51 Correct 865 ms 2064 KB Output is correct
52 Correct 839 ms 2116 KB Output is correct
53 Correct 1299 ms 2444 KB Output is correct
54 Correct 1273 ms 2436 KB Output is correct
55 Correct 1316 ms 2676 KB Output is correct
56 Correct 720 ms 3208 KB Output is correct
57 Correct 766 ms 3156 KB Output is correct
58 Correct 1733 ms 2968 KB Output is correct
59 Correct 1737 ms 3004 KB Output is correct
60 Correct 1732 ms 3040 KB Output is correct
61 Correct 1706 ms 2896 KB Output is correct
62 Correct 1444 ms 2868 KB Output is correct
63 Correct 1449 ms 2816 KB Output is correct
64 Correct 1656 ms 3116 KB Output is correct
65 Correct 913 ms 2760 KB Output is correct
66 Correct 1624 ms 2372 KB Output is correct
67 Correct 2001 ms 2120 KB Output is correct
68 Correct 1684 ms 2244 KB Output is correct
69 Correct 1313 ms 2008 KB Output is correct
70 Correct 1901 ms 2380 KB Output is correct
71 Correct 1934 ms 2244 KB Output is correct
72 Correct 1909 ms 2100 KB Output is correct
73 Correct 1670 ms 2028 KB Output is correct
74 Correct 1671 ms 2024 KB Output is correct
75 Correct 1672 ms 2116 KB Output is correct
76 Correct 1379 ms 2080 KB Output is correct
77 Correct 1337 ms 1900 KB Output is correct
78 Correct 1319 ms 2084 KB Output is correct
79 Correct 1010 ms 2188 KB Output is correct
80 Correct 1018 ms 2068 KB Output is correct
81 Correct 1010 ms 2268 KB Output is correct
82 Correct 1020 ms 1924 KB Output is correct
83 Correct 1040 ms 1924 KB Output is correct
84 Correct 1038 ms 1852 KB Output is correct
85 Correct 2351 ms 2840 KB Output is correct
86 Correct 236 ms 2048 KB Output is correct
87 Correct 135 ms 2056 KB Output is correct
88 Correct 1379 ms 2800 KB Output is correct
89 Correct 2339 ms 2956 KB Output is correct
90 Correct 1369 ms 2884 KB Output is correct
91 Correct 1732 ms 2148 KB Output is correct
92 Correct 1709 ms 2032 KB Output is correct
93 Correct 2371 ms 2076 KB Output is correct
94 Correct 1953 ms 2404 KB Output is correct
95 Correct 1987 ms 2376 KB Output is correct
96 Correct 2132 ms 2508 KB Output is correct
97 Correct 1027 ms 3068 KB Output is correct
98 Correct 1066 ms 2756 KB Output is correct
99 Correct 2354 ms 3016 KB Output is correct
100 Correct 2328 ms 3032 KB Output is correct
101 Correct 2366 ms 2936 KB Output is correct
102 Correct 2360 ms 2928 KB Output is correct
103 Correct 2337 ms 2716 KB Output is correct
104 Correct 2315 ms 2824 KB Output is correct
105 Correct 1794 ms 2488 KB Output is correct
106 Correct 1466 ms 2236 KB Output is correct
107 Correct 1689 ms 2832 KB Output is correct
108 Correct 2270 ms 2760 KB Output is correct
109 Correct 1553 ms 2560 KB Output is correct