oj.uz

Submission #568334

# Submission time Handle Problem Language Result Execution time Memory
568334 2022-05-25T08:44:31 Z 8e7 Bridges (APIO19_bridges) C++17
100 / 100
 2315 ms 7836 KB 
//Challenge: Accepted
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T,class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 100005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
const int inf = 1<<30, bs = 550;

pii ed[maxn];
int wei[maxn];
struct DSU{
	int par[maxn], siz[maxn];
	vector<pii> op;
	void init(int n) {
		op.clear();
		for (int i = 1;i <= n;i++) par[i] = i, siz[i] = 1;
	}
	int find(int a) {
		while (a != par[a]) a = par[a];
		return a;
	}
	void Union(int a, int b, bool rec) {
		a = find(a), b = find(b);
		if (a == b) return;
		if (siz[a] < siz[b]) swap(a, b);
		par[b] = a;
		siz[a] += siz[b];
		if (rec) op.push_back({a, b}); //ss -> ff
	}
	void undo() {
		reverse(op.begin(), op.end());
		for (auto [a, b]:op) {
			par[b] = b;
			siz[a] -= siz[b];
		}
		op.clear();
	}
} d;
int ans[maxn];
struct obj{
	int type, x, y, id;
	obj(){type = x = y = id = 0;}
	obj(int a, int b, int c, int D){type = a, x = b, y = c, id = D;}
};
bool ch[maxn];
int main() {
	io
	int n, m;
	cin >> n >> m;
	for (int i = 0;i < m;i++) {
		int u, v, w;
		cin >> u >> v >> w;
		ed[i] = {u, v};
		wei[i] = w;
	}
	
	int q;
	cin >> q;
	vector<obj> bat;
	auto solve = [&] () {
		vector<pii> e;
		vector<obj> que, change;
		vector<pii> mod;
		for (auto ev:bat) {
			if (ev.type == 1) {
				ch[ev.x] = 1;	
				change.push_back(ev);
			} else {
				que.push_back(ev);
			}
		}
		sort(que.begin(), que.end(), [&] (obj x, obj y){return x.y > y.y;});
		for (int i = 0;i < m;i++) {
			if (!ch[i]) e.push_back({wei[i], i});
			else mod.push_back({i, wei[i]});
		}
		sort(e.begin(), e.end(), [&] (pii x, pii y){return x > y;});
		int ind = 0;
		d.init(n);
		for (auto [type, x, y, id]:que) {
			while (ind < e.size() && e[ind].ff >= y) {
				d.Union(ed[e[ind].ss].ff, ed[e[ind].ss].ss, 0);
				ind++;
			}
			for (auto ev:change) {
				if (ev.id >= id) break;
				wei[ev.x] = ev.y;
			}
			for (auto [i, j]:mod) {
				if (wei[i] >= y) d.Union(ed[i].ff, ed[i].ss, 1);
			}
			ans[id] = d.siz[d.find(x)];
			for (auto [i, j]:mod) wei[i] = j;
			d.undo();
		}
		for (int i = 0;i < m;i++) ch[i] = 0;		
		for (auto ev:change) {
			wei[ev.x] = ev.y;
		}
		bat.clear();
	};
	int qid = 1;
	int modcnt = 0;
	while (q--) {
		int type; cin >> type;
		if (type == 1) {
			int bi, ri;
			cin >> bi >> ri;
			bi--;
			bat.push_back(obj(type, bi, ri, qid-1));
			modcnt++;
		} else {
			int s, w;
			cin >> s >> w;
			bat.push_back(obj(type, s, w, qid++));
		}
		if (modcnt >= bs) {
			solve();
			modcnt = 0;
		}
	}
	solve();
	for (int i = 1;i < qid;i++) cout << ans[i] << "\n";
}
/*
7 6
1 2 4
1 3 5
2 4 2
2 5 1
3 6 7
3 7 3
5
2 3 3
1 4 3
2 3 5
2 2 2
2 1 6
*/

Compilation message

bridges.cpp: In lambda function:
bridges.cpp:96:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |    while (ind < e.size() && e[ind].ff >= y) {
      |           ~~~~^~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 33 ms 540 KB Output is correct
4 Correct 5 ms 984 KB Output is correct
5 Correct 14 ms 468 KB Output is correct
6 Correct 12 ms 568 KB Output is correct
7 Correct 13 ms 528 KB Output is correct
8 Correct 16 ms 560 KB Output is correct
9 Correct 14 ms 524 KB Output is correct
10 Correct 14 ms 480 KB Output is correct
11 Correct 15 ms 588 KB Output is correct
12 Correct 16 ms 560 KB Output is correct
13 Correct 19 ms 592 KB Output is correct
14 Correct 19 ms 596 KB Output is correct
15 Correct 16 ms 596 KB Output is correct
16 Correct 15 ms 468 KB Output is correct
17 Correct 16 ms 480 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1336 ms 2776 KB Output is correct
2 Correct 1240 ms 3184 KB Output is correct
3 Correct 1291 ms 3088 KB Output is correct
4 Correct 1278 ms 3116 KB Output is correct
5 Correct 1309 ms 3116 KB Output is correct
6 Correct 1730 ms 3216 KB Output is correct
7 Correct 1717 ms 3044 KB Output is correct
8 Correct 1720 ms 3160 KB Output is correct
9 Correct 44 ms 5308 KB Output is correct
10 Correct 1083 ms 2940 KB Output is correct
11 Correct 1087 ms 3028 KB Output is correct
12 Correct 2076 ms 3300 KB Output is correct
13 Correct 1346 ms 2876 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1025 ms 2260 KB Output is correct
2 Correct 704 ms 1388 KB Output is correct
3 Correct 1164 ms 2284 KB Output is correct
4 Correct 959 ms 2368 KB Output is correct
5 Correct 41 ms 5272 KB Output is correct
6 Correct 1104 ms 2080 KB Output is correct
7 Correct 941 ms 2156 KB Output is correct
8 Correct 871 ms 2312 KB Output is correct
9 Correct 1296 ms 2456 KB Output is correct
10 Correct 1018 ms 2652 KB Output is correct
11 Correct 884 ms 2144 KB Output is correct
12 Correct 840 ms 2140 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 7624 KB Output is correct
2 Correct 39 ms 5304 KB Output is correct
3 Correct 42 ms 3256 KB Output is correct
4 Correct 40 ms 3404 KB Output is correct
5 Correct 71 ms 7780 KB Output is correct
6 Correct 81 ms 7836 KB Output is correct
7 Correct 68 ms 7796 KB Output is correct
8 Correct 69 ms 6308 KB Output is correct
9 Correct 63 ms 6280 KB Output is correct
10 Correct 61 ms 6260 KB Output is correct
11 Correct 83 ms 7264 KB Output is correct
12 Correct 71 ms 7420 KB Output is correct
13 Correct 91 ms 7364 KB Output is correct
14 Correct 71 ms 7748 KB Output is correct
15 Correct 70 ms 7800 KB Output is correct
16 Correct 83 ms 7720 KB Output is correct
17 Correct 97 ms 7744 KB Output is correct
18 Correct 102 ms 7720 KB Output is correct
19 Correct 86 ms 7728 KB Output is correct
20 Correct 86 ms 7424 KB Output is correct
21 Correct 79 ms 7476 KB Output is correct
22 Correct 101 ms 7620 KB Output is correct
23 Correct 64 ms 7228 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1336 ms 2776 KB Output is correct
2 Correct 1240 ms 3184 KB Output is correct
3 Correct 1291 ms 3088 KB Output is correct
4 Correct 1278 ms 3116 KB Output is correct
5 Correct 1309 ms 3116 KB Output is correct
6 Correct 1730 ms 3216 KB Output is correct
7 Correct 1717 ms 3044 KB Output is correct
8 Correct 1720 ms 3160 KB Output is correct
9 Correct 44 ms 5308 KB Output is correct
10 Correct 1083 ms 2940 KB Output is correct
11 Correct 1087 ms 3028 KB Output is correct
12 Correct 2076 ms 3300 KB Output is correct
13 Correct 1346 ms 2876 KB Output is correct
14 Correct 1025 ms 2260 KB Output is correct
15 Correct 704 ms 1388 KB Output is correct
16 Correct 1164 ms 2284 KB Output is correct
17 Correct 959 ms 2368 KB Output is correct
18 Correct 41 ms 5272 KB Output is correct
19 Correct 1104 ms 2080 KB Output is correct
20 Correct 941 ms 2156 KB Output is correct
21 Correct 871 ms 2312 KB Output is correct
22 Correct 1296 ms 2456 KB Output is correct
23 Correct 1018 ms 2652 KB Output is correct
24 Correct 884 ms 2144 KB Output is correct
25 Correct 840 ms 2140 KB Output is correct
26 Correct 1318 ms 3324 KB Output is correct
27 Correct 1569 ms 2940 KB Output is correct
28 Correct 1404 ms 3168 KB Output is correct
29 Correct 1067 ms 3116 KB Output is correct
30 Correct 1540 ms 3016 KB Output is correct
31 Correct 1563 ms 3056 KB Output is correct
32 Correct 1570 ms 2896 KB Output is correct
33 Correct 1371 ms 3068 KB Output is correct
34 Correct 1410 ms 3032 KB Output is correct
35 Correct 1392 ms 3088 KB Output is correct
36 Correct 1132 ms 3116 KB Output is correct
37 Correct 1098 ms 3248 KB Output is correct
38 Correct 1070 ms 3188 KB Output is correct
39 Correct 861 ms 3256 KB Output is correct
40 Correct 828 ms 3240 KB Output is correct
41 Correct 815 ms 3296 KB Output is correct
42 Correct 1277 ms 2940 KB Output is correct
43 Correct 1287 ms 2964 KB Output is correct
44 Correct 1305 ms 2960 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 33 ms 540 KB Output is correct
4 Correct 5 ms 984 KB Output is correct
5 Correct 14 ms 468 KB Output is correct
6 Correct 12 ms 568 KB Output is correct
7 Correct 13 ms 528 KB Output is correct
8 Correct 16 ms 560 KB Output is correct
9 Correct 14 ms 524 KB Output is correct
10 Correct 14 ms 480 KB Output is correct
11 Correct 15 ms 588 KB Output is correct
12 Correct 16 ms 560 KB Output is correct
13 Correct 19 ms 592 KB Output is correct
14 Correct 19 ms 596 KB Output is correct
15 Correct 16 ms 596 KB Output is correct
16 Correct 15 ms 468 KB Output is correct
17 Correct 16 ms 480 KB Output is correct
18 Correct 1336 ms 2776 KB Output is correct
19 Correct 1240 ms 3184 KB Output is correct
20 Correct 1291 ms 3088 KB Output is correct
21 Correct 1278 ms 3116 KB Output is correct
22 Correct 1309 ms 3116 KB Output is correct
23 Correct 1730 ms 3216 KB Output is correct
24 Correct 1717 ms 3044 KB Output is correct
25 Correct 1720 ms 3160 KB Output is correct
26 Correct 44 ms 5308 KB Output is correct
27 Correct 1083 ms 2940 KB Output is correct
28 Correct 1087 ms 3028 KB Output is correct
29 Correct 2076 ms 3300 KB Output is correct
30 Correct 1346 ms 2876 KB Output is correct
31 Correct 1025 ms 2260 KB Output is correct
32 Correct 704 ms 1388 KB Output is correct
33 Correct 1164 ms 2284 KB Output is correct
34 Correct 959 ms 2368 KB Output is correct
35 Correct 41 ms 5272 KB Output is correct
36 Correct 1104 ms 2080 KB Output is correct
37 Correct 941 ms 2156 KB Output is correct
38 Correct 871 ms 2312 KB Output is correct
39 Correct 1296 ms 2456 KB Output is correct
40 Correct 1018 ms 2652 KB Output is correct
41 Correct 884 ms 2144 KB Output is correct
42 Correct 840 ms 2140 KB Output is correct
43 Correct 87 ms 7624 KB Output is correct
44 Correct 39 ms 5304 KB Output is correct
45 Correct 42 ms 3256 KB Output is correct
46 Correct 40 ms 3404 KB Output is correct
47 Correct 71 ms 7780 KB Output is correct
48 Correct 81 ms 7836 KB Output is correct
49 Correct 68 ms 7796 KB Output is correct
50 Correct 69 ms 6308 KB Output is correct
51 Correct 63 ms 6280 KB Output is correct
52 Correct 61 ms 6260 KB Output is correct
53 Correct 83 ms 7264 KB Output is correct
54 Correct 71 ms 7420 KB Output is correct
55 Correct 91 ms 7364 KB Output is correct
56 Correct 71 ms 7748 KB Output is correct
57 Correct 70 ms 7800 KB Output is correct
58 Correct 83 ms 7720 KB Output is correct
59 Correct 97 ms 7744 KB Output is correct
60 Correct 102 ms 7720 KB Output is correct
61 Correct 86 ms 7728 KB Output is correct
62 Correct 86 ms 7424 KB Output is correct
63 Correct 79 ms 7476 KB Output is correct
64 Correct 101 ms 7620 KB Output is correct
65 Correct 64 ms 7228 KB Output is correct
66 Correct 1318 ms 3324 KB Output is correct
67 Correct 1569 ms 2940 KB Output is correct
68 Correct 1404 ms 3168 KB Output is correct
69 Correct 1067 ms 3116 KB Output is correct
70 Correct 1540 ms 3016 KB Output is correct
71 Correct 1563 ms 3056 KB Output is correct
72 Correct 1570 ms 2896 KB Output is correct
73 Correct 1371 ms 3068 KB Output is correct
74 Correct 1410 ms 3032 KB Output is correct
75 Correct 1392 ms 3088 KB Output is correct
76 Correct 1132 ms 3116 KB Output is correct
77 Correct 1098 ms 3248 KB Output is correct
78 Correct 1070 ms 3188 KB Output is correct
79 Correct 861 ms 3256 KB Output is correct
80 Correct 828 ms 3240 KB Output is correct
81 Correct 815 ms 3296 KB Output is correct
82 Correct 1277 ms 2940 KB Output is correct
83 Correct 1287 ms 2964 KB Output is correct
84 Correct 1305 ms 2960 KB Output is correct
85 Correct 1971 ms 4596 KB Output is correct
86 Correct 182 ms 3924 KB Output is correct
87 Correct 129 ms 3744 KB Output is correct
88 Correct 1593 ms 4356 KB Output is correct
89 Correct 1952 ms 4428 KB Output is correct
90 Correct 1659 ms 4424 KB Output is correct
91 Correct 1393 ms 2932 KB Output is correct
92 Correct 1404 ms 3132 KB Output is correct
93 Correct 1932 ms 2956 KB Output is correct
94 Correct 1648 ms 4124 KB Output is correct
95 Correct 1787 ms 4280 KB Output is correct
96 Correct 1827 ms 3840 KB Output is correct
97 Correct 1000 ms 4712 KB Output is correct
98 Correct 2252 ms 4216 KB Output is correct
99 Correct 2016 ms 4760 KB Output is correct
100 Correct 1950 ms 4460 KB Output is correct
101 Correct 2017 ms 4464 KB Output is correct
102 Correct 2015 ms 4044 KB Output is correct
103 Correct 1952 ms 3868 KB Output is correct
104 Correct 1939 ms 3876 KB Output is correct
105 Correct 2315 ms 3716 KB Output is correct
106 Correct 2119 ms 3348 KB Output is correct
107 Correct 1555 ms 4056 KB Output is correct
108 Correct 1910 ms 3964 KB Output is correct
109 Correct 1699 ms 3680 KB Output is correct