oj.uz

Submission #253542

# Submission time Handle Problem Language Result Execution time Memory
253542 2020-07-28T07:47:22 Z DystoriaX Bridges (APIO19_bridges) C++14
100 / 100
 2480 ms 6508 KB 
#include <bits/stdc++.h>
 
#define fi first
#define se second
 
using namespace std;
 
typedef pair<int, int> pii;
 
struct Node{
	int u, sz_u, v, sz_v;
};
 
struct Query{
	int type, a, b, idx;
};
 
const int sq = 850;
 
int n, m, q;
 
int p[50010], sz[50010];
Node st[100010];
int cz;
 
pii edges[100010];
vector<int> eg;
 
int w[100010];
 
Query qry[100010];
int ans[100010];
 
void init(){
	iota(p, p + n + 1, 0);
	fill(sz, sz + n + 1, 1);
	cz = 0;
}
 
int findR(int x){
	return p[x] == x ? x : findR(p[x]);
}
 
void join(int a, int b){
	a = findR(a), b = findR(b);
 
	st[cz++] = Node({a, sz[a], b, sz[b]});
 
	if(a == b) return;
 
	if(sz[a] > sz[b]) swap(a, b);
 
	p[a] = b;
	sz[b] += sz[a];
}
 
void rollback(){
	Node x = st[--cz];
 
	p[x.u] = x.u;
	p[x.v] = x.v;
 
	sz[x.u] = x.sz_u;
	sz[x.v] = x.sz_v;
}
 
bool cmp(Query a, Query b){
	return a.b > b.b;
}
 
bool egCmp(int a, int b){
	return w[a] > w[b];
}
 
bitset<100010> dead, vis;
 
void Process(int l, int r){
	vector<Query> updates, queries;
 
	for(int i = l; i <= r; i++){
		if(qry[i].type == 1) updates.emplace_back(qry[i]);
		else queries.emplace_back(qry[i]);
	}
 
	sort(queries.begin(), queries.end(), cmp);
	sort(eg.begin(), eg.end(), egCmp);
 
	//We process from rightmost to leftmost, getting the most updated weight of edge
	reverse(updates.begin(), updates.end());
 
	for(auto &k : updates) dead[k.a] = true;
 
	int id = 0;
 
	init();
	for(auto &k : queries){
		while(id < m && w[eg[id]] >= k.b){
			if(!dead[eg[id]]) join(edges[eg[id]].fi, edges[eg[id]].se);
			id++;
		}
 
		int cur_size = cz;
 
		for(auto &ed : updates){
			if(ed.idx < k.idx){
				if(vis[ed.a]) continue;
 
				vis[ed.a] = true;
 
				if(ed.b >= k.b) join(edges[ed.a].fi, edges[ed.a].se);
			}
		}
 
		for(auto &ed : updates){
			if(ed.idx < k.idx) break;
			if(!vis[ed.a] && w[ed.a] >= k.b) join(edges[ed.a].fi, edges[ed.a].se);
		}
 
		ans[k.idx] = sz[findR(k.a)];
 
		for(auto &ed : updates){
			vis[ed.a] = false;
		}
 
		while(cz > cur_size) rollback();
	}
 
	for(auto &k : updates){
		if(!dead[k.a]) continue;
		dead[k.a] = false;
		w[k.a] = k.b;
	}
}
 
int main(){
	// cerr << sq << "\n";
	scanf("%d%d", &n, &m);
 
	for(int i = 1; i <= m; i++){
		scanf("%d%d%d", &edges[i].fi, &edges[i].se, &w[i]);
	}
 
	scanf("%d", &q);
 
	for(int i = 1; i <= q; i++){
		scanf("%d%d%d", &qry[i].type, &qry[i].a, &qry[i].b);
		qry[i].idx = i;
	}
 
	memset(ans, -1, sizeof(ans));
 
	eg.resize(m);
	iota(eg.begin(), eg.end(), 1);
	for(int i = 0; i * sq + 1 <= q; i++){
		Process(i * sq + 1, min(q, (i + 1) * sq));
	}
 
	for(int i = 1; i <= q; i++){
		if(ans[i] == -1) continue;
		printf("%d\n", ans[i]);
	}
	
	return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:137:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
bridges.cpp:140:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &edges[i].fi, &edges[i].se, &w[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:143:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
bridges.cpp:146:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &qry[i].type, &qry[i].a, &qry[i].b);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 49 ms 1016 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 32 ms 896 KB Output is correct
6 Correct 30 ms 896 KB Output is correct
7 Correct 31 ms 896 KB Output is correct
8 Correct 29 ms 896 KB Output is correct
9 Correct 32 ms 896 KB Output is correct
10 Correct 31 ms 896 KB Output is correct
11 Correct 30 ms 896 KB Output is correct
12 Correct 32 ms 1116 KB Output is correct
13 Correct 38 ms 896 KB Output is correct
14 Correct 44 ms 896 KB Output is correct
15 Correct 33 ms 896 KB Output is correct
16 Correct 32 ms 896 KB Output is correct
17 Correct 32 ms 896 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1330 ms 4360 KB Output is correct
2 Correct 1320 ms 4476 KB Output is correct
3 Correct 1315 ms 4344 KB Output is correct
4 Correct 1397 ms 4364 KB Output is correct
5 Correct 1429 ms 4600 KB Output is correct
6 Correct 1995 ms 4600 KB Output is correct
7 Correct 1994 ms 4616 KB Output is correct
8 Correct 2009 ms 4616 KB Output is correct
9 Correct 51 ms 2552 KB Output is correct
10 Correct 1246 ms 4488 KB Output is correct
11 Correct 1132 ms 4484 KB Output is correct
12 Correct 1252 ms 4984 KB Output is correct
13 Correct 1184 ms 4516 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1024 ms 3684 KB Output is correct
2 Correct 719 ms 2808 KB Output is correct
3 Correct 1173 ms 3952 KB Output is correct
4 Correct 1006 ms 3816 KB Output is correct
5 Correct 49 ms 2556 KB Output is correct
6 Correct 1096 ms 3816 KB Output is correct
7 Correct 976 ms 3704 KB Output is correct
8 Correct 872 ms 3816 KB Output is correct
9 Correct 719 ms 3948 KB Output is correct
10 Correct 694 ms 3816 KB Output is correct
11 Correct 719 ms 3688 KB Output is correct
12 Correct 652 ms 3696 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1284 ms 6392 KB Output is correct
2 Correct 52 ms 2552 KB Output is correct
3 Correct 144 ms 4088 KB Output is correct
4 Correct 119 ms 4092 KB Output is correct
5 Correct 1010 ms 6400 KB Output is correct
6 Correct 1268 ms 6292 KB Output is correct
7 Correct 1000 ms 6392 KB Output is correct
8 Correct 637 ms 4468 KB Output is correct
9 Correct 635 ms 4472 KB Output is correct
10 Correct 626 ms 4600 KB Output is correct
11 Correct 964 ms 5496 KB Output is correct
12 Correct 937 ms 5496 KB Output is correct
13 Correct 956 ms 5624 KB Output is correct
14 Correct 950 ms 6392 KB Output is correct
15 Correct 978 ms 6508 KB Output is correct
16 Correct 1276 ms 6328 KB Output is correct
17 Correct 1266 ms 6268 KB Output is correct
18 Correct 1302 ms 6264 KB Output is correct
19 Correct 1276 ms 6392 KB Output is correct
20 Correct 1106 ms 6008 KB Output is correct
21 Correct 1164 ms 5992 KB Output is correct
22 Correct 1318 ms 6272 KB Output is correct
23 Correct 941 ms 5752 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1330 ms 4360 KB Output is correct
2 Correct 1320 ms 4476 KB Output is correct
3 Correct 1315 ms 4344 KB Output is correct
4 Correct 1397 ms 4364 KB Output is correct
5 Correct 1429 ms 4600 KB Output is correct
6 Correct 1995 ms 4600 KB Output is correct
7 Correct 1994 ms 4616 KB Output is correct
8 Correct 2009 ms 4616 KB Output is correct
9 Correct 51 ms 2552 KB Output is correct
10 Correct 1246 ms 4488 KB Output is correct
11 Correct 1132 ms 4484 KB Output is correct
12 Correct 1252 ms 4984 KB Output is correct
13 Correct 1184 ms 4516 KB Output is correct
14 Correct 1024 ms 3684 KB Output is correct
15 Correct 719 ms 2808 KB Output is correct
16 Correct 1173 ms 3952 KB Output is correct
17 Correct 1006 ms 3816 KB Output is correct
18 Correct 49 ms 2556 KB Output is correct
19 Correct 1096 ms 3816 KB Output is correct
20 Correct 976 ms 3704 KB Output is correct
21 Correct 872 ms 3816 KB Output is correct
22 Correct 719 ms 3948 KB Output is correct
23 Correct 694 ms 3816 KB Output is correct
24 Correct 719 ms 3688 KB Output is correct
25 Correct 652 ms 3696 KB Output is correct
26 Correct 1460 ms 4580 KB Output is correct
27 Correct 1637 ms 4488 KB Output is correct
28 Correct 1423 ms 4600 KB Output is correct
29 Correct 1194 ms 4372 KB Output is correct
30 Correct 1680 ms 4624 KB Output is correct
31 Correct 1639 ms 4600 KB Output is correct
32 Correct 1653 ms 4600 KB Output is correct
33 Correct 1428 ms 4600 KB Output is correct
34 Correct 1425 ms 4360 KB Output is correct
35 Correct 1436 ms 4460 KB Output is correct
36 Correct 1236 ms 4392 KB Output is correct
37 Correct 1177 ms 4472 KB Output is correct
38 Correct 1170 ms 4464 KB Output is correct
39 Correct 1014 ms 4600 KB Output is correct
40 Correct 1044 ms 4564 KB Output is correct
41 Correct 1044 ms 4600 KB Output is correct
42 Correct 938 ms 4344 KB Output is correct
43 Correct 927 ms 4472 KB Output is correct
44 Correct 921 ms 4344 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 49 ms 1016 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 32 ms 896 KB Output is correct
6 Correct 30 ms 896 KB Output is correct
7 Correct 31 ms 896 KB Output is correct
8 Correct 29 ms 896 KB Output is correct
9 Correct 32 ms 896 KB Output is correct
10 Correct 31 ms 896 KB Output is correct
11 Correct 30 ms 896 KB Output is correct
12 Correct 32 ms 1116 KB Output is correct
13 Correct 38 ms 896 KB Output is correct
14 Correct 44 ms 896 KB Output is correct
15 Correct 33 ms 896 KB Output is correct
16 Correct 32 ms 896 KB Output is correct
17 Correct 32 ms 896 KB Output is correct
18 Correct 1330 ms 4360 KB Output is correct
19 Correct 1320 ms 4476 KB Output is correct
20 Correct 1315 ms 4344 KB Output is correct
21 Correct 1397 ms 4364 KB Output is correct
22 Correct 1429 ms 4600 KB Output is correct
23 Correct 1995 ms 4600 KB Output is correct
24 Correct 1994 ms 4616 KB Output is correct
25 Correct 2009 ms 4616 KB Output is correct
26 Correct 51 ms 2552 KB Output is correct
27 Correct 1246 ms 4488 KB Output is correct
28 Correct 1132 ms 4484 KB Output is correct
29 Correct 1252 ms 4984 KB Output is correct
30 Correct 1184 ms 4516 KB Output is correct
31 Correct 1024 ms 3684 KB Output is correct
32 Correct 719 ms 2808 KB Output is correct
33 Correct 1173 ms 3952 KB Output is correct
34 Correct 1006 ms 3816 KB Output is correct
35 Correct 49 ms 2556 KB Output is correct
36 Correct 1096 ms 3816 KB Output is correct
37 Correct 976 ms 3704 KB Output is correct
38 Correct 872 ms 3816 KB Output is correct
39 Correct 719 ms 3948 KB Output is correct
40 Correct 694 ms 3816 KB Output is correct
41 Correct 719 ms 3688 KB Output is correct
42 Correct 652 ms 3696 KB Output is correct
43 Correct 1284 ms 6392 KB Output is correct
44 Correct 52 ms 2552 KB Output is correct
45 Correct 144 ms 4088 KB Output is correct
46 Correct 119 ms 4092 KB Output is correct
47 Correct 1010 ms 6400 KB Output is correct
48 Correct 1268 ms 6292 KB Output is correct
49 Correct 1000 ms 6392 KB Output is correct
50 Correct 637 ms 4468 KB Output is correct
51 Correct 635 ms 4472 KB Output is correct
52 Correct 626 ms 4600 KB Output is correct
53 Correct 964 ms 5496 KB Output is correct
54 Correct 937 ms 5496 KB Output is correct
55 Correct 956 ms 5624 KB Output is correct
56 Correct 950 ms 6392 KB Output is correct
57 Correct 978 ms 6508 KB Output is correct
58 Correct 1276 ms 6328 KB Output is correct
59 Correct 1266 ms 6268 KB Output is correct
60 Correct 1302 ms 6264 KB Output is correct
61 Correct 1276 ms 6392 KB Output is correct
62 Correct 1106 ms 6008 KB Output is correct
63 Correct 1164 ms 5992 KB Output is correct
64 Correct 1318 ms 6272 KB Output is correct
65 Correct 941 ms 5752 KB Output is correct
66 Correct 1460 ms 4580 KB Output is correct
67 Correct 1637 ms 4488 KB Output is correct
68 Correct 1423 ms 4600 KB Output is correct
69 Correct 1194 ms 4372 KB Output is correct
70 Correct 1680 ms 4624 KB Output is correct
71 Correct 1639 ms 4600 KB Output is correct
72 Correct 1653 ms 4600 KB Output is correct
73 Correct 1428 ms 4600 KB Output is correct
74 Correct 1425 ms 4360 KB Output is correct
75 Correct 1436 ms 4460 KB Output is correct
76 Correct 1236 ms 4392 KB Output is correct
77 Correct 1177 ms 4472 KB Output is correct
78 Correct 1170 ms 4464 KB Output is correct
79 Correct 1014 ms 4600 KB Output is correct
80 Correct 1044 ms 4564 KB Output is correct
81 Correct 1044 ms 4600 KB Output is correct
82 Correct 938 ms 4344 KB Output is correct
83 Correct 927 ms 4472 KB Output is correct
84 Correct 921 ms 4344 KB Output is correct
85 Correct 2266 ms 6048 KB Output is correct
86 Correct 250 ms 4092 KB Output is correct
87 Correct 168 ms 4216 KB Output is correct
88 Correct 1542 ms 6140 KB Output is correct
89 Correct 2402 ms 6264 KB Output is correct
90 Correct 1575 ms 6136 KB Output is correct
91 Correct 1467 ms 4472 KB Output is correct
92 Correct 1451 ms 4696 KB Output is correct
93 Correct 2011 ms 4488 KB Output is correct
94 Correct 1897 ms 5272 KB Output is correct
95 Correct 1869 ms 5272 KB Output is correct
96 Correct 2229 ms 5272 KB Output is correct
97 Correct 1156 ms 6268 KB Output is correct
98 Correct 1270 ms 6068 KB Output is correct
99 Correct 2319 ms 6228 KB Output is correct
100 Correct 2335 ms 6140 KB Output is correct
101 Correct 2392 ms 6136 KB Output is correct
102 Correct 2386 ms 6140 KB Output is correct
103 Correct 2446 ms 5752 KB Output is correct
104 Correct 2480 ms 5752 KB Output is correct
105 Correct 1848 ms 5472 KB Output is correct
106 Correct 1470 ms 5244 KB Output is correct
107 Correct 1753 ms 5880 KB Output is correct
108 Correct 2310 ms 6148 KB Output is correct
109 Correct 1597 ms 5656 KB Output is correct