oj.uz

Submission #357874

# Submission time Handle Problem Language Result Execution time Memory
357874 2021-01-24T21:12:44 Z shivensinha4 Bridges (APIO19_bridges) C++17
100 / 100
 2580 ms 8424 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 = 1000;

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;
	array<int, 2> edge[m]; // {a, b, w}
	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;
	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]);
	}
	
	bool change[m];
	UFDS ufds;
	vector<array<int, 2>> same;
	int pt = 0;
	vector<vi> adj(n);
	int adjChange[n], lastSeen[n];
	vi changed;
	for_(i, 0, n) lastSeen[i] = -1;
	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(); memset(change, false, sizeof(change));
			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:102: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]
  102 |     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 0 ms 364 KB Output is correct
3 Correct 37 ms 620 KB Output is correct
4 Correct 10 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 22 ms 620 KB Output is correct
8 Correct 22 ms 620 KB Output is correct
9 Correct 27 ms 620 KB Output is correct
10 Correct 20 ms 620 KB Output is correct
11 Correct 19 ms 620 KB Output is correct
12 Correct 21 ms 604 KB Output is correct
13 Correct 32 ms 620 KB Output is correct
14 Correct 25 ms 620 KB Output is correct
15 Correct 23 ms 620 KB Output is correct
16 Correct 23 ms 620 KB Output is correct
17 Correct 22 ms 620 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1866 ms 7236 KB Output is correct
2 Correct 1747 ms 7280 KB Output is correct
3 Correct 1751 ms 7284 KB Output is correct
4 Correct 1754 ms 7244 KB Output is correct
5 Correct 1697 ms 7212 KB Output is correct
6 Correct 2580 ms 6484 KB Output is correct
7 Correct 2427 ms 6592 KB Output is correct
8 Correct 2360 ms 6460 KB Output is correct
9 Correct 96 ms 2924 KB Output is correct
10 Correct 1990 ms 7508 KB Output is correct
11 Correct 1903 ms 7232 KB Output is correct
12 Correct 1431 ms 6792 KB Output is correct
13 Correct 1431 ms 6252 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1453 ms 5900 KB Output is correct
2 Correct 1177 ms 3684 KB Output is correct
3 Correct 1934 ms 6148 KB Output is correct
4 Correct 1521 ms 5968 KB Output is correct
5 Correct 107 ms 2924 KB Output is correct
6 Correct 1625 ms 5736 KB Output is correct
7 Correct 1358 ms 5852 KB Output is correct
8 Correct 1174 ms 5872 KB Output is correct
9 Correct 997 ms 5808 KB Output is correct
10 Correct 883 ms 5764 KB Output is correct
11 Correct 957 ms 5476 KB Output is correct
12 Correct 844 ms 5712 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1737 ms 7312 KB Output is correct
2 Correct 93 ms 2924 KB Output is correct
3 Correct 171 ms 3052 KB Output is correct
4 Correct 122 ms 3052 KB Output is correct
5 Correct 1704 ms 7440 KB Output is correct
6 Correct 1711 ms 7312 KB Output is correct
7 Correct 1743 ms 7440 KB Output is correct
8 Correct 956 ms 6028 KB Output is correct
9 Correct 947 ms 6028 KB Output is correct
10 Correct 950 ms 6284 KB Output is correct
11 Correct 1442 ms 6768 KB Output is correct
12 Correct 1375 ms 6768 KB Output is correct
13 Correct 1406 ms 6800 KB Output is correct
14 Correct 1499 ms 7440 KB Output is correct
15 Correct 1682 ms 7440 KB Output is correct
16 Correct 1826 ms 7284 KB Output is correct
17 Correct 1828 ms 7288 KB Output is correct
18 Correct 1786 ms 7404 KB Output is correct
19 Correct 1828 ms 7296 KB Output is correct
20 Correct 1548 ms 7100 KB Output is correct
21 Correct 1536 ms 7104 KB Output is correct
22 Correct 1693 ms 7296 KB Output is correct
23 Correct 1718 ms 6892 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1866 ms 7236 KB Output is correct
2 Correct 1747 ms 7280 KB Output is correct
3 Correct 1751 ms 7284 KB Output is correct
4 Correct 1754 ms 7244 KB Output is correct
5 Correct 1697 ms 7212 KB Output is correct
6 Correct 2580 ms 6484 KB Output is correct
7 Correct 2427 ms 6592 KB Output is correct
8 Correct 2360 ms 6460 KB Output is correct
9 Correct 96 ms 2924 KB Output is correct
10 Correct 1990 ms 7508 KB Output is correct
11 Correct 1903 ms 7232 KB Output is correct
12 Correct 1431 ms 6792 KB Output is correct
13 Correct 1431 ms 6252 KB Output is correct
14 Correct 1453 ms 5900 KB Output is correct
15 Correct 1177 ms 3684 KB Output is correct
16 Correct 1934 ms 6148 KB Output is correct
17 Correct 1521 ms 5968 KB Output is correct
18 Correct 107 ms 2924 KB Output is correct
19 Correct 1625 ms 5736 KB Output is correct
20 Correct 1358 ms 5852 KB Output is correct
21 Correct 1174 ms 5872 KB Output is correct
22 Correct 997 ms 5808 KB Output is correct
23 Correct 883 ms 5764 KB Output is correct
24 Correct 957 ms 5476 KB Output is correct
25 Correct 844 ms 5712 KB Output is correct
26 Correct 1924 ms 7308 KB Output is correct
27 Correct 2372 ms 7248 KB Output is correct
28 Correct 1955 ms 7240 KB Output is correct
29 Correct 1430 ms 7200 KB Output is correct
30 Correct 2337 ms 7268 KB Output is correct
31 Correct 2387 ms 7196 KB Output is correct
32 Correct 2387 ms 7200 KB Output is correct
33 Correct 1942 ms 7152 KB Output is correct
34 Correct 1924 ms 7152 KB Output is correct
35 Correct 1911 ms 7316 KB Output is correct
36 Correct 1519 ms 7148 KB Output is correct
37 Correct 1461 ms 7264 KB Output is correct
38 Correct 1433 ms 7212 KB Output is correct
39 Correct 1177 ms 7024 KB Output is correct
40 Correct 1188 ms 6824 KB Output is correct
41 Correct 1128 ms 6932 KB Output is correct
42 Correct 1105 ms 7024 KB Output is correct
43 Correct 1081 ms 6892 KB Output is correct
44 Correct 1094 ms 6892 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 0 ms 364 KB Output is correct
3 Correct 37 ms 620 KB Output is correct
4 Correct 10 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 22 ms 620 KB Output is correct
8 Correct 22 ms 620 KB Output is correct
9 Correct 27 ms 620 KB Output is correct
10 Correct 20 ms 620 KB Output is correct
11 Correct 19 ms 620 KB Output is correct
12 Correct 21 ms 604 KB Output is correct
13 Correct 32 ms 620 KB Output is correct
14 Correct 25 ms 620 KB Output is correct
15 Correct 23 ms 620 KB Output is correct
16 Correct 23 ms 620 KB Output is correct
17 Correct 22 ms 620 KB Output is correct
18 Correct 1866 ms 7236 KB Output is correct
19 Correct 1747 ms 7280 KB Output is correct
20 Correct 1751 ms 7284 KB Output is correct
21 Correct 1754 ms 7244 KB Output is correct
22 Correct 1697 ms 7212 KB Output is correct
23 Correct 2580 ms 6484 KB Output is correct
24 Correct 2427 ms 6592 KB Output is correct
25 Correct 2360 ms 6460 KB Output is correct
26 Correct 96 ms 2924 KB Output is correct
27 Correct 1990 ms 7508 KB Output is correct
28 Correct 1903 ms 7232 KB Output is correct
29 Correct 1431 ms 6792 KB Output is correct
30 Correct 1431 ms 6252 KB Output is correct
31 Correct 1453 ms 5900 KB Output is correct
32 Correct 1177 ms 3684 KB Output is correct
33 Correct 1934 ms 6148 KB Output is correct
34 Correct 1521 ms 5968 KB Output is correct
35 Correct 107 ms 2924 KB Output is correct
36 Correct 1625 ms 5736 KB Output is correct
37 Correct 1358 ms 5852 KB Output is correct
38 Correct 1174 ms 5872 KB Output is correct
39 Correct 997 ms 5808 KB Output is correct
40 Correct 883 ms 5764 KB Output is correct
41 Correct 957 ms 5476 KB Output is correct
42 Correct 844 ms 5712 KB Output is correct
43 Correct 1737 ms 7312 KB Output is correct
44 Correct 93 ms 2924 KB Output is correct
45 Correct 171 ms 3052 KB Output is correct
46 Correct 122 ms 3052 KB Output is correct
47 Correct 1704 ms 7440 KB Output is correct
48 Correct 1711 ms 7312 KB Output is correct
49 Correct 1743 ms 7440 KB Output is correct
50 Correct 956 ms 6028 KB Output is correct
51 Correct 947 ms 6028 KB Output is correct
52 Correct 950 ms 6284 KB Output is correct
53 Correct 1442 ms 6768 KB Output is correct
54 Correct 1375 ms 6768 KB Output is correct
55 Correct 1406 ms 6800 KB Output is correct
56 Correct 1499 ms 7440 KB Output is correct
57 Correct 1682 ms 7440 KB Output is correct
58 Correct 1826 ms 7284 KB Output is correct
59 Correct 1828 ms 7288 KB Output is correct
60 Correct 1786 ms 7404 KB Output is correct
61 Correct 1828 ms 7296 KB Output is correct
62 Correct 1548 ms 7100 KB Output is correct
63 Correct 1536 ms 7104 KB Output is correct
64 Correct 1693 ms 7296 KB Output is correct
65 Correct 1718 ms 6892 KB Output is correct
66 Correct 1924 ms 7308 KB Output is correct
67 Correct 2372 ms 7248 KB Output is correct
68 Correct 1955 ms 7240 KB Output is correct
69 Correct 1430 ms 7200 KB Output is correct
70 Correct 2337 ms 7268 KB Output is correct
71 Correct 2387 ms 7196 KB Output is correct
72 Correct 2387 ms 7200 KB Output is correct
73 Correct 1942 ms 7152 KB Output is correct
74 Correct 1924 ms 7152 KB Output is correct
75 Correct 1911 ms 7316 KB Output is correct
76 Correct 1519 ms 7148 KB Output is correct
77 Correct 1461 ms 7264 KB Output is correct
78 Correct 1433 ms 7212 KB Output is correct
79 Correct 1177 ms 7024 KB Output is correct
80 Correct 1188 ms 6824 KB Output is correct
81 Correct 1128 ms 6932 KB Output is correct
82 Correct 1105 ms 7024 KB Output is correct
83 Correct 1081 ms 6892 KB Output is correct
84 Correct 1094 ms 6892 KB Output is correct
85 Correct 2352 ms 8424 KB Output is correct
86 Correct 214 ms 3296 KB Output is correct
87 Correct 178 ms 3168 KB Output is correct
88 Correct 2335 ms 8008 KB Output is correct
89 Correct 2327 ms 8244 KB Output is correct
90 Correct 2349 ms 7680 KB Output is correct
91 Correct 1956 ms 7144 KB Output is correct
92 Correct 1935 ms 7264 KB Output is correct
93 Correct 2579 ms 6732 KB Output is correct
94 Correct 2013 ms 7768 KB Output is correct
95 Correct 2076 ms 8080 KB Output is correct
96 Correct 1966 ms 6588 KB Output is correct
97 Correct 2154 ms 7824 KB Output is correct
98 Correct 1995 ms 7256 KB Output is correct
99 Correct 2316 ms 8324 KB Output is correct
100 Correct 2303 ms 8296 KB Output is correct
101 Correct 2430 ms 8304 KB Output is correct
102 Correct 2393 ms 8420 KB Output is correct
103 Correct 2053 ms 7036 KB Output is correct
104 Correct 2054 ms 6880 KB Output is correct
105 Correct 1693 ms 6504 KB Output is correct
106 Correct 1430 ms 6112 KB Output is correct
107 Correct 1748 ms 7532 KB Output is correct
108 Correct 2238 ms 7144 KB Output is correct
109 Correct 2151 ms 6592 KB Output is correct