oj.uz

Submission #689548

# Submission time Handle Problem Language Result Execution time Memory
689548 2023-01-28T17:36:28 Z NothingXD Bridges (APIO19_bridges) C++17
100 / 100
 1944 ms 12356 KB 
/*

   Wei Wai Wei Wai
   Zumigat nan damu dimi kwayt rayt

*/

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
/*typedef __uint128_t L;
struct FastMod {
	ull b, m;
	FastMod(ull b) : b(b), m(ull((L(1) << 64) / b)) {}
	ull reduce(ull a) {
		ull q = (ull)((L(m) * a) >> 64);
		ull r = a - q * b; // can be proven that 0 <= r < 2*b
		return r >= b ? r - b : r;
	}
};
FastMod FM(2);*/
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	cerr << " " << H;
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)
#define F first
#define S second

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 5e4 + 10;
const int maxm = 1e5 + 10;
const int sq = 320;

int n, m, q, dsu[maxn], edge[maxm][3], fw[maxm], idx[maxm], w[maxm], ans[maxm];
vector<int> Q[sq][2];
vector<int> g[maxn];
vector<int> E[2];
bool mark[maxm], vis[maxn];

int getdsu(int v){
	return (dsu[v] < 0? v: dsu[v] = getdsu(dsu[v]));
}

void merge(int u, int v){
	if ((u = getdsu(u)) == (v = getdsu(v))) return;
	if (dsu[u] > dsu[v]) swap(u, v);
	dsu[u] += dsu[v];
	dsu[v] = u;
}

vector<int> merge(vector<int> a, vector<int> b){
	int pta = 0, ptb = 0;
	vector<int> res;
	while(pta < a.size() || ptb < b.size()){
		if (ptb == b.size() || (pta < a.size() && edge[a[pta]][2] > edge[b[ptb]][2])){
			res.push_back(a[pta]);
			pta++;
		}
		else{
			res.push_back(b[ptb]);
			ptb++;
		}
	}
	return res;
}

bool cmp(int x, int y){
	return edge[x][2] > edge[y][2];
}

bool cmp2(int x, int y){
	return w[x] > w[y];
}

int dfs(int v){
	vis[v] = true;
	int res = -dsu[v];
	for (auto u: g[v]) if (!vis[u]) res += dfs(u);
	return res;
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);

	memset(ans, -1, sizeof ans);

	cin >> n >> m;
	for (int i = 1; i <= m; i++){
		cin >> edge[i][0] >> edge[i][1] >> edge[i][2];
		E[0].push_back(i);
	}

	sort(all(E[0]), cmp);

	cin >> q;

	for (int i = 1; i <= q; i++){
		int t; cin >> t >> idx[i] >> w[i];
		Q[i/sq][t-1].push_back(i);
	}

	for (int i = 0; i * sq <= q; i++){
		memset(dsu, -1, sizeof dsu);
		vector<int> tmp[3];
		for (auto x: Q[i][0]){
			 mark[idx[x]] = true;
		}
		for (auto x: E[0]){
			if (mark[x]) tmp[2].push_back(x);
			else tmp[0].push_back(x);
		}
		for (auto x: E[1]){
			if (mark[x]) tmp[2].push_back(x);
			else tmp[1].push_back(x);
		}
		E[0] = merge(tmp[0], tmp[1]);
		E[1] = tmp[2];

		sort(all(Q[i][1]), cmp2);


		int ptr = 0;
		for (auto x: Q[i][1]){
			for (auto y: E[1]){
				fw[y] = edge[y][2];
			}
			while(ptr < E[0].size() && edge[E[0][ptr]][2] >= w[x]){
				merge(edge[E[0][ptr]][0], edge[E[0][ptr]][1]);
				ptr++;
			}
			for (auto y: Q[i][0]){
				if (y > x) break;
				fw[idx[y]] = w[y];
			}
			for (auto y: E[1]){
				if (fw[y] >= w[x]){
					int u = getdsu(edge[y][0]);
					int v = getdsu(edge[y][1]);
					g[u].push_back(v);
					g[v].push_back(u);
				}
			}
			ans[x] = dfs(getdsu(idx[x]));
			vis[getdsu(idx[x])] = false;
			for (auto y: E[1]){
				int u = getdsu(edge[y][0]);
				int v = getdsu(edge[y][1]);
				g[u].clear();
				g[u].shrink_to_fit();
				g[v].clear();
				g[v].shrink_to_fit();
				vis[u] = vis[v] = false;
			}
		}
		for (auto x: Q[i][0]){
			edge[idx[x]][2] = w[x];
			mark[idx[x]] = false;
		}
		sort(all(E[1]), cmp);
	}

	for (int i = 1; i <= q; i++) if (ans[i] != -1) cout << ans[i] << '\n';
	return 0;
}

Compilation message

bridges.cpp: In function 'std::vector<int> merge(std::vector<int>, std::vector<int>)':
bridges.cpp:68:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |  while(pta < a.size() || ptb < b.size()){
      |        ~~~~^~~~~~~~~~
bridges.cpp:68:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |  while(pta < a.size() || ptb < b.size()){
      |                          ~~~~^~~~~~~~~~
bridges.cpp:69:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   if (ptb == b.size() || (pta < a.size() && edge[a[pta]][2] > edge[b[ptb]][2])){
      |       ~~~~^~~~~~~~~~~
bridges.cpp:69:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   if (ptb == b.size() || (pta < a.size() && edge[a[pta]][2] > edge[b[ptb]][2])){
      |                           ~~~~^~~~~~~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:141:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |    while(ptr < E[0].size() && edge[E[0][ptr]][2] >= w[x]){
      |          ~~~~^~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2004 KB Output is correct
2 Correct 1 ms 2004 KB Output is correct
3 Correct 30 ms 2296 KB Output is correct
4 Correct 5 ms 2260 KB Output is correct
5 Correct 23 ms 2260 KB Output is correct
6 Correct 18 ms 2276 KB Output is correct
7 Correct 30 ms 2260 KB Output is correct
8 Correct 29 ms 2260 KB Output is correct
9 Correct 43 ms 2268 KB Output is correct
10 Correct 30 ms 2280 KB Output is correct
11 Correct 32 ms 2388 KB Output is correct
12 Correct 33 ms 2280 KB Output is correct
13 Correct 36 ms 2280 KB Output is correct
14 Correct 35 ms 2276 KB Output is correct
15 Correct 32 ms 2260 KB Output is correct
16 Correct 34 ms 2268 KB Output is correct
17 Correct 39 ms 2276 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1327 ms 5816 KB Output is correct
2 Correct 1289 ms 8792 KB Output is correct
3 Correct 1294 ms 8552 KB Output is correct
4 Correct 1281 ms 8508 KB Output is correct
5 Correct 1282 ms 8564 KB Output is correct
6 Correct 1748 ms 8524 KB Output is correct
7 Correct 1659 ms 8572 KB Output is correct
8 Correct 1707 ms 8468 KB Output is correct
9 Correct 35 ms 4952 KB Output is correct
10 Correct 1357 ms 7384 KB Output is correct
11 Correct 1294 ms 7384 KB Output is correct
12 Correct 936 ms 8940 KB Output is correct
13 Correct 994 ms 8776 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1070 ms 5076 KB Output is correct
2 Correct 756 ms 5548 KB Output is correct
3 Correct 1080 ms 7184 KB Output is correct
4 Correct 1000 ms 7364 KB Output is correct
5 Correct 34 ms 4984 KB Output is correct
6 Correct 1116 ms 7392 KB Output is correct
7 Correct 945 ms 7232 KB Output is correct
8 Correct 861 ms 7352 KB Output is correct
9 Correct 610 ms 7508 KB Output is correct
10 Correct 581 ms 7428 KB Output is correct
11 Correct 655 ms 7256 KB Output is correct
12 Correct 587 ms 7288 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1240 ms 7324 KB Output is correct
2 Correct 43 ms 3624 KB Output is correct
3 Correct 118 ms 5548 KB Output is correct
4 Correct 82 ms 5536 KB Output is correct
5 Correct 982 ms 7252 KB Output is correct
6 Correct 1231 ms 7252 KB Output is correct
7 Correct 964 ms 7252 KB Output is correct
8 Correct 657 ms 5348 KB Output is correct
9 Correct 626 ms 5344 KB Output is correct
10 Correct 650 ms 5548 KB Output is correct
11 Correct 1129 ms 6488 KB Output is correct
12 Correct 1091 ms 6484 KB Output is correct
13 Correct 1156 ms 6616 KB Output is correct
14 Correct 893 ms 7384 KB Output is correct
15 Correct 954 ms 7436 KB Output is correct
16 Correct 1428 ms 7236 KB Output is correct
17 Correct 1447 ms 7232 KB Output is correct
18 Correct 1353 ms 7244 KB Output is correct
19 Correct 1402 ms 7232 KB Output is correct
20 Correct 1288 ms 6932 KB Output is correct
21 Correct 1293 ms 6932 KB Output is correct
22 Correct 1326 ms 7276 KB Output is correct
23 Correct 1085 ms 6860 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1327 ms 5816 KB Output is correct
2 Correct 1289 ms 8792 KB Output is correct
3 Correct 1294 ms 8552 KB Output is correct
4 Correct 1281 ms 8508 KB Output is correct
5 Correct 1282 ms 8564 KB Output is correct
6 Correct 1748 ms 8524 KB Output is correct
7 Correct 1659 ms 8572 KB Output is correct
8 Correct 1707 ms 8468 KB Output is correct
9 Correct 35 ms 4952 KB Output is correct
10 Correct 1357 ms 7384 KB Output is correct
11 Correct 1294 ms 7384 KB Output is correct
12 Correct 936 ms 8940 KB Output is correct
13 Correct 994 ms 8776 KB Output is correct
14 Correct 1070 ms 5076 KB Output is correct
15 Correct 756 ms 5548 KB Output is correct
16 Correct 1080 ms 7184 KB Output is correct
17 Correct 1000 ms 7364 KB Output is correct
18 Correct 34 ms 4984 KB Output is correct
19 Correct 1116 ms 7392 KB Output is correct
20 Correct 945 ms 7232 KB Output is correct
21 Correct 861 ms 7352 KB Output is correct
22 Correct 610 ms 7508 KB Output is correct
23 Correct 581 ms 7428 KB Output is correct
24 Correct 655 ms 7256 KB Output is correct
25 Correct 587 ms 7288 KB Output is correct
26 Correct 1289 ms 8640 KB Output is correct
27 Correct 1459 ms 8404 KB Output is correct
28 Correct 1383 ms 8664 KB Output is correct
29 Correct 1034 ms 8408 KB Output is correct
30 Correct 1516 ms 8644 KB Output is correct
31 Correct 1503 ms 8340 KB Output is correct
32 Correct 1593 ms 8496 KB Output is correct
33 Correct 1409 ms 8592 KB Output is correct
34 Correct 1395 ms 8568 KB Output is correct
35 Correct 1418 ms 8592 KB Output is correct
36 Correct 1085 ms 8560 KB Output is correct
37 Correct 1093 ms 8444 KB Output is correct
38 Correct 1083 ms 8500 KB Output is correct
39 Correct 791 ms 8772 KB Output is correct
40 Correct 796 ms 8608 KB Output is correct
41 Correct 802 ms 8584 KB Output is correct
42 Correct 781 ms 8716 KB Output is correct
43 Correct 800 ms 8692 KB Output is correct
44 Correct 772 ms 8656 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2004 KB Output is correct
2 Correct 1 ms 2004 KB Output is correct
3 Correct 30 ms 2296 KB Output is correct
4 Correct 5 ms 2260 KB Output is correct
5 Correct 23 ms 2260 KB Output is correct
6 Correct 18 ms 2276 KB Output is correct
7 Correct 30 ms 2260 KB Output is correct
8 Correct 29 ms 2260 KB Output is correct
9 Correct 43 ms 2268 KB Output is correct
10 Correct 30 ms 2280 KB Output is correct
11 Correct 32 ms 2388 KB Output is correct
12 Correct 33 ms 2280 KB Output is correct
13 Correct 36 ms 2280 KB Output is correct
14 Correct 35 ms 2276 KB Output is correct
15 Correct 32 ms 2260 KB Output is correct
16 Correct 34 ms 2268 KB Output is correct
17 Correct 39 ms 2276 KB Output is correct
18 Correct 1327 ms 5816 KB Output is correct
19 Correct 1289 ms 8792 KB Output is correct
20 Correct 1294 ms 8552 KB Output is correct
21 Correct 1281 ms 8508 KB Output is correct
22 Correct 1282 ms 8564 KB Output is correct
23 Correct 1748 ms 8524 KB Output is correct
24 Correct 1659 ms 8572 KB Output is correct
25 Correct 1707 ms 8468 KB Output is correct
26 Correct 35 ms 4952 KB Output is correct
27 Correct 1357 ms 7384 KB Output is correct
28 Correct 1294 ms 7384 KB Output is correct
29 Correct 936 ms 8940 KB Output is correct
30 Correct 994 ms 8776 KB Output is correct
31 Correct 1070 ms 5076 KB Output is correct
32 Correct 756 ms 5548 KB Output is correct
33 Correct 1080 ms 7184 KB Output is correct
34 Correct 1000 ms 7364 KB Output is correct
35 Correct 34 ms 4984 KB Output is correct
36 Correct 1116 ms 7392 KB Output is correct
37 Correct 945 ms 7232 KB Output is correct
38 Correct 861 ms 7352 KB Output is correct
39 Correct 610 ms 7508 KB Output is correct
40 Correct 581 ms 7428 KB Output is correct
41 Correct 655 ms 7256 KB Output is correct
42 Correct 587 ms 7288 KB Output is correct
43 Correct 1240 ms 7324 KB Output is correct
44 Correct 43 ms 3624 KB Output is correct
45 Correct 118 ms 5548 KB Output is correct
46 Correct 82 ms 5536 KB Output is correct
47 Correct 982 ms 7252 KB Output is correct
48 Correct 1231 ms 7252 KB Output is correct
49 Correct 964 ms 7252 KB Output is correct
50 Correct 657 ms 5348 KB Output is correct
51 Correct 626 ms 5344 KB Output is correct
52 Correct 650 ms 5548 KB Output is correct
53 Correct 1129 ms 6488 KB Output is correct
54 Correct 1091 ms 6484 KB Output is correct
55 Correct 1156 ms 6616 KB Output is correct
56 Correct 893 ms 7384 KB Output is correct
57 Correct 954 ms 7436 KB Output is correct
58 Correct 1428 ms 7236 KB Output is correct
59 Correct 1447 ms 7232 KB Output is correct
60 Correct 1353 ms 7244 KB Output is correct
61 Correct 1402 ms 7232 KB Output is correct
62 Correct 1288 ms 6932 KB Output is correct
63 Correct 1293 ms 6932 KB Output is correct
64 Correct 1326 ms 7276 KB Output is correct
65 Correct 1085 ms 6860 KB Output is correct
66 Correct 1289 ms 8640 KB Output is correct
67 Correct 1459 ms 8404 KB Output is correct
68 Correct 1383 ms 8664 KB Output is correct
69 Correct 1034 ms 8408 KB Output is correct
70 Correct 1516 ms 8644 KB Output is correct
71 Correct 1503 ms 8340 KB Output is correct
72 Correct 1593 ms 8496 KB Output is correct
73 Correct 1409 ms 8592 KB Output is correct
74 Correct 1395 ms 8568 KB Output is correct
75 Correct 1418 ms 8592 KB Output is correct
76 Correct 1085 ms 8560 KB Output is correct
77 Correct 1093 ms 8444 KB Output is correct
78 Correct 1083 ms 8500 KB Output is correct
79 Correct 791 ms 8772 KB Output is correct
80 Correct 796 ms 8608 KB Output is correct
81 Correct 802 ms 8584 KB Output is correct
82 Correct 781 ms 8716 KB Output is correct
83 Correct 800 ms 8692 KB Output is correct
84 Correct 772 ms 8656 KB Output is correct
85 Correct 1767 ms 12152 KB Output is correct
86 Correct 152 ms 8592 KB Output is correct
87 Correct 120 ms 8852 KB Output is correct
88 Correct 1528 ms 10484 KB Output is correct
89 Correct 1843 ms 12356 KB Output is correct
90 Correct 1539 ms 10476 KB Output is correct
91 Correct 1384 ms 8564 KB Output is correct
92 Correct 1368 ms 8624 KB Output is correct
93 Correct 1750 ms 8548 KB Output is correct
94 Correct 1792 ms 10728 KB Output is correct
95 Correct 1756 ms 10612 KB Output is correct
96 Correct 1796 ms 10264 KB Output is correct
97 Correct 1154 ms 10924 KB Output is correct
98 Correct 1302 ms 10088 KB Output is correct
99 Correct 1889 ms 12020 KB Output is correct
100 Correct 1903 ms 11956 KB Output is correct
101 Correct 1928 ms 12148 KB Output is correct
102 Correct 1944 ms 12100 KB Output is correct
103 Correct 1793 ms 11024 KB Output is correct
104 Correct 1858 ms 10940 KB Output is correct
105 Correct 1514 ms 10744 KB Output is correct
106 Correct 1223 ms 10200 KB Output is correct
107 Correct 1536 ms 11408 KB Output is correct
108 Correct 1878 ms 11600 KB Output is correct
109 Correct 1592 ms 9340 KB Output is correct