Submission #398591

# Submission time Handle Problem Language Result Execution time Memory
398591 2021-05-04T15:09:08 Z mosiashvililuka Bridges (APIO19_bridges) C++17
59 / 100
3000 ms 9388 KB
#include<bits/stdc++.h>
using namespace std;
const int T=340;
int a,b,c,d,e,i,j,ii,jj,zx,xc,tes,t,te,fx[100009],pi,msh[100009],sz[100009],cnt,bo[100009],ans[100009];
int qi,qqi;
int A,B,C,D,E;
stack <pair <int, int> > M,S;
pair <pair <int, int>, int> P[100009];
pair <int, pair <int, int> > Q[100009],p[100009];
pair <int, int> q[100009],qq[100009];
int fnd(int q){
	while(msh[q]!=0) q=msh[q];
	return q;
}
void mrg(int q, int w){
	q=fnd(q);w=fnd(w);
	if(q==w) return;
	if(sz[q]<sz[w]) swap(q,w);
	M.push(make_pair(w,msh[w]));
	S.push(make_pair(q,sz[q]));
	msh[w]=q;
	sz[q]+=sz[w];
}
void rollback(){
	msh[M.top().first]=M.top().second;
	sz[S.top().first]=S.top().second;
	M.pop();S.pop();
}
void ROLL(int q){
	while(M.size()>q){
		msh[M.top().first]=M.top().second;
		sz[S.top().first]=S.top().second;
		M.pop();S.pop();
	}
}
int main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>a>>b;
	for(i=1; i<=b; i++){
		cin>>P[i].first.first>>P[i].first.second>>P[i].second;
		P[i].second=-P[i].second;
	}
	cin>>tes;
	for(t=1; t<=tes; t++){
		cin>>Q[t].first>>Q[t].second.first>>Q[t].second.second;
		Q[t].second.second=-Q[t].second.second;
	}
	for(t=1; t<=tes; t++){
		ans[t]=-1;
	}
	for(t=T; ; t+=T){
		te=t-T+1;
		if(t>tes) t=tes;
		if(te>t) break;
		pi=0;
		for(i=te; i<=t; i++){
			if(Q[i].first==1){
				fx[Q[i].second.first]=t;
			}
		}
		for(i=1; i<=a; i++){
			msh[i]=0;sz[i]=1;
		}
		while(M.size()) M.pop();
		while(S.size()) S.pop();
		/*for(i=te-1; i>=1; i--){
			if(Q[i].first==1){
				if(fx[Q[i].second.first]==t) continue;
				pi++;
				p[pi].first=Q[i].second.second;
				p[pi].second=P[Q[i].second.first].first;
				fx[Q[t].second.first]=t;
			}
		}*/
		for(i=1; i<=b; i++){
			if(fx[i]==t) continue;
			pi++;
			p[pi].first=P[i].second;
			p[pi].second=P[i].first;
		}
		sort(p+1,p+pi+1);
		qi=0;qqi=0;
		for(i=te; i<=t; i++){
			if(Q[i].first==1){
				
			}else{
				qqi++;
				qq[qqi].first=Q[i].second.second;
				qq[qqi].second=i;
			}
		}
		sort(qq+1,qq+qqi+1);
		A=1;B=1;
		for(i=1; i<=qqi; i++){
			while(A<=pi&&p[A].first<=qq[i].first){
				mrg(p[A].second.first,p[A].second.second);
				A++;
			}
			E=M.size();
			cnt++;
			for(j=qq[i].second; j>=te; j--){
				if(Q[j].first==2) continue;
				if(bo[Q[j].second.first]==cnt){
					
				}else{
					bo[Q[j].second.first]=cnt;
					if(Q[j].second.second<=qq[i].first){
						mrg(P[Q[j].second.first].first.first,P[Q[j].second.first].first.second);
					}
				}
			}
			for(j=qq[i].second+1; j<=t; j++){
				if(Q[j].first==1&&bo[Q[j].second.first]!=cnt){
					if(P[Q[j].second.first].second<=qq[i].first){
						mrg(P[Q[j].second.first].first.first,P[Q[j].second.first].first.second);
					}
					bo[Q[j].second.first]=cnt;
				}
			}
			c=Q[qq[i].second].second.first;d=qq[i].second;
			ans[d]=sz[fnd(c)];
			ROLL(E);
		}
		for(i=te; i<=t; i++){
			if(Q[i].first==1){
				P[Q[i].second.first].second=Q[i].second.second;
			}
		}
	}
	for(t=1; t<=tes; t++){
		if(ans[t]==-1) continue;
		cout<<ans[t]<<endl;
	}
	return 0;
}

Compilation message

bridges.cpp: In function 'void ROLL(int)':
bridges.cpp:30:16: warning: comparison of integer expressions of different signedness: 'std::stack<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |  while(M.size()>q){
      |        ~~~~~~~~^~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 30 ms 740 KB Output is correct
4 Correct 31 ms 660 KB Output is correct
5 Correct 28 ms 660 KB Output is correct
6 Correct 24 ms 588 KB Output is correct
7 Correct 35 ms 708 KB Output is correct
8 Correct 30 ms 680 KB Output is correct
9 Correct 33 ms 596 KB Output is correct
10 Correct 32 ms 628 KB Output is correct
11 Correct 31 ms 604 KB Output is correct
12 Correct 37 ms 676 KB Output is correct
13 Correct 35 ms 716 KB Output is correct
14 Correct 33 ms 672 KB Output is correct
15 Correct 32 ms 688 KB Output is correct
16 Correct 33 ms 592 KB Output is correct
17 Correct 34 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2531 ms 7592 KB Output is correct
2 Correct 2460 ms 7508 KB Output is correct
3 Correct 2542 ms 7472 KB Output is correct
4 Correct 2502 ms 7740 KB Output is correct
5 Correct 2488 ms 7916 KB Output is correct
6 Correct 2820 ms 7688 KB Output is correct
7 Correct 2949 ms 7576 KB Output is correct
8 Correct 2809 ms 7712 KB Output is correct
9 Correct 296 ms 3524 KB Output is correct
10 Correct 2306 ms 6744 KB Output is correct
11 Correct 2420 ms 6552 KB Output is correct
12 Correct 2490 ms 7712 KB Output is correct
13 Correct 2281 ms 7392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1710 ms 6252 KB Output is correct
2 Correct 799 ms 4036 KB Output is correct
3 Correct 1814 ms 5972 KB Output is correct
4 Correct 1738 ms 6260 KB Output is correct
5 Correct 295 ms 3388 KB Output is correct
6 Correct 1789 ms 6192 KB Output is correct
7 Correct 1691 ms 6228 KB Output is correct
8 Correct 1651 ms 6172 KB Output is correct
9 Correct 1641 ms 6340 KB Output is correct
10 Correct 1636 ms 6168 KB Output is correct
11 Correct 1454 ms 6020 KB Output is correct
12 Correct 1373 ms 6024 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 3073 ms 9388 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2531 ms 7592 KB Output is correct
2 Correct 2460 ms 7508 KB Output is correct
3 Correct 2542 ms 7472 KB Output is correct
4 Correct 2502 ms 7740 KB Output is correct
5 Correct 2488 ms 7916 KB Output is correct
6 Correct 2820 ms 7688 KB Output is correct
7 Correct 2949 ms 7576 KB Output is correct
8 Correct 2809 ms 7712 KB Output is correct
9 Correct 296 ms 3524 KB Output is correct
10 Correct 2306 ms 6744 KB Output is correct
11 Correct 2420 ms 6552 KB Output is correct
12 Correct 2490 ms 7712 KB Output is correct
13 Correct 2281 ms 7392 KB Output is correct
14 Correct 1710 ms 6252 KB Output is correct
15 Correct 799 ms 4036 KB Output is correct
16 Correct 1814 ms 5972 KB Output is correct
17 Correct 1738 ms 6260 KB Output is correct
18 Correct 295 ms 3388 KB Output is correct
19 Correct 1789 ms 6192 KB Output is correct
20 Correct 1691 ms 6228 KB Output is correct
21 Correct 1651 ms 6172 KB Output is correct
22 Correct 1641 ms 6340 KB Output is correct
23 Correct 1636 ms 6168 KB Output is correct
24 Correct 1454 ms 6020 KB Output is correct
25 Correct 1373 ms 6024 KB Output is correct
26 Correct 2511 ms 7792 KB Output is correct
27 Correct 2786 ms 7420 KB Output is correct
28 Correct 2667 ms 7800 KB Output is correct
29 Correct 2483 ms 7716 KB Output is correct
30 Correct 2763 ms 7608 KB Output is correct
31 Correct 2743 ms 7508 KB Output is correct
32 Correct 2773 ms 7500 KB Output is correct
33 Correct 2569 ms 7696 KB Output is correct
34 Correct 2585 ms 7976 KB Output is correct
35 Correct 2591 ms 7880 KB Output is correct
36 Correct 2410 ms 7596 KB Output is correct
37 Correct 2429 ms 7724 KB Output is correct
38 Correct 2485 ms 7664 KB Output is correct
39 Correct 2472 ms 7772 KB Output is correct
40 Correct 2463 ms 7648 KB Output is correct
41 Correct 2429 ms 7544 KB Output is correct
42 Correct 2138 ms 7668 KB Output is correct
43 Correct 2165 ms 7496 KB Output is correct
44 Correct 2123 ms 7492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 30 ms 740 KB Output is correct
4 Correct 31 ms 660 KB Output is correct
5 Correct 28 ms 660 KB Output is correct
6 Correct 24 ms 588 KB Output is correct
7 Correct 35 ms 708 KB Output is correct
8 Correct 30 ms 680 KB Output is correct
9 Correct 33 ms 596 KB Output is correct
10 Correct 32 ms 628 KB Output is correct
11 Correct 31 ms 604 KB Output is correct
12 Correct 37 ms 676 KB Output is correct
13 Correct 35 ms 716 KB Output is correct
14 Correct 33 ms 672 KB Output is correct
15 Correct 32 ms 688 KB Output is correct
16 Correct 33 ms 592 KB Output is correct
17 Correct 34 ms 604 KB Output is correct
18 Correct 2531 ms 7592 KB Output is correct
19 Correct 2460 ms 7508 KB Output is correct
20 Correct 2542 ms 7472 KB Output is correct
21 Correct 2502 ms 7740 KB Output is correct
22 Correct 2488 ms 7916 KB Output is correct
23 Correct 2820 ms 7688 KB Output is correct
24 Correct 2949 ms 7576 KB Output is correct
25 Correct 2809 ms 7712 KB Output is correct
26 Correct 296 ms 3524 KB Output is correct
27 Correct 2306 ms 6744 KB Output is correct
28 Correct 2420 ms 6552 KB Output is correct
29 Correct 2490 ms 7712 KB Output is correct
30 Correct 2281 ms 7392 KB Output is correct
31 Correct 1710 ms 6252 KB Output is correct
32 Correct 799 ms 4036 KB Output is correct
33 Correct 1814 ms 5972 KB Output is correct
34 Correct 1738 ms 6260 KB Output is correct
35 Correct 295 ms 3388 KB Output is correct
36 Correct 1789 ms 6192 KB Output is correct
37 Correct 1691 ms 6228 KB Output is correct
38 Correct 1651 ms 6172 KB Output is correct
39 Correct 1641 ms 6340 KB Output is correct
40 Correct 1636 ms 6168 KB Output is correct
41 Correct 1454 ms 6020 KB Output is correct
42 Correct 1373 ms 6024 KB Output is correct
43 Execution timed out 3073 ms 9388 KB Time limit exceeded
44 Halted 0 ms 0 KB -