oj.uz

Submission #633186

# Submission time Handle Problem Language Result Execution time Memory
633186 2022-08-21T19:46:27 Z vovamr Bridges (APIO19_bridges) C++17
100 / 100
 2488 ms 14284 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }
 
const int N = 5e4 + 10;
int p[N], rnk[N];
inline void build(int n) { for (int i = 0; i < n; ++i) p[i] = i, rnk[i] = 1; }
inline int par(int v) { if (p[v] == v) { return v; } return p[v] = par(p[v]); }
inline bool uni(int a, int b) {
	a = par(a), b = par(b);
	if (a == b) return 0;
	if (rnk[a] > rnk[b]) swap(a, b);
	p[a] = b, rnk[b] += rnk[a]; return 1;
}
 
inline void solve() {
	int n, m;
	cin >> n >> m;
 
	ve<array<int,3>> e(m);
	for (auto &[v, u, w] : e) cin >> v >> u >> w, --v, --u;
 
	int q;
	cin >> q;
	ve<array<int,3>> ar(q);
	for (auto &[t, a, b] : ar) {
		cin >> t >> a >> b;
		--a;
	}

	set<array<int,4>> E; int P = 0;
	for (auto &[v, u, w] : e) E.insert({w, v, u, P++});
 
	ve<int> res(q, -1);
 
	const int b = 400;
 
	ve<int> used(n);
	ve<ve<int>> gr(n);
 
	ve<int> changed(m);
	for (int l = 0; l < q; l += b) {
		int r = min(q - 1, l + b - 1);
 
		for (int i = l; i <= r; ++i) {
			if (ar[i][0] == 1) {
				changed[ar[i][1]] = 1;
			}
		}
 
		ve<array<int,3>> edges;
		edges.reserve(m);
 
 		for (auto &[w, v, u, id] : E) {
			if (changed[id]) continue;
			edges.pb({w, v, u});
		}

		for (int i = l; i <= r; ++i) {
			if (ar[i][0] == 1) {
				changed[ar[i][1]] = 0;
			}
		}
 
		ve<pair<array<int,3>,ve<array<int,3>>>> que;
		que.reserve(r - l + 1);
 
		for (int i = l; i <= r; ++i) {
			if (ar[i][0] == 1) {
				int id = ar[i][1];
				int x = ar[i][2];
				E.erase({e[id][2], e[id][0], e[id][1], id});
				e[id][2] = x;
				E.insert({e[id][2], e[id][0], e[id][1], id});
			}
			else {
				int s = ar[i][1], d = ar[i][2];
 
				que.pb({{-d,s,i}, {}});
				for (int j = l; j <= r; ++j) {
					if (ar[j][0] == 2) continue;
					int id = ar[j][1]; int w = e[id][2];
					if (w >= d) que.back().se.pb({e[id][0], e[id][1], w});
				}
			}
		}
 
		build(n);
		sort(all(que));
		int p = sz(edges) - 1;
 
		for (auto &[_, vec] : que) {
			auto &[d, s, id] = _; d *= -1;
			while (~p && edges[p][0] >= d) {
				auto &[w, v, u] = edges[p];
				uni(v, u);
				--p;
			}

			for (auto &[v, u, w] : vec) {
				gr[par(v)].pb(par(u));
				gr[par(u)].pb(par(v));
			}
 
			int ans = 0;
			function<void(int)> dfs = [&gr,&used,&dfs,&ans](int v) {
				used[v] = 1; ans += rnk[v];
				for (auto &to : gr[v]) {
					if (used[to]) continue;
					dfs(to);
				}
			};
 
			dfs(par(s));
			res[id] = ans;
 
			used[par(s)] = 0;
			for (auto &[v, u, w] : vec) {
				gr[par(u)].clear();
				gr[par(v)].clear();
				used[par(v)] = used[par(u)] = 0;
			}
		}
	}
 
	for (int i = 0; i < q; ++i) if (~res[i]) cout << res[i] << '\n';
}
 
signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 37 ms 1004 KB Output is correct
4 Correct 7 ms 468 KB Output is correct
5 Correct 40 ms 972 KB Output is correct
6 Correct 34 ms 904 KB Output is correct
7 Correct 36 ms 852 KB Output is correct
8 Correct 35 ms 888 KB Output is correct
9 Correct 52 ms 1188 KB Output is correct
10 Correct 33 ms 924 KB Output is correct
11 Correct 35 ms 928 KB Output is correct
12 Correct 40 ms 1000 KB Output is correct
13 Correct 39 ms 952 KB Output is correct
14 Correct 36 ms 928 KB Output is correct
15 Correct 39 ms 936 KB Output is correct
16 Correct 41 ms 1024 KB Output is correct
17 Correct 39 ms 1056 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1181 ms 10108 KB Output is correct
2 Correct 1118 ms 9872 KB Output is correct
3 Correct 1174 ms 10036 KB Output is correct
4 Correct 1158 ms 10040 KB Output is correct
5 Correct 1206 ms 10056 KB Output is correct
6 Correct 1514 ms 9352 KB Output is correct
7 Correct 1489 ms 9348 KB Output is correct
8 Correct 1416 ms 9436 KB Output is correct
9 Correct 58 ms 2048 KB Output is correct
10 Correct 1028 ms 9908 KB Output is correct
11 Correct 1008 ms 10332 KB Output is correct
12 Correct 902 ms 8992 KB Output is correct
13 Correct 965 ms 8992 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 930 ms 7516 KB Output is correct
2 Correct 701 ms 3908 KB Output is correct
3 Correct 1060 ms 7772 KB Output is correct
4 Correct 860 ms 7516 KB Output is correct
5 Correct 61 ms 2032 KB Output is correct
6 Correct 956 ms 7520 KB Output is correct
7 Correct 807 ms 7576 KB Output is correct
8 Correct 750 ms 7416 KB Output is correct
9 Correct 597 ms 6924 KB Output is correct
10 Correct 577 ms 6884 KB Output is correct
11 Correct 650 ms 7428 KB Output is correct
12 Correct 554 ms 7316 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1800 ms 13108 KB Output is correct
2 Correct 57 ms 1996 KB Output is correct
3 Correct 199 ms 9512 KB Output is correct
4 Correct 212 ms 9420 KB Output is correct
5 Correct 1720 ms 13048 KB Output is correct
6 Correct 1734 ms 13132 KB Output is correct
7 Correct 1596 ms 13112 KB Output is correct
8 Correct 675 ms 8292 KB Output is correct
9 Correct 688 ms 8296 KB Output is correct
10 Correct 699 ms 8448 KB Output is correct
11 Correct 1213 ms 10676 KB Output is correct
12 Correct 1153 ms 10728 KB Output is correct
13 Correct 1182 ms 10804 KB Output is correct
14 Correct 1605 ms 13176 KB Output is correct
15 Correct 1787 ms 13172 KB Output is correct
16 Correct 1796 ms 12952 KB Output is correct
17 Correct 1998 ms 12916 KB Output is correct
18 Correct 1748 ms 13004 KB Output is correct
19 Correct 1845 ms 12976 KB Output is correct
20 Correct 1367 ms 11684 KB Output is correct
21 Correct 1530 ms 11680 KB Output is correct
22 Correct 1640 ms 12692 KB Output is correct
23 Correct 1314 ms 11212 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1181 ms 10108 KB Output is correct
2 Correct 1118 ms 9872 KB Output is correct
3 Correct 1174 ms 10036 KB Output is correct
4 Correct 1158 ms 10040 KB Output is correct
5 Correct 1206 ms 10056 KB Output is correct
6 Correct 1514 ms 9352 KB Output is correct
7 Correct 1489 ms 9348 KB Output is correct
8 Correct 1416 ms 9436 KB Output is correct
9 Correct 58 ms 2048 KB Output is correct
10 Correct 1028 ms 9908 KB Output is correct
11 Correct 1008 ms 10332 KB Output is correct
12 Correct 902 ms 8992 KB Output is correct
13 Correct 965 ms 8992 KB Output is correct
14 Correct 930 ms 7516 KB Output is correct
15 Correct 701 ms 3908 KB Output is correct
16 Correct 1060 ms 7772 KB Output is correct
17 Correct 860 ms 7516 KB Output is correct
18 Correct 61 ms 2032 KB Output is correct
19 Correct 956 ms 7520 KB Output is correct
20 Correct 807 ms 7576 KB Output is correct
21 Correct 750 ms 7416 KB Output is correct
22 Correct 597 ms 6924 KB Output is correct
23 Correct 577 ms 6884 KB Output is correct
24 Correct 650 ms 7428 KB Output is correct
25 Correct 554 ms 7316 KB Output is correct
26 Correct 1189 ms 9980 KB Output is correct
27 Correct 1373 ms 10136 KB Output is correct
28 Correct 1172 ms 9960 KB Output is correct
29 Correct 922 ms 9620 KB Output is correct
30 Correct 1390 ms 10020 KB Output is correct
31 Correct 1361 ms 10120 KB Output is correct
32 Correct 1351 ms 10056 KB Output is correct
33 Correct 1205 ms 9856 KB Output is correct
34 Correct 1279 ms 9936 KB Output is correct
35 Correct 1238 ms 9952 KB Output is correct
36 Correct 945 ms 9736 KB Output is correct
37 Correct 1004 ms 9656 KB Output is correct
38 Correct 966 ms 9612 KB Output is correct
39 Correct 797 ms 9000 KB Output is correct
40 Correct 799 ms 8944 KB Output is correct
41 Correct 817 ms 8936 KB Output is correct
42 Correct 772 ms 9676 KB Output is correct
43 Correct 765 ms 9568 KB Output is correct
44 Correct 786 ms 9752 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 37 ms 1004 KB Output is correct
4 Correct 7 ms 468 KB Output is correct
5 Correct 40 ms 972 KB Output is correct
6 Correct 34 ms 904 KB Output is correct
7 Correct 36 ms 852 KB Output is correct
8 Correct 35 ms 888 KB Output is correct
9 Correct 52 ms 1188 KB Output is correct
10 Correct 33 ms 924 KB Output is correct
11 Correct 35 ms 928 KB Output is correct
12 Correct 40 ms 1000 KB Output is correct
13 Correct 39 ms 952 KB Output is correct
14 Correct 36 ms 928 KB Output is correct
15 Correct 39 ms 936 KB Output is correct
16 Correct 41 ms 1024 KB Output is correct
17 Correct 39 ms 1056 KB Output is correct
18 Correct 1181 ms 10108 KB Output is correct
19 Correct 1118 ms 9872 KB Output is correct
20 Correct 1174 ms 10036 KB Output is correct
21 Correct 1158 ms 10040 KB Output is correct
22 Correct 1206 ms 10056 KB Output is correct
23 Correct 1514 ms 9352 KB Output is correct
24 Correct 1489 ms 9348 KB Output is correct
25 Correct 1416 ms 9436 KB Output is correct
26 Correct 58 ms 2048 KB Output is correct
27 Correct 1028 ms 9908 KB Output is correct
28 Correct 1008 ms 10332 KB Output is correct
29 Correct 902 ms 8992 KB Output is correct
30 Correct 965 ms 8992 KB Output is correct
31 Correct 930 ms 7516 KB Output is correct
32 Correct 701 ms 3908 KB Output is correct
33 Correct 1060 ms 7772 KB Output is correct
34 Correct 860 ms 7516 KB Output is correct
35 Correct 61 ms 2032 KB Output is correct
36 Correct 956 ms 7520 KB Output is correct
37 Correct 807 ms 7576 KB Output is correct
38 Correct 750 ms 7416 KB Output is correct
39 Correct 597 ms 6924 KB Output is correct
40 Correct 577 ms 6884 KB Output is correct
41 Correct 650 ms 7428 KB Output is correct
42 Correct 554 ms 7316 KB Output is correct
43 Correct 1800 ms 13108 KB Output is correct
44 Correct 57 ms 1996 KB Output is correct
45 Correct 199 ms 9512 KB Output is correct
46 Correct 212 ms 9420 KB Output is correct
47 Correct 1720 ms 13048 KB Output is correct
48 Correct 1734 ms 13132 KB Output is correct
49 Correct 1596 ms 13112 KB Output is correct
50 Correct 675 ms 8292 KB Output is correct
51 Correct 688 ms 8296 KB Output is correct
52 Correct 699 ms 8448 KB Output is correct
53 Correct 1213 ms 10676 KB Output is correct
54 Correct 1153 ms 10728 KB Output is correct
55 Correct 1182 ms 10804 KB Output is correct
56 Correct 1605 ms 13176 KB Output is correct
57 Correct 1787 ms 13172 KB Output is correct
58 Correct 1796 ms 12952 KB Output is correct
59 Correct 1998 ms 12916 KB Output is correct
60 Correct 1748 ms 13004 KB Output is correct
61 Correct 1845 ms 12976 KB Output is correct
62 Correct 1367 ms 11684 KB Output is correct
63 Correct 1530 ms 11680 KB Output is correct
64 Correct 1640 ms 12692 KB Output is correct
65 Correct 1314 ms 11212 KB Output is correct
66 Correct 1189 ms 9980 KB Output is correct
67 Correct 1373 ms 10136 KB Output is correct
68 Correct 1172 ms 9960 KB Output is correct
69 Correct 922 ms 9620 KB Output is correct
70 Correct 1390 ms 10020 KB Output is correct
71 Correct 1361 ms 10120 KB Output is correct
72 Correct 1351 ms 10056 KB Output is correct
73 Correct 1205 ms 9856 KB Output is correct
74 Correct 1279 ms 9936 KB Output is correct
75 Correct 1238 ms 9952 KB Output is correct
76 Correct 945 ms 9736 KB Output is correct
77 Correct 1004 ms 9656 KB Output is correct
78 Correct 966 ms 9612 KB Output is correct
79 Correct 797 ms 9000 KB Output is correct
80 Correct 799 ms 8944 KB Output is correct
81 Correct 817 ms 8936 KB Output is correct
82 Correct 772 ms 9676 KB Output is correct
83 Correct 765 ms 9568 KB Output is correct
84 Correct 786 ms 9752 KB Output is correct
85 Correct 2186 ms 14276 KB Output is correct
86 Correct 214 ms 9872 KB Output is correct
87 Correct 265 ms 10256 KB Output is correct
88 Correct 2215 ms 14144 KB Output is correct
89 Correct 2156 ms 14284 KB Output is correct
90 Correct 2148 ms 14076 KB Output is correct
91 Correct 1196 ms 10096 KB Output is correct
92 Correct 1253 ms 10100 KB Output is correct
93 Correct 1477 ms 9488 KB Output is correct
94 Correct 1637 ms 12200 KB Output is correct
95 Correct 1658 ms 12304 KB Output is correct
96 Correct 1804 ms 11476 KB Output is correct
97 Correct 1781 ms 13452 KB Output is correct
98 Correct 1943 ms 13736 KB Output is correct
99 Correct 2243 ms 14200 KB Output is correct
100 Correct 2488 ms 14280 KB Output is correct
101 Correct 2358 ms 14276 KB Output is correct
102 Correct 2288 ms 14188 KB Output is correct
103 Correct 1918 ms 12420 KB Output is correct
104 Correct 1937 ms 12256 KB Output is correct
105 Correct 1648 ms 12016 KB Output is correct
106 Correct 1283 ms 11288 KB Output is correct
107 Correct 1644 ms 11952 KB Output is correct
108 Correct 2147 ms 13204 KB Output is correct
109 Correct 1737 ms 11792 KB Output is correct