oj.uz

Submission #676933

# Submission time Handle Problem Language Result Execution time Memory
676933 2023-01-01T16:27:54 Z Sohsoh84 Bridges (APIO19_bridges) C++17
100 / 100
 2200 ms 12284 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pll;

#define all(x)			(x).begin(),(x).end()
#define X			first
#define Y			second
#define sep			' '
#define endl			'\n'
#define debug(x)		cerr << #x << ": " <<  x << endl;

const int MAXN = 1e5 + 10;
const int SQ = 400;

int U[MAXN], V[MAXN], W[MAXN], par[MAXN], n, m, q, TW[MAXN],
    QT[MAXN], QA[MAXN], QB[MAXN], QANS[MAXN], sz[MAXN];

list<int> adj[MAXN];
vector<int> vis_vec;
vector<pll> events;
bool edge_mark[MAXN], vis[MAXN];

int find(int v) {
	return par[v] == v ? v : par[v] = find(par[v]);
}

inline void unite(int u, int v) {
	u = find(u), v = find(v);
	if (u == v) return;
	if (sz[u] < sz[v]) swap(u, v);

	par[v] = u;
	adj[u].splice(adj[u].end(), adj[v]);
	sz[u] += sz[v];
}

int dfs(int v, int lim) {
	vis[v] = true;
	vis_vec.push_back(v);
	int ans = sz[v];

	for (int ind : adj[v]) {
		int u = find(V[ind]) ^ find(U[ind]) ^ v;
		if (lim <= W[ind] && !vis[u])
			ans += dfs(u, lim);
	}

	return ans;
}

inline void solve(int l, int r) {
	for (int i = 1; i <= n; i++) {
		par[i] = i;
		sz[i] = 1;
		adj[i].clear();
	}

	for (int i = l; i < r; i++) {
		if (QT[i] == 1) {
			edge_mark[QA[i]] = true;
			adj[U[QA[i]]].push_back(QA[i]);
			adj[V[QA[i]]].push_back(QA[i]);
			TW[QA[i]] = W[QA[i]];
		}
	}

	for (auto [b, a] : events) {
		if (a > m && QT[a - m - 1] == 1) a = QA[a - m - 1];
		if (a <= m && (W[a] != b || edge_mark[a])) continue;
		if (a > m && (a - m - 1 < l || a - m - 1 >= r)) continue;	
		
		if (a <= m) unite(U[a], V[a]);
		else {
			a -= m + 1;
			
			for (int i = l; i < a; i++)
				if (QT[i] == 1)
					W[QA[i]] = QB[i];

			QANS[a] = dfs(find(QA[a]), b);	
			for (int e : vis_vec)
				vis[e] = false;
			vis_vec.clear();
		
			for (int i = l; i < a; i++)
				if (QT[i] == 1)
					W[QA[i]] = TW[QA[i]];
		}
	}

	for (int i = l; i < r; i++) {
		if (QT[i] == 1) {
			edge_mark[QA[i]] = false;
			W[QA[i]] = QB[i];
		}
	}
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> U[i] >> V[i] >> W[i];
		events.push_back({W[i], i});
	}

	cin >> q;
	for (int i = 0; i < q; i++) {
		cin >> QT[i] >> QA[i] >> QB[i];
		events.push_back({QB[i], m + i + 1});
	}

	sort(all(events), [] (pll a, pll b) {
		if (a.X == b.X) return a.Y < b.Y;
		return a.X > b.X;
	});

	for (int i = 0; i < q; i += SQ) {
		vector<pair<int, pll>> vec;
		solve(i, min(i + SQ, q));	
	}

	for (int i = 0; i < q; i++)
		if (QT[i] == 2) 
			cout << QANS[i] << endl;
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2644 KB Output is correct
2 Correct 3 ms 2628 KB Output is correct
3 Correct 35 ms 3200 KB Output is correct
4 Correct 14 ms 3100 KB Output is correct
5 Correct 30 ms 3156 KB Output is correct
6 Correct 26 ms 3216 KB Output is correct
7 Correct 19 ms 3164 KB Output is correct
8 Correct 18 ms 3212 KB Output is correct
9 Correct 25 ms 3156 KB Output is correct
10 Correct 15 ms 3208 KB Output is correct
11 Correct 14 ms 3212 KB Output is correct
12 Correct 14 ms 3224 KB Output is correct
13 Correct 20 ms 3156 KB Output is correct
14 Correct 20 ms 3216 KB Output is correct
15 Correct 23 ms 3212 KB Output is correct
16 Correct 20 ms 3152 KB Output is correct
17 Correct 19 ms 3168 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1391 ms 6976 KB Output is correct
2 Correct 1373 ms 7068 KB Output is correct
3 Correct 1347 ms 7076 KB Output is correct
4 Correct 1310 ms 7156 KB Output is correct
5 Correct 1350 ms 7092 KB Output is correct
6 Correct 1554 ms 7236 KB Output is correct
7 Correct 1359 ms 7180 KB Output is correct
8 Correct 1342 ms 7228 KB Output is correct
9 Correct 182 ms 5472 KB Output is correct
10 Correct 1250 ms 7112 KB Output is correct
11 Correct 1045 ms 7280 KB Output is correct
12 Correct 834 ms 7448 KB Output is correct
13 Correct 1105 ms 6972 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 976 ms 6716 KB Output is correct
2 Correct 639 ms 5752 KB Output is correct
3 Correct 1095 ms 6592 KB Output is correct
4 Correct 1056 ms 6536 KB Output is correct
5 Correct 161 ms 5452 KB Output is correct
6 Correct 968 ms 6576 KB Output is correct
7 Correct 976 ms 6584 KB Output is correct
8 Correct 890 ms 6548 KB Output is correct
9 Correct 661 ms 6700 KB Output is correct
10 Correct 681 ms 6756 KB Output is correct
11 Correct 763 ms 6444 KB Output is correct
12 Correct 752 ms 6636 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1302 ms 8036 KB Output is correct
2 Correct 167 ms 5596 KB Output is correct
3 Correct 82 ms 5352 KB Output is correct
4 Correct 52 ms 5192 KB Output is correct
5 Correct 670 ms 8340 KB Output is correct
6 Correct 1274 ms 8260 KB Output is correct
7 Correct 706 ms 8272 KB Output is correct
8 Correct 888 ms 7124 KB Output is correct
9 Correct 864 ms 6988 KB Output is correct
10 Correct 745 ms 7104 KB Output is correct
11 Correct 1270 ms 7688 KB Output is correct
12 Correct 1254 ms 7648 KB Output is correct
13 Correct 1049 ms 7804 KB Output is correct
14 Correct 648 ms 8452 KB Output is correct
15 Correct 686 ms 8320 KB Output is correct
16 Correct 1468 ms 8284 KB Output is correct
17 Correct 1442 ms 8220 KB Output is correct
18 Correct 1435 ms 8200 KB Output is correct
19 Correct 1479 ms 8116 KB Output is correct
20 Correct 1109 ms 8004 KB Output is correct
21 Correct 1098 ms 8000 KB Output is correct
22 Correct 1227 ms 8380 KB Output is correct
23 Correct 817 ms 8044 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1391 ms 6976 KB Output is correct
2 Correct 1373 ms 7068 KB Output is correct
3 Correct 1347 ms 7076 KB Output is correct
4 Correct 1310 ms 7156 KB Output is correct
5 Correct 1350 ms 7092 KB Output is correct
6 Correct 1554 ms 7236 KB Output is correct
7 Correct 1359 ms 7180 KB Output is correct
8 Correct 1342 ms 7228 KB Output is correct
9 Correct 182 ms 5472 KB Output is correct
10 Correct 1250 ms 7112 KB Output is correct
11 Correct 1045 ms 7280 KB Output is correct
12 Correct 834 ms 7448 KB Output is correct
13 Correct 1105 ms 6972 KB Output is correct
14 Correct 976 ms 6716 KB Output is correct
15 Correct 639 ms 5752 KB Output is correct
16 Correct 1095 ms 6592 KB Output is correct
17 Correct 1056 ms 6536 KB Output is correct
18 Correct 161 ms 5452 KB Output is correct
19 Correct 968 ms 6576 KB Output is correct
20 Correct 976 ms 6584 KB Output is correct
21 Correct 890 ms 6548 KB Output is correct
22 Correct 661 ms 6700 KB Output is correct
23 Correct 681 ms 6756 KB Output is correct
24 Correct 763 ms 6444 KB Output is correct
25 Correct 752 ms 6636 KB Output is correct
26 Correct 1269 ms 7052 KB Output is correct
27 Correct 1506 ms 7088 KB Output is correct
28 Correct 1451 ms 7196 KB Output is correct
29 Correct 1214 ms 7056 KB Output is correct
30 Correct 1454 ms 7104 KB Output is correct
31 Correct 1458 ms 7188 KB Output is correct
32 Correct 1445 ms 7224 KB Output is correct
33 Correct 1390 ms 7036 KB Output is correct
34 Correct 1346 ms 7284 KB Output is correct
35 Correct 1347 ms 7108 KB Output is correct
36 Correct 1225 ms 7228 KB Output is correct
37 Correct 1239 ms 7020 KB Output is correct
38 Correct 1247 ms 7144 KB Output is correct
39 Correct 1008 ms 7232 KB Output is correct
40 Correct 984 ms 7064 KB Output is correct
41 Correct 989 ms 7188 KB Output is correct
42 Correct 1198 ms 7048 KB Output is correct
43 Correct 1234 ms 7172 KB Output is correct
44 Correct 1156 ms 7024 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2644 KB Output is correct
2 Correct 3 ms 2628 KB Output is correct
3 Correct 35 ms 3200 KB Output is correct
4 Correct 14 ms 3100 KB Output is correct
5 Correct 30 ms 3156 KB Output is correct
6 Correct 26 ms 3216 KB Output is correct
7 Correct 19 ms 3164 KB Output is correct
8 Correct 18 ms 3212 KB Output is correct
9 Correct 25 ms 3156 KB Output is correct
10 Correct 15 ms 3208 KB Output is correct
11 Correct 14 ms 3212 KB Output is correct
12 Correct 14 ms 3224 KB Output is correct
13 Correct 20 ms 3156 KB Output is correct
14 Correct 20 ms 3216 KB Output is correct
15 Correct 23 ms 3212 KB Output is correct
16 Correct 20 ms 3152 KB Output is correct
17 Correct 19 ms 3168 KB Output is correct
18 Correct 1391 ms 6976 KB Output is correct
19 Correct 1373 ms 7068 KB Output is correct
20 Correct 1347 ms 7076 KB Output is correct
21 Correct 1310 ms 7156 KB Output is correct
22 Correct 1350 ms 7092 KB Output is correct
23 Correct 1554 ms 7236 KB Output is correct
24 Correct 1359 ms 7180 KB Output is correct
25 Correct 1342 ms 7228 KB Output is correct
26 Correct 182 ms 5472 KB Output is correct
27 Correct 1250 ms 7112 KB Output is correct
28 Correct 1045 ms 7280 KB Output is correct
29 Correct 834 ms 7448 KB Output is correct
30 Correct 1105 ms 6972 KB Output is correct
31 Correct 976 ms 6716 KB Output is correct
32 Correct 639 ms 5752 KB Output is correct
33 Correct 1095 ms 6592 KB Output is correct
34 Correct 1056 ms 6536 KB Output is correct
35 Correct 161 ms 5452 KB Output is correct
36 Correct 968 ms 6576 KB Output is correct
37 Correct 976 ms 6584 KB Output is correct
38 Correct 890 ms 6548 KB Output is correct
39 Correct 661 ms 6700 KB Output is correct
40 Correct 681 ms 6756 KB Output is correct
41 Correct 763 ms 6444 KB Output is correct
42 Correct 752 ms 6636 KB Output is correct
43 Correct 1302 ms 8036 KB Output is correct
44 Correct 167 ms 5596 KB Output is correct
45 Correct 82 ms 5352 KB Output is correct
46 Correct 52 ms 5192 KB Output is correct
47 Correct 670 ms 8340 KB Output is correct
48 Correct 1274 ms 8260 KB Output is correct
49 Correct 706 ms 8272 KB Output is correct
50 Correct 888 ms 7124 KB Output is correct
51 Correct 864 ms 6988 KB Output is correct
52 Correct 745 ms 7104 KB Output is correct
53 Correct 1270 ms 7688 KB Output is correct
54 Correct 1254 ms 7648 KB Output is correct
55 Correct 1049 ms 7804 KB Output is correct
56 Correct 648 ms 8452 KB Output is correct
57 Correct 686 ms 8320 KB Output is correct
58 Correct 1468 ms 8284 KB Output is correct
59 Correct 1442 ms 8220 KB Output is correct
60 Correct 1435 ms 8200 KB Output is correct
61 Correct 1479 ms 8116 KB Output is correct
62 Correct 1109 ms 8004 KB Output is correct
63 Correct 1098 ms 8000 KB Output is correct
64 Correct 1227 ms 8380 KB Output is correct
65 Correct 817 ms 8044 KB Output is correct
66 Correct 1269 ms 7052 KB Output is correct
67 Correct 1506 ms 7088 KB Output is correct
68 Correct 1451 ms 7196 KB Output is correct
69 Correct 1214 ms 7056 KB Output is correct
70 Correct 1454 ms 7104 KB Output is correct
71 Correct 1458 ms 7188 KB Output is correct
72 Correct 1445 ms 7224 KB Output is correct
73 Correct 1390 ms 7036 KB Output is correct
74 Correct 1346 ms 7284 KB Output is correct
75 Correct 1347 ms 7108 KB Output is correct
76 Correct 1225 ms 7228 KB Output is correct
77 Correct 1239 ms 7020 KB Output is correct
78 Correct 1247 ms 7144 KB Output is correct
79 Correct 1008 ms 7232 KB Output is correct
80 Correct 984 ms 7064 KB Output is correct
81 Correct 989 ms 7188 KB Output is correct
82 Correct 1198 ms 7048 KB Output is correct
83 Correct 1234 ms 7172 KB Output is correct
84 Correct 1156 ms 7024 KB Output is correct
85 Correct 2111 ms 8580 KB Output is correct
86 Correct 131 ms 7368 KB Output is correct
87 Correct 94 ms 7468 KB Output is correct
88 Correct 1365 ms 10756 KB Output is correct
89 Correct 2135 ms 12104 KB Output is correct
90 Correct 1332 ms 10304 KB Output is correct
91 Correct 1342 ms 9868 KB Output is correct
92 Correct 1332 ms 9788 KB Output is correct
93 Correct 1112 ms 9688 KB Output is correct
94 Correct 1785 ms 10712 KB Output is correct
95 Correct 1760 ms 11100 KB Output is correct
96 Correct 1521 ms 10656 KB Output is correct
97 Correct 870 ms 10548 KB Output is correct
98 Correct 1199 ms 10212 KB Output is correct
99 Correct 2200 ms 12136 KB Output is correct
100 Correct 2158 ms 11968 KB Output is correct
101 Correct 2189 ms 12284 KB Output is correct
102 Correct 2171 ms 12036 KB Output is correct
103 Correct 1657 ms 11132 KB Output is correct
104 Correct 1667 ms 11020 KB Output is correct
105 Correct 1737 ms 10848 KB Output is correct
106 Correct 1629 ms 10644 KB Output is correct
107 Correct 1282 ms 11232 KB Output is correct
108 Correct 2044 ms 11560 KB Output is correct
109 Correct 1461 ms 9780 KB Output is correct