oj.uz

Submission #568330

# Submission time Handle Problem Language Result Execution time Memory
568330 2022-05-25T08:37:14 Z 8e7 Bridges (APIO19_bridges) C++17
100 / 100
 2697 ms 8008 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 = 450;

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) {
		return a == par[a] ? a : find(par[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:95: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]
   95 |    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 25 ms 612 KB Output is correct
4 Correct 4 ms 984 KB Output is correct
5 Correct 11 ms 560 KB Output is correct
6 Correct 11 ms 488 KB Output is correct
7 Correct 13 ms 508 KB Output is correct
8 Correct 13 ms 576 KB Output is correct
9 Correct 14 ms 468 KB Output is correct
10 Correct 14 ms 572 KB Output is correct
11 Correct 15 ms 556 KB Output is correct
12 Correct 14 ms 564 KB Output is correct
13 Correct 18 ms 568 KB Output is correct
14 Correct 17 ms 596 KB Output is correct
15 Correct 15 ms 576 KB Output is correct
16 Correct 12 ms 508 KB Output is correct
17 Correct 13 ms 508 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1319 ms 2960 KB Output is correct
2 Correct 1333 ms 3180 KB Output is correct
3 Correct 1319 ms 3200 KB Output is correct
4 Correct 1289 ms 3324 KB Output is correct
5 Correct 1303 ms 3152 KB Output is correct
6 Correct 1643 ms 3272 KB Output is correct
7 Correct 1669 ms 3204 KB Output is correct
8 Correct 1693 ms 3024 KB Output is correct
9 Correct 42 ms 5460 KB Output is correct
10 Correct 1088 ms 3004 KB Output is correct
11 Correct 1118 ms 3220 KB Output is correct
12 Correct 1753 ms 3388 KB Output is correct
13 Correct 1594 ms 3168 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1087 ms 2184 KB Output is correct
2 Correct 668 ms 1596 KB Output is correct
3 Correct 1216 ms 2424 KB Output is correct
4 Correct 1094 ms 2396 KB Output is correct
5 Correct 39 ms 5508 KB Output is correct
6 Correct 1127 ms 2416 KB Output is correct
7 Correct 965 ms 2432 KB Output is correct
8 Correct 877 ms 2372 KB Output is correct
9 Correct 1074 ms 2848 KB Output is correct
10 Correct 847 ms 2764 KB Output is correct
11 Correct 995 ms 2368 KB Output is correct
12 Correct 954 ms 2452 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 7760 KB Output is correct
2 Correct 40 ms 5372 KB Output is correct
3 Correct 57 ms 3728 KB Output is correct
4 Correct 40 ms 3548 KB Output is correct
5 Correct 62 ms 7912 KB Output is correct
6 Correct 87 ms 7976 KB Output is correct
7 Correct 68 ms 7940 KB Output is correct
8 Correct 80 ms 6336 KB Output is correct
9 Correct 67 ms 6388 KB Output is correct
10 Correct 60 ms 6324 KB Output is correct
11 Correct 81 ms 7428 KB Output is correct
12 Correct 83 ms 7520 KB Output is correct
13 Correct 77 ms 7364 KB Output is correct
14 Correct 60 ms 7880 KB Output is correct
15 Correct 62 ms 7960 KB Output is correct
16 Correct 89 ms 7896 KB Output is correct
17 Correct 105 ms 7932 KB Output is correct
18 Correct 105 ms 7724 KB Output is correct
19 Correct 82 ms 7712 KB Output is correct
20 Correct 78 ms 7444 KB Output is correct
21 Correct 88 ms 7428 KB Output is correct
22 Correct 86 ms 7724 KB Output is correct
23 Correct 61 ms 7388 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1319 ms 2960 KB Output is correct
2 Correct 1333 ms 3180 KB Output is correct
3 Correct 1319 ms 3200 KB Output is correct
4 Correct 1289 ms 3324 KB Output is correct
5 Correct 1303 ms 3152 KB Output is correct
6 Correct 1643 ms 3272 KB Output is correct
7 Correct 1669 ms 3204 KB Output is correct
8 Correct 1693 ms 3024 KB Output is correct
9 Correct 42 ms 5460 KB Output is correct
10 Correct 1088 ms 3004 KB Output is correct
11 Correct 1118 ms 3220 KB Output is correct
12 Correct 1753 ms 3388 KB Output is correct
13 Correct 1594 ms 3168 KB Output is correct
14 Correct 1087 ms 2184 KB Output is correct
15 Correct 668 ms 1596 KB Output is correct
16 Correct 1216 ms 2424 KB Output is correct
17 Correct 1094 ms 2396 KB Output is correct
18 Correct 39 ms 5508 KB Output is correct
19 Correct 1127 ms 2416 KB Output is correct
20 Correct 965 ms 2432 KB Output is correct
21 Correct 877 ms 2372 KB Output is correct
22 Correct 1074 ms 2848 KB Output is correct
23 Correct 847 ms 2764 KB Output is correct
24 Correct 995 ms 2368 KB Output is correct
25 Correct 954 ms 2452 KB Output is correct
26 Correct 1378 ms 3328 KB Output is correct
27 Correct 1536 ms 3452 KB Output is correct
28 Correct 1386 ms 3240 KB Output is correct
29 Correct 1186 ms 3336 KB Output is correct
30 Correct 1556 ms 3156 KB Output is correct
31 Correct 1594 ms 3392 KB Output is correct
32 Correct 1551 ms 3428 KB Output is correct
33 Correct 1391 ms 3484 KB Output is correct
34 Correct 1391 ms 3404 KB Output is correct
35 Correct 1411 ms 3652 KB Output is correct
36 Correct 1159 ms 3184 KB Output is correct
37 Correct 1176 ms 3192 KB Output is correct
38 Correct 1196 ms 3296 KB Output is correct
39 Correct 750 ms 3572 KB Output is correct
40 Correct 733 ms 3452 KB Output is correct
41 Correct 684 ms 3436 KB Output is correct
42 Correct 1466 ms 3124 KB Output is correct
43 Correct 1478 ms 3084 KB Output is correct
44 Correct 1524 ms 3324 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 25 ms 612 KB Output is correct
4 Correct 4 ms 984 KB Output is correct
5 Correct 11 ms 560 KB Output is correct
6 Correct 11 ms 488 KB Output is correct
7 Correct 13 ms 508 KB Output is correct
8 Correct 13 ms 576 KB Output is correct
9 Correct 14 ms 468 KB Output is correct
10 Correct 14 ms 572 KB Output is correct
11 Correct 15 ms 556 KB Output is correct
12 Correct 14 ms 564 KB Output is correct
13 Correct 18 ms 568 KB Output is correct
14 Correct 17 ms 596 KB Output is correct
15 Correct 15 ms 576 KB Output is correct
16 Correct 12 ms 508 KB Output is correct
17 Correct 13 ms 508 KB Output is correct
18 Correct 1319 ms 2960 KB Output is correct
19 Correct 1333 ms 3180 KB Output is correct
20 Correct 1319 ms 3200 KB Output is correct
21 Correct 1289 ms 3324 KB Output is correct
22 Correct 1303 ms 3152 KB Output is correct
23 Correct 1643 ms 3272 KB Output is correct
24 Correct 1669 ms 3204 KB Output is correct
25 Correct 1693 ms 3024 KB Output is correct
26 Correct 42 ms 5460 KB Output is correct
27 Correct 1088 ms 3004 KB Output is correct
28 Correct 1118 ms 3220 KB Output is correct
29 Correct 1753 ms 3388 KB Output is correct
30 Correct 1594 ms 3168 KB Output is correct
31 Correct 1087 ms 2184 KB Output is correct
32 Correct 668 ms 1596 KB Output is correct
33 Correct 1216 ms 2424 KB Output is correct
34 Correct 1094 ms 2396 KB Output is correct
35 Correct 39 ms 5508 KB Output is correct
36 Correct 1127 ms 2416 KB Output is correct
37 Correct 965 ms 2432 KB Output is correct
38 Correct 877 ms 2372 KB Output is correct
39 Correct 1074 ms 2848 KB Output is correct
40 Correct 847 ms 2764 KB Output is correct
41 Correct 995 ms 2368 KB Output is correct
42 Correct 954 ms 2452 KB Output is correct
43 Correct 85 ms 7760 KB Output is correct
44 Correct 40 ms 5372 KB Output is correct
45 Correct 57 ms 3728 KB Output is correct
46 Correct 40 ms 3548 KB Output is correct
47 Correct 62 ms 7912 KB Output is correct
48 Correct 87 ms 7976 KB Output is correct
49 Correct 68 ms 7940 KB Output is correct
50 Correct 80 ms 6336 KB Output is correct
51 Correct 67 ms 6388 KB Output is correct
52 Correct 60 ms 6324 KB Output is correct
53 Correct 81 ms 7428 KB Output is correct
54 Correct 83 ms 7520 KB Output is correct
55 Correct 77 ms 7364 KB Output is correct
56 Correct 60 ms 7880 KB Output is correct
57 Correct 62 ms 7960 KB Output is correct
58 Correct 89 ms 7896 KB Output is correct
59 Correct 105 ms 7932 KB Output is correct
60 Correct 105 ms 7724 KB Output is correct
61 Correct 82 ms 7712 KB Output is correct
62 Correct 78 ms 7444 KB Output is correct
63 Correct 88 ms 7428 KB Output is correct
64 Correct 86 ms 7724 KB Output is correct
65 Correct 61 ms 7388 KB Output is correct
66 Correct 1378 ms 3328 KB Output is correct
67 Correct 1536 ms 3452 KB Output is correct
68 Correct 1386 ms 3240 KB Output is correct
69 Correct 1186 ms 3336 KB Output is correct
70 Correct 1556 ms 3156 KB Output is correct
71 Correct 1594 ms 3392 KB Output is correct
72 Correct 1551 ms 3428 KB Output is correct
73 Correct 1391 ms 3484 KB Output is correct
74 Correct 1391 ms 3404 KB Output is correct
75 Correct 1411 ms 3652 KB Output is correct
76 Correct 1159 ms 3184 KB Output is correct
77 Correct 1176 ms 3192 KB Output is correct
78 Correct 1196 ms 3296 KB Output is correct
79 Correct 750 ms 3572 KB Output is correct
80 Correct 733 ms 3452 KB Output is correct
81 Correct 684 ms 3436 KB Output is correct
82 Correct 1466 ms 3124 KB Output is correct
83 Correct 1478 ms 3084 KB Output is correct
84 Correct 1524 ms 3324 KB Output is correct
85 Correct 2178 ms 7144 KB Output is correct
86 Correct 197 ms 5420 KB Output is correct
87 Correct 130 ms 5596 KB Output is correct
88 Correct 1761 ms 6440 KB Output is correct
89 Correct 2157 ms 7140 KB Output is correct
90 Correct 1816 ms 6392 KB Output is correct
91 Correct 1449 ms 5212 KB Output is correct
92 Correct 1418 ms 5304 KB Output is correct
93 Correct 1828 ms 5272 KB Output is correct
94 Correct 1818 ms 6764 KB Output is correct
95 Correct 1876 ms 6784 KB Output is correct
96 Correct 1906 ms 6872 KB Output is correct
97 Correct 879 ms 6608 KB Output is correct
98 Correct 2601 ms 6356 KB Output is correct
99 Correct 2158 ms 7116 KB Output is correct
100 Correct 2152 ms 7180 KB Output is correct
101 Correct 2219 ms 7140 KB Output is correct
102 Correct 2135 ms 8008 KB Output is correct
103 Correct 1986 ms 7056 KB Output is correct
104 Correct 2103 ms 6972 KB Output is correct
105 Correct 2697 ms 7040 KB Output is correct
106 Correct 2552 ms 6780 KB Output is correct
107 Correct 1330 ms 7552 KB Output is correct
108 Correct 2102 ms 7668 KB Output is correct
109 Correct 1743 ms 5824 KB Output is correct