oj.uz

Submission #484909

# Submission time Handle Problem Language Result Execution time Memory
484909 2021-11-05T17:46:54 Z MilosMilutinovic Bridges (APIO19_bridges) C++14
100 / 100
 2468 ms 210768 KB 
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
const int BLOCK=800;
int n,m,q,u[N],v[N],w[N],t[N],x[N],y[N],ans[N];
vector<int> qs[BLOCK+5];
bool vis[N];
struct Dsu{
	int p[N],sz[N];
	void init(){
		for(int i=1;i<=n;i++){
			p[i]=i;
			sz[i]=1;
		}
	}
	int root(int u){
		return p[u]==u?u:root(p[u]);
	}
	stack<tuple<int,int,int,int>> stk;
	void unite(int u,int v){
		u=root(u);
		v=root(v);
		if(sz[u]<sz[v])swap(u,v);
		stk.push({u,v,sz[u],sz[v]});
		if(u==v)return;
		p[v]=u;
		sz[u]+=sz[v];
	}
	void rollback(){
		auto op=stk.top();
		stk.pop();
		int u=get<0>(op);
		int v=get<1>(op);
		p[u]=u;
		p[v]=v;
		sz[u]=get<2>(op);
		sz[v]=get<3>(op);
	}
}d;
signed main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++){
		scanf("%d%d%d",&u[i],&v[i],&w[i]);
	}
	scanf("%d",&q);
	for(int i=1;i<=q;i++){
		scanf("%d%d%d",&t[i],&x[i],&y[i]);
	}
	for(int l=1;l<=q;l+=BLOCK){
		int r=min(q,l+BLOCK-1);
		for(int i=0;i<=BLOCK;i++)qs[i].clear();
		for(int id=1;id<=m;id++)vis[id]=false;
		d.init();
		vector<int> edg,ver;
		for(int i=l;i<=r;i++)if(t[i]==1)edg.push_back(x[i]);
		for(int i=l;i<=r;i++){
			if(t[i]==1){
				vis[x[i]]=true;
				w[x[i]]=y[i];
			}else{
				for(int id:edg)if(w[id]>=y[i])qs[i-l].push_back(id);
				ver.push_back(i);
			}
		}
		vector<int> unu;
		for(int id=1;id<=m;id++)if(!vis[id])unu.push_back(id);
		sort(ver.begin(),ver.end(),[&](int i,int j){
			return y[i]>y[j];
		});
		sort(unu.begin(),unu.end(),[&](int i,int j){
			return w[i]>w[j];
		});
		int ptr=0;
		for(int i=0;i<(int)ver.size();i++){
			int pos=ver[i],bd=pos-l;
			while (ptr<unu.size()&&y[pos]<=w[unu[ptr]]){
				d.unite(u[unu[ptr]],v[unu[ptr]]);
				ptr++;
			}
			for(int id:qs[bd])d.unite(u[id],v[id]);
			ans[pos]=d.sz[d.root(x[pos])];
			for(int id:qs[bd])d.rollback();
		}
	}
	for(int i=1;i<=q;i++){
		if(t[i]==2){
			printf("%d\n",ans[i]);
		}
	}
	return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:76:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |    while (ptr<unu.size()&&y[pos]<=w[unu[ptr]]){
      |           ~~~^~~~~~~~~~~
bridges.cpp:82:12: warning: unused variable 'id' [-Wunused-variable]
   82 |    for(int id:qs[bd])d.rollback();
      |            ^~
bridges.cpp:41:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~
bridges.cpp:43:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |   scanf("%d%d%d",&u[i],&v[i],&w[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:45:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |  scanf("%d",&q);
      |  ~~~~~^~~~~~~~~
bridges.cpp:47:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |   scanf("%d%d%d",&t[i],&x[i],&y[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 42 ms 2352 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 40 ms 2200 KB Output is correct
6 Correct 32 ms 1944 KB Output is correct
7 Correct 34 ms 2192 KB Output is correct
8 Correct 40 ms 2068 KB Output is correct
9 Correct 47 ms 2092 KB Output is correct
10 Correct 37 ms 2188 KB Output is correct
11 Correct 44 ms 2144 KB Output is correct
12 Correct 53 ms 2108 KB Output is correct
13 Correct 47 ms 2116 KB Output is correct
14 Correct 47 ms 2136 KB Output is correct
15 Correct 44 ms 2080 KB Output is correct
16 Correct 47 ms 2212 KB Output is correct
17 Correct 42 ms 2116 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1470 ms 106196 KB Output is correct
2 Correct 1392 ms 106304 KB Output is correct
3 Correct 1427 ms 106280 KB Output is correct
4 Correct 1401 ms 106280 KB Output is correct
5 Correct 1445 ms 106360 KB Output is correct
6 Correct 1872 ms 106604 KB Output is correct
7 Correct 1913 ms 106608 KB Output is correct
8 Correct 1887 ms 106540 KB Output is correct
9 Correct 53 ms 1988 KB Output is correct
10 Correct 994 ms 106560 KB Output is correct
11 Correct 1027 ms 106584 KB Output is correct
12 Correct 1399 ms 106324 KB Output is correct
13 Correct 1290 ms 107360 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1093 ms 70652 KB Output is correct
2 Correct 679 ms 19836 KB Output is correct
3 Correct 1165 ms 70860 KB Output is correct
4 Correct 1060 ms 70784 KB Output is correct
5 Correct 36 ms 2036 KB Output is correct
6 Correct 1104 ms 70768 KB Output is correct
7 Correct 953 ms 70604 KB Output is correct
8 Correct 900 ms 70532 KB Output is correct
9 Correct 740 ms 70492 KB Output is correct
10 Correct 754 ms 70272 KB Output is correct
11 Correct 750 ms 71140 KB Output is correct
12 Correct 691 ms 70448 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1978 ms 209016 KB Output is correct
2 Correct 55 ms 2116 KB Output is correct
3 Correct 207 ms 23428 KB Output is correct
4 Correct 94 ms 23372 KB Output is correct
5 Correct 1051 ms 209372 KB Output is correct
6 Correct 1887 ms 209120 KB Output is correct
7 Correct 1026 ms 209348 KB Output is correct
8 Correct 982 ms 105728 KB Output is correct
9 Correct 935 ms 105620 KB Output is correct
10 Correct 980 ms 105904 KB Output is correct
11 Correct 1453 ms 157400 KB Output is correct
12 Correct 1408 ms 157244 KB Output is correct
13 Correct 1482 ms 157724 KB Output is correct
14 Correct 1177 ms 209340 KB Output is correct
15 Correct 996 ms 209352 KB Output is correct
16 Correct 1976 ms 207096 KB Output is correct
17 Correct 1949 ms 206928 KB Output is correct
18 Correct 2016 ms 207732 KB Output is correct
19 Correct 2076 ms 207340 KB Output is correct
20 Correct 1648 ms 174912 KB Output is correct
21 Correct 1648 ms 174980 KB Output is correct
22 Correct 1899 ms 199136 KB Output is correct
23 Correct 1222 ms 168308 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1470 ms 106196 KB Output is correct
2 Correct 1392 ms 106304 KB Output is correct
3 Correct 1427 ms 106280 KB Output is correct
4 Correct 1401 ms 106280 KB Output is correct
5 Correct 1445 ms 106360 KB Output is correct
6 Correct 1872 ms 106604 KB Output is correct
7 Correct 1913 ms 106608 KB Output is correct
8 Correct 1887 ms 106540 KB Output is correct
9 Correct 53 ms 1988 KB Output is correct
10 Correct 994 ms 106560 KB Output is correct
11 Correct 1027 ms 106584 KB Output is correct
12 Correct 1399 ms 106324 KB Output is correct
13 Correct 1290 ms 107360 KB Output is correct
14 Correct 1093 ms 70652 KB Output is correct
15 Correct 679 ms 19836 KB Output is correct
16 Correct 1165 ms 70860 KB Output is correct
17 Correct 1060 ms 70784 KB Output is correct
18 Correct 36 ms 2036 KB Output is correct
19 Correct 1104 ms 70768 KB Output is correct
20 Correct 953 ms 70604 KB Output is correct
21 Correct 900 ms 70532 KB Output is correct
22 Correct 740 ms 70492 KB Output is correct
23 Correct 754 ms 70272 KB Output is correct
24 Correct 750 ms 71140 KB Output is correct
25 Correct 691 ms 70448 KB Output is correct
26 Correct 1368 ms 106316 KB Output is correct
27 Correct 1704 ms 106580 KB Output is correct
28 Correct 1478 ms 106360 KB Output is correct
29 Correct 1202 ms 105772 KB Output is correct
30 Correct 1669 ms 106600 KB Output is correct
31 Correct 1679 ms 106564 KB Output is correct
32 Correct 1618 ms 106556 KB Output is correct
33 Correct 1401 ms 106392 KB Output is correct
34 Correct 1411 ms 106288 KB Output is correct
35 Correct 1450 ms 106324 KB Output is correct
36 Correct 1150 ms 105812 KB Output is correct
37 Correct 1133 ms 105816 KB Output is correct
38 Correct 1134 ms 105688 KB Output is correct
39 Correct 994 ms 105628 KB Output is correct
40 Correct 1006 ms 105740 KB Output is correct
41 Correct 978 ms 105540 KB Output is correct
42 Correct 973 ms 103000 KB Output is correct
43 Correct 969 ms 103180 KB Output is correct
44 Correct 981 ms 102536 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 42 ms 2352 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 40 ms 2200 KB Output is correct
6 Correct 32 ms 1944 KB Output is correct
7 Correct 34 ms 2192 KB Output is correct
8 Correct 40 ms 2068 KB Output is correct
9 Correct 47 ms 2092 KB Output is correct
10 Correct 37 ms 2188 KB Output is correct
11 Correct 44 ms 2144 KB Output is correct
12 Correct 53 ms 2108 KB Output is correct
13 Correct 47 ms 2116 KB Output is correct
14 Correct 47 ms 2136 KB Output is correct
15 Correct 44 ms 2080 KB Output is correct
16 Correct 47 ms 2212 KB Output is correct
17 Correct 42 ms 2116 KB Output is correct
18 Correct 1470 ms 106196 KB Output is correct
19 Correct 1392 ms 106304 KB Output is correct
20 Correct 1427 ms 106280 KB Output is correct
21 Correct 1401 ms 106280 KB Output is correct
22 Correct 1445 ms 106360 KB Output is correct
23 Correct 1872 ms 106604 KB Output is correct
24 Correct 1913 ms 106608 KB Output is correct
25 Correct 1887 ms 106540 KB Output is correct
26 Correct 53 ms 1988 KB Output is correct
27 Correct 994 ms 106560 KB Output is correct
28 Correct 1027 ms 106584 KB Output is correct
29 Correct 1399 ms 106324 KB Output is correct
30 Correct 1290 ms 107360 KB Output is correct
31 Correct 1093 ms 70652 KB Output is correct
32 Correct 679 ms 19836 KB Output is correct
33 Correct 1165 ms 70860 KB Output is correct
34 Correct 1060 ms 70784 KB Output is correct
35 Correct 36 ms 2036 KB Output is correct
36 Correct 1104 ms 70768 KB Output is correct
37 Correct 953 ms 70604 KB Output is correct
38 Correct 900 ms 70532 KB Output is correct
39 Correct 740 ms 70492 KB Output is correct
40 Correct 754 ms 70272 KB Output is correct
41 Correct 750 ms 71140 KB Output is correct
42 Correct 691 ms 70448 KB Output is correct
43 Correct 1978 ms 209016 KB Output is correct
44 Correct 55 ms 2116 KB Output is correct
45 Correct 207 ms 23428 KB Output is correct
46 Correct 94 ms 23372 KB Output is correct
47 Correct 1051 ms 209372 KB Output is correct
48 Correct 1887 ms 209120 KB Output is correct
49 Correct 1026 ms 209348 KB Output is correct
50 Correct 982 ms 105728 KB Output is correct
51 Correct 935 ms 105620 KB Output is correct
52 Correct 980 ms 105904 KB Output is correct
53 Correct 1453 ms 157400 KB Output is correct
54 Correct 1408 ms 157244 KB Output is correct
55 Correct 1482 ms 157724 KB Output is correct
56 Correct 1177 ms 209340 KB Output is correct
57 Correct 996 ms 209352 KB Output is correct
58 Correct 1976 ms 207096 KB Output is correct
59 Correct 1949 ms 206928 KB Output is correct
60 Correct 2016 ms 207732 KB Output is correct
61 Correct 2076 ms 207340 KB Output is correct
62 Correct 1648 ms 174912 KB Output is correct
63 Correct 1648 ms 174980 KB Output is correct
64 Correct 1899 ms 199136 KB Output is correct
65 Correct 1222 ms 168308 KB Output is correct
66 Correct 1368 ms 106316 KB Output is correct
67 Correct 1704 ms 106580 KB Output is correct
68 Correct 1478 ms 106360 KB Output is correct
69 Correct 1202 ms 105772 KB Output is correct
70 Correct 1669 ms 106600 KB Output is correct
71 Correct 1679 ms 106564 KB Output is correct
72 Correct 1618 ms 106556 KB Output is correct
73 Correct 1401 ms 106392 KB Output is correct
74 Correct 1411 ms 106288 KB Output is correct
75 Correct 1450 ms 106324 KB Output is correct
76 Correct 1150 ms 105812 KB Output is correct
77 Correct 1133 ms 105816 KB Output is correct
78 Correct 1134 ms 105688 KB Output is correct
79 Correct 994 ms 105628 KB Output is correct
80 Correct 1006 ms 105740 KB Output is correct
81 Correct 978 ms 105540 KB Output is correct
82 Correct 973 ms 103000 KB Output is correct
83 Correct 969 ms 103180 KB Output is correct
84 Correct 981 ms 102536 KB Output is correct
85 Correct 2338 ms 209284 KB Output is correct
86 Correct 235 ms 24844 KB Output is correct
87 Correct 158 ms 24748 KB Output is correct
88 Correct 1433 ms 209868 KB Output is correct
89 Correct 2321 ms 209404 KB Output is correct
90 Correct 1429 ms 209844 KB Output is correct
91 Correct 1477 ms 106396 KB Output is correct
92 Correct 1438 ms 106264 KB Output is correct
93 Correct 1919 ms 106448 KB Output is correct
94 Correct 1943 ms 157704 KB Output is correct
95 Correct 1957 ms 157720 KB Output is correct
96 Correct 2233 ms 158108 KB Output is correct
97 Correct 1181 ms 209600 KB Output is correct
98 Correct 1241 ms 210768 KB Output is correct
99 Correct 2374 ms 207576 KB Output is correct
100 Correct 2306 ms 207296 KB Output is correct
101 Correct 2393 ms 208020 KB Output is correct
102 Correct 2312 ms 207656 KB Output is correct
103 Correct 2465 ms 175484 KB Output is correct
104 Correct 2457 ms 175364 KB Output is correct
105 Correct 1902 ms 176084 KB Output is correct
106 Correct 1574 ms 158732 KB Output is correct
107 Correct 1790 ms 175092 KB Output is correct
108 Correct 2468 ms 199520 KB Output is correct
109 Correct 1711 ms 168780 KB Output is correct