Submission #527991

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
527991	2022-02-18T23:52:21 Z	Olympia	Bridges (APIO19_bridges)	C++17	100 / 100	2570 ms	27532 KB

bridges

#include <cmath>
#include <cassert>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
#include <stack>
 
using namespace std;
 
class Updates {
public:
    int parentInd;
    int prev_parent;
    int compInd;
    int prev_comp;
};
 
class DisjointSetUnion {
private:
    vector<int> parent;
    vector<int> compSize;
    int n;
    int connectedComponents;
    stack<Updates> myStack;
public:
    int cntr = 0;
 
    int getNeighbors(int x) {
        return compSize[find_head(x)];
    }
 
public:
    void resz(int sz) {
        n = sz;
        connectedComponents = sz;
        parent.resize(sz), compSize.resize(sz);
        for (int i = 0; i < n; i++) {
            parent[i] = i, compSize[i] = 1;
        }
    }
 
    int find_head(int x) const {
        int cur = x;
        while (cur != parent[cur]) {
            cur = parent[cur];
        }
        return cur;
    }
 
    void join(int x, int y, bool b) {
        x = find_head(x);
        y = find_head(y);
        if (x == y) {
            return;
        }
        if (compSize[x] > compSize[y]) {
            swap(x, y);
        }
        if (b) myStack.push({x, parent[x], y, compSize[y]}), cntr++;
        parent[x] = y;
        compSize[y] += compSize[x];
        connectedComponents--;
    }
 
    void revert(int x) {
        while (x--) {
            Updates u = myStack.top();
            myStack.pop();
            parent[u.parentInd] = u.prev_parent;
            compSize[u.compInd] = u.prev_comp;
            connectedComponents++;
        }
    }
 
    bool comp(int x, int y) {
        return (find_head(x) == find_head(y));
    }
};
 
class Query {
public:
    int w;
    int x;
    bool type;
    int q;
 
    Query(int w, int x, bool type, int q) {
        this->w = w, this->x = x, this->type = type, this->q = q;
    }
 
    bool operator<(const Query myQuery) const {
        if (myQuery.w != w) return (myQuery.w < w);
        if (myQuery.x != x) return (myQuery.x < x);
        if (myQuery.type != type) return (myQuery.type < type);
        return false;
    }
};
 
bool comp_index(Query a, Query b) {
    return (a.q < b.q);
}
 
void compress(vector<pair<pair<int, int>, int>> &edges, vector<vector<Query>> &blocks) {
    set<int> w;
    for (auto &p: edges) w.insert(p.second);
    for (auto &v: blocks) for (auto &q: v) w.insert(q.w);
    map<int, int> myMap;
    int cntr = 0;
    for (int i: w) {
        myMap[i] = cntr++;
    }
    for (int i = 0; i < edges.size(); i++) {
        edges[i].second = myMap[edges[i].second];
    }
    for (int i = 0; i < blocks.size(); i++) {
        for (int j = 0; j < blocks[i].size(); j++) {
            blocks[i][j].w = myMap[blocks[i][j].w];
        }
    }
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, M;
    cin >> N >> M;
    vector<pair<pair<int, int>, int>> edges;
    for (int i = 0; i < M; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        x--, y--;
        edges.push_back({{x, y}, z});
    }
    int Q;
    cin >> Q;
    vector<vector<Query>> blocks;
    blocks.emplace_back();
    for (int i = 0; i < Q; i++) {
        if (blocks.back().size() > 1200) {
            blocks.emplace_back();
        }
        int t, w, x;
        cin >> t >> x >> w;
        t--;
        x--;
        blocks.back().emplace_back(Query(w, x, t, i));
    }
    compress(edges, blocks);
    vector<int> default_edges(M);
    for (int i = 0; i < M; i++) {
        default_edges[i] = edges[i].second;
    }
    vector<pair<int, int>> myVec;
    int total = 0;
    for (auto &v: blocks) {
        DisjointSetUnion dsu;
        dsu.resz(N);
        vector<int> uncertain;
        int cnt[M];
        for (int i = 0; i < M; i++) {
            cnt[i] = 0;
        }
        for (Query& q: v) {
            if (q.type == 0) {
                uncertain.push_back(q.x);
                cnt[q.x]++;
            }
        }
        stack<pair<int,int>> myStack;
        vector<int> mnt[v.size()];
        for (int i = 0; i < v.size(); i++) {
            if (v[i].type == 0) {
                default_edges[v[i].x] = v[i].w;
                myStack.push({v[i].x, v[i].w});
            } else {
                for (int j: uncertain) {
                    if (default_edges[j] >= v[i].w) {
                        mnt[i].push_back(j);
                    }
                }
            }
        }
        while (!myStack.empty()) {
            default_edges[myStack.top().first] = myStack.top().second;
            myStack.pop();
        }
        vector<int> e[M + Q];
        for (int i = 0; i < M; i++) {
            if (!cnt[i]) {
                e[default_edges[i]].push_back(i);
            }
        }
        sort (v.begin(), v.end());
        int prev = M + Q;
        for (int ind = 0; ind < v.size(); ind++) {
            Query q = v[ind];
            if (q.type == 0) {
                continue;
            }
            for (int i = q.w; i < prev; i++) {
                for (int j: e[i]) {
                    dsu.join(edges[j].first.first, edges[j].first.second, false);
                }
            }
            prev = q.w;
            dsu.cntr = 0;
            for (int x: mnt[v[ind].q - total]) {
                dsu.join(edges[x].first.first, edges[x].first.second, true);
            }
            myVec.emplace_back(q.q, dsu.getNeighbors(q.x));
            dsu.revert(dsu.cntr);
        }
        sort(v.begin(), v.end(), comp_index);
        for (Query &q: v) {
            if (q.type == 0) {
                default_edges[q.x] = q.w;
            }
        }
        total += v.size();
    }
 
    sort(myVec.begin(), myVec.end());
    for (auto &p: myVec) {
        cout << p.second << '\n';
    }
}

Compilation message

bridges.cpp: In function 'void compress(std::vector<std::pair<std::pair<int, int>, int> >&, std::vector<std::vector<Query> >&)':
bridges.cpp:119:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |     for (int i = 0; i < edges.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
bridges.cpp:122:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<Query> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     for (int i = 0; i < blocks.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~
bridges.cpp:123:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |         for (int j = 0; j < blocks[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:178:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  178 |         for (int i = 0; i < v.size(); i++) {
      |                         ~~^~~~~~~~~~
bridges.cpp:202:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  202 |         for (int ind = 0; ind < v.size(); ind++) {
      |                           ~~~~^~~~~~~~~~

Subtask #1

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	42 ms	1924 KB	Output is correct
4	Correct	9 ms	1612 KB	Output is correct
5	Correct	41 ms	2124 KB	Output is correct
6	Correct	29 ms	2204 KB	Output is correct
7	Correct	41 ms	2300 KB	Output is correct
8	Correct	47 ms	1900 KB	Output is correct
9	Correct	52 ms	3296 KB	Output is correct
10	Correct	48 ms	1992 KB	Output is correct
11	Correct	47 ms	1928 KB	Output is correct
12	Correct	58 ms	2276 KB	Output is correct
13	Correct	55 ms	2100 KB	Output is correct
14	Correct	61 ms	1824 KB	Output is correct
15	Correct	56 ms	2048 KB	Output is correct
16	Correct	46 ms	2636 KB	Output is correct
17	Correct	45 ms	2376 KB	Output is correct

Subtask #2

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1759 ms	20464 KB	Output is correct
2	Correct	1815 ms	20408 KB	Output is correct
3	Correct	1863 ms	20468 KB	Output is correct
4	Correct	1822 ms	20444 KB	Output is correct
5	Correct	1834 ms	20404 KB	Output is correct
6	Correct	2488 ms	18744 KB	Output is correct
7	Correct	2502 ms	19544 KB	Output is correct
8	Correct	2570 ms	20212 KB	Output is correct
9	Correct	148 ms	14256 KB	Output is correct
10	Correct	1225 ms	10196 KB	Output is correct
11	Correct	1113 ms	9640 KB	Output is correct
12	Correct	1413 ms	19344 KB	Output is correct
13	Correct	1503 ms	20472 KB	Output is correct

Subtask #3

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1408 ms	18188 KB	Output is correct
2	Correct	1106 ms	12940 KB	Output is correct
3	Correct	1627 ms	15840 KB	Output is correct
4	Correct	1345 ms	18116 KB	Output is correct
5	Correct	143 ms	14192 KB	Output is correct
6	Correct	1564 ms	18356 KB	Output is correct
7	Correct	1240 ms	18392 KB	Output is correct
8	Correct	1113 ms	18240 KB	Output is correct
9	Correct	899 ms	18520 KB	Output is correct
10	Correct	804 ms	18112 KB	Output is correct
11	Correct	952 ms	18204 KB	Output is correct
12	Correct	821 ms	18196 KB	Output is correct

Subtask #4

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1857 ms	27532 KB	Output is correct
2	Correct	140 ms	14204 KB	Output is correct
3	Correct	226 ms	15108 KB	Output is correct
4	Correct	64 ms	6340 KB	Output is correct
5	Correct	455 ms	11184 KB	Output is correct
6	Correct	1822 ms	27396 KB	Output is correct
7	Correct	463 ms	11252 KB	Output is correct
8	Correct	884 ms	20668 KB	Output is correct
9	Correct	899 ms	20624 KB	Output is correct
10	Correct	807 ms	20624 KB	Output is correct
11	Correct	1354 ms	24124 KB	Output is correct
12	Correct	1363 ms	24072 KB	Output is correct
13	Correct	1185 ms	24116 KB	Output is correct
14	Correct	440 ms	11264 KB	Output is correct
15	Correct	479 ms	11400 KB	Output is correct
16	Correct	1799 ms	27360 KB	Output is correct
17	Correct	1875 ms	27384 KB	Output is correct
18	Correct	1865 ms	27456 KB	Output is correct
19	Correct	1839 ms	27444 KB	Output is correct
20	Correct	1340 ms	25268 KB	Output is correct
21	Correct	1361 ms	24908 KB	Output is correct
22	Correct	1647 ms	26996 KB	Output is correct
23	Correct	437 ms	10264 KB	Output is correct

Subtask #5

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1759 ms	20464 KB	Output is correct
2	Correct	1815 ms	20408 KB	Output is correct
3	Correct	1863 ms	20468 KB	Output is correct
4	Correct	1822 ms	20444 KB	Output is correct
5	Correct	1834 ms	20404 KB	Output is correct
6	Correct	2488 ms	18744 KB	Output is correct
7	Correct	2502 ms	19544 KB	Output is correct
8	Correct	2570 ms	20212 KB	Output is correct
9	Correct	148 ms	14256 KB	Output is correct
10	Correct	1225 ms	10196 KB	Output is correct
11	Correct	1113 ms	9640 KB	Output is correct
12	Correct	1413 ms	19344 KB	Output is correct
13	Correct	1503 ms	20472 KB	Output is correct
14	Correct	1408 ms	18188 KB	Output is correct
15	Correct	1106 ms	12940 KB	Output is correct
16	Correct	1627 ms	15840 KB	Output is correct
17	Correct	1345 ms	18116 KB	Output is correct
18	Correct	143 ms	14192 KB	Output is correct
19	Correct	1564 ms	18356 KB	Output is correct
20	Correct	1240 ms	18392 KB	Output is correct
21	Correct	1113 ms	18240 KB	Output is correct
22	Correct	899 ms	18520 KB	Output is correct
23	Correct	804 ms	18112 KB	Output is correct
24	Correct	952 ms	18204 KB	Output is correct
25	Correct	821 ms	18196 KB	Output is correct
26	Correct	1734 ms	20464 KB	Output is correct
27	Correct	2031 ms	18268 KB	Output is correct
28	Correct	1709 ms	20472 KB	Output is correct
29	Correct	1206 ms	20536 KB	Output is correct
30	Correct	1967 ms	19324 KB	Output is correct
31	Correct	2053 ms	19072 KB	Output is correct
32	Correct	2001 ms	19124 KB	Output is correct
33	Correct	1717 ms	20384 KB	Output is correct
34	Correct	1722 ms	20476 KB	Output is correct
35	Correct	1727 ms	20404 KB	Output is correct
36	Correct	1352 ms	20496 KB	Output is correct
37	Correct	1277 ms	20416 KB	Output is correct
38	Correct	1254 ms	20412 KB	Output is correct
39	Correct	1027 ms	20412 KB	Output is correct
40	Correct	1041 ms	20464 KB	Output is correct
41	Correct	1055 ms	20460 KB	Output is correct
42	Correct	1032 ms	20452 KB	Output is correct
43	Correct	1045 ms	20424 KB	Output is correct
44	Correct	1008 ms	20368 KB	Output is correct

Subtask #6

27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	42 ms	1924 KB	Output is correct
4	Correct	9 ms	1612 KB	Output is correct
5	Correct	41 ms	2124 KB	Output is correct
6	Correct	29 ms	2204 KB	Output is correct
7	Correct	41 ms	2300 KB	Output is correct
8	Correct	47 ms	1900 KB	Output is correct
9	Correct	52 ms	3296 KB	Output is correct
10	Correct	48 ms	1992 KB	Output is correct
11	Correct	47 ms	1928 KB	Output is correct
12	Correct	58 ms	2276 KB	Output is correct
13	Correct	55 ms	2100 KB	Output is correct
14	Correct	61 ms	1824 KB	Output is correct
15	Correct	56 ms	2048 KB	Output is correct
16	Correct	46 ms	2636 KB	Output is correct
17	Correct	45 ms	2376 KB	Output is correct
18	Correct	1759 ms	20464 KB	Output is correct
19	Correct	1815 ms	20408 KB	Output is correct
20	Correct	1863 ms	20468 KB	Output is correct
21	Correct	1822 ms	20444 KB	Output is correct
22	Correct	1834 ms	20404 KB	Output is correct
23	Correct	2488 ms	18744 KB	Output is correct
24	Correct	2502 ms	19544 KB	Output is correct
25	Correct	2570 ms	20212 KB	Output is correct
26	Correct	148 ms	14256 KB	Output is correct
27	Correct	1225 ms	10196 KB	Output is correct
28	Correct	1113 ms	9640 KB	Output is correct
29	Correct	1413 ms	19344 KB	Output is correct
30	Correct	1503 ms	20472 KB	Output is correct
31	Correct	1408 ms	18188 KB	Output is correct
32	Correct	1106 ms	12940 KB	Output is correct
33	Correct	1627 ms	15840 KB	Output is correct
34	Correct	1345 ms	18116 KB	Output is correct
35	Correct	143 ms	14192 KB	Output is correct
36	Correct	1564 ms	18356 KB	Output is correct
37	Correct	1240 ms	18392 KB	Output is correct
38	Correct	1113 ms	18240 KB	Output is correct
39	Correct	899 ms	18520 KB	Output is correct
40	Correct	804 ms	18112 KB	Output is correct
41	Correct	952 ms	18204 KB	Output is correct
42	Correct	821 ms	18196 KB	Output is correct
43	Correct	1857 ms	27532 KB	Output is correct
44	Correct	140 ms	14204 KB	Output is correct
45	Correct	226 ms	15108 KB	Output is correct
46	Correct	64 ms	6340 KB	Output is correct
47	Correct	455 ms	11184 KB	Output is correct
48	Correct	1822 ms	27396 KB	Output is correct
49	Correct	463 ms	11252 KB	Output is correct
50	Correct	884 ms	20668 KB	Output is correct
51	Correct	899 ms	20624 KB	Output is correct
52	Correct	807 ms	20624 KB	Output is correct
53	Correct	1354 ms	24124 KB	Output is correct
54	Correct	1363 ms	24072 KB	Output is correct
55	Correct	1185 ms	24116 KB	Output is correct
56	Correct	440 ms	11264 KB	Output is correct
57	Correct	479 ms	11400 KB	Output is correct
58	Correct	1799 ms	27360 KB	Output is correct
59	Correct	1875 ms	27384 KB	Output is correct
60	Correct	1865 ms	27456 KB	Output is correct
61	Correct	1839 ms	27444 KB	Output is correct
62	Correct	1340 ms	25268 KB	Output is correct
63	Correct	1361 ms	24908 KB	Output is correct
64	Correct	1647 ms	26996 KB	Output is correct
65	Correct	437 ms	10264 KB	Output is correct
66	Correct	1734 ms	20464 KB	Output is correct
67	Correct	2031 ms	18268 KB	Output is correct
68	Correct	1709 ms	20472 KB	Output is correct
69	Correct	1206 ms	20536 KB	Output is correct
70	Correct	1967 ms	19324 KB	Output is correct
71	Correct	2053 ms	19072 KB	Output is correct
72	Correct	2001 ms	19124 KB	Output is correct
73	Correct	1717 ms	20384 KB	Output is correct
74	Correct	1722 ms	20476 KB	Output is correct
75	Correct	1727 ms	20404 KB	Output is correct
76	Correct	1352 ms	20496 KB	Output is correct
77	Correct	1277 ms	20416 KB	Output is correct
78	Correct	1254 ms	20412 KB	Output is correct
79	Correct	1027 ms	20412 KB	Output is correct
80	Correct	1041 ms	20464 KB	Output is correct
81	Correct	1055 ms	20460 KB	Output is correct
82	Correct	1032 ms	20452 KB	Output is correct
83	Correct	1045 ms	20424 KB	Output is correct
84	Correct	1008 ms	20368 KB	Output is correct
85	Correct	2360 ms	27136 KB	Output is correct
86	Correct	260 ms	14912 KB	Output is correct
87	Correct	107 ms	8560 KB	Output is correct
88	Correct	946 ms	12296 KB	Output is correct
89	Correct	2373 ms	27060 KB	Output is correct
90	Correct	944 ms	12424 KB	Output is correct
91	Correct	1797 ms	20488 KB	Output is correct
92	Correct	1805 ms	20404 KB	Output is correct
93	Correct	2557 ms	20588 KB	Output is correct
94	Correct	1978 ms	23812 KB	Output is correct
95	Correct	1999 ms	23728 KB	Output is correct
96	Correct	2201 ms	23920 KB	Output is correct
97	Correct	619 ms	11832 KB	Output is correct
98	Correct	659 ms	10724 KB	Output is correct
99	Correct	2376 ms	26932 KB	Output is correct
100	Correct	2297 ms	26936 KB	Output is correct
101	Correct	2438 ms	27016 KB	Output is correct
102	Correct	2443 ms	27036 KB	Output is correct
103	Correct	2413 ms	25084 KB	Output is correct
104	Correct	2359 ms	25148 KB	Output is correct
105	Correct	1849 ms	24968 KB	Output is correct
106	Correct	1537 ms	23808 KB	Output is correct
107	Correct	1627 ms	25124 KB	Output is correct
108	Correct	2392 ms	26808 KB	Output is correct
109	Correct	1129 ms	12340 KB	Output is correct