oj.uz

Submission #357869

# Submission time Handle Problem Language Result Execution time Memory
357869 2021-01-24T21:06:23 Z shivensinha4 Bridges (APIO19_bridges) C++17
100 / 100
 2735 ms 8396 KB 
/*
 * Divide queries into blocks of sqrt(m).
 * For each block, at max sqrt(m) edges will be changed.
 * For the edges which do not change, maintain a set of nodes 
 */
#include "bits/stdc++.h"
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'

class UFDS {
public:
	vi p, rank, sz; int count = 0;
	
	void build(int n) {
		p.assign(n, 0); rank.assign(n, 0); sz.assign(n, 1);
		for_(i, 0, n) p[i] = i;
		count = n;
	}
	int getParent(int i) {
		return (p[i] == i) ? i : (p[i] = getParent(p[i]));
	}
	void join(int i, int j) {
		int a = getParent(i), b = getParent(j);
		if (a == b) return;
		count -= 1;
		if (rank[a] > rank[b]) {
			p[b] = a;
			sz[a] += sz[b];
		} else {
			p[a] = b;
			if (rank[a] == rank[b]) rank[b] += 1;
			sz[b] += sz[a];
		}
	}
};

const int bs = 800;

int main() {
#ifdef mlocal
	freopen("test.in", "r", stdin);
#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n, m; cin >> n >> m;
	vector<array<int, 2>> edge(m); // {a, b, w}
	vector<int> wt(m);
	for_(i, 0, m) {
		cin >> edge[i][0] >> edge[i][1] >> wt[i];
		edge[i][0] -= 1; edge[i][1] -= 1;
	}
	
	int q; cin >> q;
	vector<array<int, 3>> qr(q); // {for car: {type (2), weight, node}
	for_(i, 0, q) {
		cin >> qr[i][0] >> qr[i][1] >> qr[i][2];
		qr[i][1] -= 1;
		if (qr[i][0] == 2) swap(qr[i][1], qr[i][2]);
	}
	
	vector<bool> change(m, false);
	UFDS ufds;
	vector<array<int, 2>> same;
	int pt = 0;
	vector<vi> adj(n);
	vi adjChange(n), changed, lastSeen(n, -1);
	vector<int> currWt(m);
	vector<vector<array<int, 2>>> carQr;
	for_(qq, 0, q) {
		if ((qq % bs) == 0) carQr.push_back({});
		if (qr[qq][0] == 2) carQr[carQr.size()-1].push_back({qr[qq][1], qq});
	}
	
	for_(i, 0, carQr.size()) sort(carQr[i].begin(), carQr[i].end(), greater<>());
	
	int bpt = 0;
	vi fin(q, -1);
	for (auto &b: carQr) {
		int bStart = bpt*bs;
		if (b.size()) {
			pt = 0;
			ufds.build(n); same.clear(); changed.clear(); change.assign(m, false);
			for_(i, bStart, min(q, bStart+bs)) if (qr[i][0] == 1) change[qr[i][1]] = true;
			
			for_(i, 0, m) {
				if (!change[i]) same.push_back({wt[i], i});
				else changed.push_back(i);
			}
			sort(same.begin(), same.end(), greater<>());
			
			for (auto &car: b) {
				int qq = car[1];
				while (pt < same.size() and same[pt][0] >= qr[qq][1]) {
					ufds.join(edge[same[pt][1]][0], edge[same[pt][1]][1]);
					pt++;
				}
				
				for (auto &e: changed) currWt[e] = wt[e];
				for_(i, bStart, qq) if (qr[i][0] == 1) currWt[qr[i][1]] = qr[i][2];
				for (auto &e: changed) {
					if (currWt[e] < qr[qq][1]) continue;
					int c1 = ufds.getParent(edge[e][0]), c2 = ufds.getParent(edge[e][1]);
					if (c1 == c2) continue;
					if (adjChange[c1] != qq) {
						adjChange[c1] = qq;
						adj[c1].clear();
					}
					if (adjChange[c2] != qq) {
						adjChange[c2] = qq;
						adj[c2].clear();
					}
					
					adj[c1].push_back(c2); adj[c2].push_back(c1);
				}
				
				int cp = ufds.getParent(qr[qq][2]);
				int ans = ufds.sz[cp];
				queue<int> qu;
				lastSeen[cp] = qq;
				qu.push(cp);
				while (qu.size()) {
					int p = qu.front(); qu.pop();
					if (adjChange[p] == qq) for (auto i: adj[p])  {
							if (lastSeen[i] == qq) continue;
							lastSeen[i] = qq;
							qu.push(i);
							ans += ufds.sz[i];
						}
				}
				fin[qq] = ans;
			}
		}
		
		for_(i, bStart, min((bpt+1)*bs, q)) if (qr[i][0] == 1) wt[qr[i][1]] = qr[i][2];
		bpt++;
	}
	
	for (auto i: fin) if (i != -1) cout << i << endl;
	
	return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:100:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |     while (pt < same.size() and same[pt][0] >= qr[qq][1]) {
      |            ~~~^~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 32 ms 620 KB Output is correct
4 Correct 11 ms 620 KB Output is correct
5 Correct 19 ms 620 KB Output is correct
6 Correct 18 ms 620 KB Output is correct
7 Correct 24 ms 620 KB Output is correct
8 Correct 21 ms 620 KB Output is correct
9 Correct 30 ms 620 KB Output is correct
10 Correct 21 ms 616 KB Output is correct
11 Correct 19 ms 620 KB Output is correct
12 Correct 23 ms 620 KB Output is correct
13 Correct 28 ms 620 KB Output is correct
14 Correct 26 ms 620 KB Output is correct
15 Correct 23 ms 620 KB Output is correct
16 Correct 24 ms 620 KB Output is correct
17 Correct 25 ms 620 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1837 ms 7300 KB Output is correct
2 Correct 1895 ms 7320 KB Output is correct
3 Correct 1854 ms 7360 KB Output is correct
4 Correct 1800 ms 7172 KB Output is correct
5 Correct 1895 ms 7404 KB Output is correct
6 Correct 2567 ms 6468 KB Output is correct
7 Correct 2300 ms 6400 KB Output is correct
8 Correct 2318 ms 6500 KB Output is correct
9 Correct 85 ms 3112 KB Output is correct
10 Correct 1893 ms 7404 KB Output is correct
11 Correct 1933 ms 7328 KB Output is correct
12 Correct 1574 ms 6952 KB Output is correct
13 Correct 1533 ms 6196 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1478 ms 5848 KB Output is correct
2 Correct 1102 ms 3524 KB Output is correct
3 Correct 1828 ms 5932 KB Output is correct
4 Correct 1511 ms 5724 KB Output is correct
5 Correct 134 ms 3180 KB Output is correct
6 Correct 1675 ms 5716 KB Output is correct
7 Correct 1400 ms 5800 KB Output is correct
8 Correct 1210 ms 5896 KB Output is correct
9 Correct 1070 ms 5864 KB Output is correct
10 Correct 968 ms 5868 KB Output is correct
11 Correct 1028 ms 5616 KB Output is correct
12 Correct 958 ms 5488 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2218 ms 8012 KB Output is correct
2 Correct 87 ms 3180 KB Output is correct
3 Correct 212 ms 3432 KB Output is correct
4 Correct 142 ms 3304 KB Output is correct
5 Correct 2082 ms 8140 KB Output is correct
6 Correct 2220 ms 8012 KB Output is correct
7 Correct 2178 ms 8140 KB Output is correct
8 Correct 1169 ms 6568 KB Output is correct
9 Correct 1280 ms 6568 KB Output is correct
10 Correct 1162 ms 6756 KB Output is correct
11 Correct 1746 ms 7396 KB Output is correct
12 Correct 1752 ms 7396 KB Output is correct
13 Correct 1714 ms 7520 KB Output is correct
14 Correct 1889 ms 8140 KB Output is correct
15 Correct 2015 ms 8140 KB Output is correct
16 Correct 2259 ms 7984 KB Output is correct
17 Correct 2209 ms 7984 KB Output is correct
18 Correct 2181 ms 8004 KB Output is correct
19 Correct 2189 ms 7988 KB Output is correct
20 Correct 1914 ms 7744 KB Output is correct
21 Correct 1982 ms 7744 KB Output is correct
22 Correct 2072 ms 7968 KB Output is correct
23 Correct 2089 ms 7452 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1837 ms 7300 KB Output is correct
2 Correct 1895 ms 7320 KB Output is correct
3 Correct 1854 ms 7360 KB Output is correct
4 Correct 1800 ms 7172 KB Output is correct
5 Correct 1895 ms 7404 KB Output is correct
6 Correct 2567 ms 6468 KB Output is correct
7 Correct 2300 ms 6400 KB Output is correct
8 Correct 2318 ms 6500 KB Output is correct
9 Correct 85 ms 3112 KB Output is correct
10 Correct 1893 ms 7404 KB Output is correct
11 Correct 1933 ms 7328 KB Output is correct
12 Correct 1574 ms 6952 KB Output is correct
13 Correct 1533 ms 6196 KB Output is correct
14 Correct 1478 ms 5848 KB Output is correct
15 Correct 1102 ms 3524 KB Output is correct
16 Correct 1828 ms 5932 KB Output is correct
17 Correct 1511 ms 5724 KB Output is correct
18 Correct 134 ms 3180 KB Output is correct
19 Correct 1675 ms 5716 KB Output is correct
20 Correct 1400 ms 5800 KB Output is correct
21 Correct 1210 ms 5896 KB Output is correct
22 Correct 1070 ms 5864 KB Output is correct
23 Correct 968 ms 5868 KB Output is correct
24 Correct 1028 ms 5616 KB Output is correct
25 Correct 958 ms 5488 KB Output is correct
26 Correct 1946 ms 7380 KB Output is correct
27 Correct 2289 ms 7568 KB Output is correct
28 Correct 1942 ms 7196 KB Output is correct
29 Correct 1519 ms 7304 KB Output is correct
30 Correct 2251 ms 7308 KB Output is correct
31 Correct 2288 ms 7288 KB Output is correct
32 Correct 2312 ms 7476 KB Output is correct
33 Correct 1957 ms 7264 KB Output is correct
34 Correct 1977 ms 7400 KB Output is correct
35 Correct 1996 ms 7324 KB Output is correct
36 Correct 1622 ms 7056 KB Output is correct
37 Correct 1582 ms 7072 KB Output is correct
38 Correct 1580 ms 7276 KB Output is correct
39 Correct 1325 ms 7268 KB Output is correct
40 Correct 1302 ms 7172 KB Output is correct
41 Correct 1305 ms 7244 KB Output is correct
42 Correct 1261 ms 7144 KB Output is correct
43 Correct 1282 ms 7016 KB Output is correct
44 Correct 1249 ms 7016 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 32 ms 620 KB Output is correct
4 Correct 11 ms 620 KB Output is correct
5 Correct 19 ms 620 KB Output is correct
6 Correct 18 ms 620 KB Output is correct
7 Correct 24 ms 620 KB Output is correct
8 Correct 21 ms 620 KB Output is correct
9 Correct 30 ms 620 KB Output is correct
10 Correct 21 ms 616 KB Output is correct
11 Correct 19 ms 620 KB Output is correct
12 Correct 23 ms 620 KB Output is correct
13 Correct 28 ms 620 KB Output is correct
14 Correct 26 ms 620 KB Output is correct
15 Correct 23 ms 620 KB Output is correct
16 Correct 24 ms 620 KB Output is correct
17 Correct 25 ms 620 KB Output is correct
18 Correct 1837 ms 7300 KB Output is correct
19 Correct 1895 ms 7320 KB Output is correct
20 Correct 1854 ms 7360 KB Output is correct
21 Correct 1800 ms 7172 KB Output is correct
22 Correct 1895 ms 7404 KB Output is correct
23 Correct 2567 ms 6468 KB Output is correct
24 Correct 2300 ms 6400 KB Output is correct
25 Correct 2318 ms 6500 KB Output is correct
26 Correct 85 ms 3112 KB Output is correct
27 Correct 1893 ms 7404 KB Output is correct
28 Correct 1933 ms 7328 KB Output is correct
29 Correct 1574 ms 6952 KB Output is correct
30 Correct 1533 ms 6196 KB Output is correct
31 Correct 1478 ms 5848 KB Output is correct
32 Correct 1102 ms 3524 KB Output is correct
33 Correct 1828 ms 5932 KB Output is correct
34 Correct 1511 ms 5724 KB Output is correct
35 Correct 134 ms 3180 KB Output is correct
36 Correct 1675 ms 5716 KB Output is correct
37 Correct 1400 ms 5800 KB Output is correct
38 Correct 1210 ms 5896 KB Output is correct
39 Correct 1070 ms 5864 KB Output is correct
40 Correct 968 ms 5868 KB Output is correct
41 Correct 1028 ms 5616 KB Output is correct
42 Correct 958 ms 5488 KB Output is correct
43 Correct 2218 ms 8012 KB Output is correct
44 Correct 87 ms 3180 KB Output is correct
45 Correct 212 ms 3432 KB Output is correct
46 Correct 142 ms 3304 KB Output is correct
47 Correct 2082 ms 8140 KB Output is correct
48 Correct 2220 ms 8012 KB Output is correct
49 Correct 2178 ms 8140 KB Output is correct
50 Correct 1169 ms 6568 KB Output is correct
51 Correct 1280 ms 6568 KB Output is correct
52 Correct 1162 ms 6756 KB Output is correct
53 Correct 1746 ms 7396 KB Output is correct
54 Correct 1752 ms 7396 KB Output is correct
55 Correct 1714 ms 7520 KB Output is correct
56 Correct 1889 ms 8140 KB Output is correct
57 Correct 2015 ms 8140 KB Output is correct
58 Correct 2259 ms 7984 KB Output is correct
59 Correct 2209 ms 7984 KB Output is correct
60 Correct 2181 ms 8004 KB Output is correct
61 Correct 2189 ms 7988 KB Output is correct
62 Correct 1914 ms 7744 KB Output is correct
63 Correct 1982 ms 7744 KB Output is correct
64 Correct 2072 ms 7968 KB Output is correct
65 Correct 2089 ms 7452 KB Output is correct
66 Correct 1946 ms 7380 KB Output is correct
67 Correct 2289 ms 7568 KB Output is correct
68 Correct 1942 ms 7196 KB Output is correct
69 Correct 1519 ms 7304 KB Output is correct
70 Correct 2251 ms 7308 KB Output is correct
71 Correct 2288 ms 7288 KB Output is correct
72 Correct 2312 ms 7476 KB Output is correct
73 Correct 1957 ms 7264 KB Output is correct
74 Correct 1977 ms 7400 KB Output is correct
75 Correct 1996 ms 7324 KB Output is correct
76 Correct 1622 ms 7056 KB Output is correct
77 Correct 1582 ms 7072 KB Output is correct
78 Correct 1580 ms 7276 KB Output is correct
79 Correct 1325 ms 7268 KB Output is correct
80 Correct 1302 ms 7172 KB Output is correct
81 Correct 1305 ms 7244 KB Output is correct
82 Correct 1261 ms 7144 KB Output is correct
83 Correct 1282 ms 7016 KB Output is correct
84 Correct 1249 ms 7016 KB Output is correct
85 Correct 2650 ms 8224 KB Output is correct
86 Correct 245 ms 3300 KB Output is correct
87 Correct 210 ms 3300 KB Output is correct
88 Correct 2589 ms 8116 KB Output is correct
89 Correct 2671 ms 8388 KB Output is correct
90 Correct 2595 ms 8040 KB Output is correct
91 Correct 1991 ms 7396 KB Output is correct
92 Correct 1976 ms 7336 KB Output is correct
93 Correct 2448 ms 6664 KB Output is correct
94 Correct 2202 ms 7916 KB Output is correct
95 Correct 2290 ms 7844 KB Output is correct
96 Correct 2140 ms 6892 KB Output is correct
97 Correct 2350 ms 8396 KB Output is correct
98 Correct 2285 ms 7364 KB Output is correct
99 Correct 2650 ms 8284 KB Output is correct
100 Correct 2642 ms 8252 KB Output is correct
101 Correct 2727 ms 8188 KB Output is correct
102 Correct 2735 ms 8252 KB Output is correct
103 Correct 2319 ms 7020 KB Output is correct
104 Correct 2327 ms 7020 KB Output is correct
105 Correct 1991 ms 6636 KB Output is correct
106 Correct 1726 ms 6500 KB Output is correct
107 Correct 2101 ms 7648 KB Output is correct
108 Correct 2539 ms 7248 KB Output is correct
109 Correct 2378 ms 6912 KB Output is correct