답안 #398606

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
398606 2021-05-04T15:28:08 Z mosiashvililuka 다리 (APIO19_bridges) C++17
73 / 100
3000 ms 6464 KB
#include<bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target("avx2,fma")
using namespace std;
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,sub4;
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;
		if(Q[t].first==1) sub4=1;
	}
	if(sub4==0){
		T=a;
		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=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();
			c=Q[qq[i].second].second.first;d=qq[i].second;
			ans[d]=sz[fnd(c)];
		}
		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;
	}
	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=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:32: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]
   32 |  while(M.size()>q){
      |        ~~~~~~~~^~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 34 ms 560 KB Output is correct
4 Correct 18 ms 512 KB Output is correct
5 Correct 26 ms 460 KB Output is correct
6 Correct 22 ms 516 KB Output is correct
7 Correct 26 ms 460 KB Output is correct
8 Correct 26 ms 460 KB Output is correct
9 Correct 27 ms 536 KB Output is correct
10 Correct 26 ms 532 KB Output is correct
11 Correct 26 ms 532 KB Output is correct
12 Correct 27 ms 460 KB Output is correct
13 Correct 32 ms 460 KB Output is correct
14 Correct 33 ms 516 KB Output is correct
15 Correct 28 ms 528 KB Output is correct
16 Correct 32 ms 532 KB Output is correct
17 Correct 27 ms 528 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2382 ms 4948 KB Output is correct
2 Correct 2493 ms 4788 KB Output is correct
3 Correct 2437 ms 4892 KB Output is correct
4 Correct 2467 ms 4904 KB Output is correct
5 Correct 2442 ms 4836 KB Output is correct
6 Correct 2688 ms 5068 KB Output is correct
7 Correct 2661 ms 4908 KB Output is correct
8 Correct 2744 ms 5100 KB Output is correct
9 Correct 186 ms 1988 KB Output is correct
10 Correct 2079 ms 4912 KB Output is correct
11 Correct 2259 ms 4848 KB Output is correct
12 Correct 2432 ms 5156 KB Output is correct
13 Correct 2291 ms 4892 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1654 ms 3860 KB Output is correct
2 Correct 714 ms 2488 KB Output is correct
3 Correct 1701 ms 3972 KB Output is correct
4 Correct 1600 ms 3860 KB Output is correct
5 Correct 204 ms 2000 KB Output is correct
6 Correct 1657 ms 3812 KB Output is correct
7 Correct 1609 ms 3864 KB Output is correct
8 Correct 1539 ms 3864 KB Output is correct
9 Correct 1547 ms 3992 KB Output is correct
10 Correct 1530 ms 3872 KB Output is correct
11 Correct 1402 ms 3728 KB Output is correct
12 Correct 1335 ms 3796 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 256 ms 6200 KB Output is correct
2 Correct 187 ms 1972 KB Output is correct
3 Correct 319 ms 2960 KB Output is correct
4 Correct 375 ms 2856 KB Output is correct
5 Correct 256 ms 6336 KB Output is correct
6 Correct 275 ms 6256 KB Output is correct
7 Correct 248 ms 6248 KB Output is correct
8 Correct 248 ms 4868 KB Output is correct
9 Correct 223 ms 4964 KB Output is correct
10 Correct 227 ms 4968 KB Output is correct
11 Correct 243 ms 5444 KB Output is correct
12 Correct 241 ms 5520 KB Output is correct
13 Correct 250 ms 5700 KB Output is correct
14 Correct 247 ms 6280 KB Output is correct
15 Correct 248 ms 6464 KB Output is correct
16 Correct 271 ms 6204 KB Output is correct
17 Correct 272 ms 6268 KB Output is correct
18 Correct 260 ms 6240 KB Output is correct
19 Correct 285 ms 6192 KB Output is correct
20 Correct 259 ms 5924 KB Output is correct
21 Correct 272 ms 5904 KB Output is correct
22 Correct 272 ms 6184 KB Output is correct
23 Correct 284 ms 5884 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2382 ms 4948 KB Output is correct
2 Correct 2493 ms 4788 KB Output is correct
3 Correct 2437 ms 4892 KB Output is correct
4 Correct 2467 ms 4904 KB Output is correct
5 Correct 2442 ms 4836 KB Output is correct
6 Correct 2688 ms 5068 KB Output is correct
7 Correct 2661 ms 4908 KB Output is correct
8 Correct 2744 ms 5100 KB Output is correct
9 Correct 186 ms 1988 KB Output is correct
10 Correct 2079 ms 4912 KB Output is correct
11 Correct 2259 ms 4848 KB Output is correct
12 Correct 2432 ms 5156 KB Output is correct
13 Correct 2291 ms 4892 KB Output is correct
14 Correct 1654 ms 3860 KB Output is correct
15 Correct 714 ms 2488 KB Output is correct
16 Correct 1701 ms 3972 KB Output is correct
17 Correct 1600 ms 3860 KB Output is correct
18 Correct 204 ms 2000 KB Output is correct
19 Correct 1657 ms 3812 KB Output is correct
20 Correct 1609 ms 3864 KB Output is correct
21 Correct 1539 ms 3864 KB Output is correct
22 Correct 1547 ms 3992 KB Output is correct
23 Correct 1530 ms 3872 KB Output is correct
24 Correct 1402 ms 3728 KB Output is correct
25 Correct 1335 ms 3796 KB Output is correct
26 Correct 2405 ms 5016 KB Output is correct
27 Correct 2709 ms 4996 KB Output is correct
28 Correct 2546 ms 5036 KB Output is correct
29 Correct 2360 ms 4868 KB Output is correct
30 Correct 2616 ms 5084 KB Output is correct
31 Correct 2625 ms 4896 KB Output is correct
32 Correct 2715 ms 4880 KB Output is correct
33 Correct 2666 ms 4828 KB Output is correct
34 Correct 2555 ms 4984 KB Output is correct
35 Correct 2633 ms 5152 KB Output is correct
36 Correct 2423 ms 5148 KB Output is correct
37 Correct 2393 ms 4828 KB Output is correct
38 Correct 2356 ms 4856 KB Output is correct
39 Correct 2386 ms 4880 KB Output is correct
40 Correct 2330 ms 4900 KB Output is correct
41 Correct 2376 ms 4972 KB Output is correct
42 Correct 2092 ms 4836 KB Output is correct
43 Correct 2085 ms 4824 KB Output is correct
44 Correct 2156 ms 4784 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 34 ms 560 KB Output is correct
4 Correct 18 ms 512 KB Output is correct
5 Correct 26 ms 460 KB Output is correct
6 Correct 22 ms 516 KB Output is correct
7 Correct 26 ms 460 KB Output is correct
8 Correct 26 ms 460 KB Output is correct
9 Correct 27 ms 536 KB Output is correct
10 Correct 26 ms 532 KB Output is correct
11 Correct 26 ms 532 KB Output is correct
12 Correct 27 ms 460 KB Output is correct
13 Correct 32 ms 460 KB Output is correct
14 Correct 33 ms 516 KB Output is correct
15 Correct 28 ms 528 KB Output is correct
16 Correct 32 ms 532 KB Output is correct
17 Correct 27 ms 528 KB Output is correct
18 Correct 2382 ms 4948 KB Output is correct
19 Correct 2493 ms 4788 KB Output is correct
20 Correct 2437 ms 4892 KB Output is correct
21 Correct 2467 ms 4904 KB Output is correct
22 Correct 2442 ms 4836 KB Output is correct
23 Correct 2688 ms 5068 KB Output is correct
24 Correct 2661 ms 4908 KB Output is correct
25 Correct 2744 ms 5100 KB Output is correct
26 Correct 186 ms 1988 KB Output is correct
27 Correct 2079 ms 4912 KB Output is correct
28 Correct 2259 ms 4848 KB Output is correct
29 Correct 2432 ms 5156 KB Output is correct
30 Correct 2291 ms 4892 KB Output is correct
31 Correct 1654 ms 3860 KB Output is correct
32 Correct 714 ms 2488 KB Output is correct
33 Correct 1701 ms 3972 KB Output is correct
34 Correct 1600 ms 3860 KB Output is correct
35 Correct 204 ms 2000 KB Output is correct
36 Correct 1657 ms 3812 KB Output is correct
37 Correct 1609 ms 3864 KB Output is correct
38 Correct 1539 ms 3864 KB Output is correct
39 Correct 1547 ms 3992 KB Output is correct
40 Correct 1530 ms 3872 KB Output is correct
41 Correct 1402 ms 3728 KB Output is correct
42 Correct 1335 ms 3796 KB Output is correct
43 Correct 256 ms 6200 KB Output is correct
44 Correct 187 ms 1972 KB Output is correct
45 Correct 319 ms 2960 KB Output is correct
46 Correct 375 ms 2856 KB Output is correct
47 Correct 256 ms 6336 KB Output is correct
48 Correct 275 ms 6256 KB Output is correct
49 Correct 248 ms 6248 KB Output is correct
50 Correct 248 ms 4868 KB Output is correct
51 Correct 223 ms 4964 KB Output is correct
52 Correct 227 ms 4968 KB Output is correct
53 Correct 243 ms 5444 KB Output is correct
54 Correct 241 ms 5520 KB Output is correct
55 Correct 250 ms 5700 KB Output is correct
56 Correct 247 ms 6280 KB Output is correct
57 Correct 248 ms 6464 KB Output is correct
58 Correct 271 ms 6204 KB Output is correct
59 Correct 272 ms 6268 KB Output is correct
60 Correct 260 ms 6240 KB Output is correct
61 Correct 285 ms 6192 KB Output is correct
62 Correct 259 ms 5924 KB Output is correct
63 Correct 272 ms 5904 KB Output is correct
64 Correct 272 ms 6184 KB Output is correct
65 Correct 284 ms 5884 KB Output is correct
66 Correct 2405 ms 5016 KB Output is correct
67 Correct 2709 ms 4996 KB Output is correct
68 Correct 2546 ms 5036 KB Output is correct
69 Correct 2360 ms 4868 KB Output is correct
70 Correct 2616 ms 5084 KB Output is correct
71 Correct 2625 ms 4896 KB Output is correct
72 Correct 2715 ms 4880 KB Output is correct
73 Correct 2666 ms 4828 KB Output is correct
74 Correct 2555 ms 4984 KB Output is correct
75 Correct 2633 ms 5152 KB Output is correct
76 Correct 2423 ms 5148 KB Output is correct
77 Correct 2393 ms 4828 KB Output is correct
78 Correct 2356 ms 4856 KB Output is correct
79 Correct 2386 ms 4880 KB Output is correct
80 Correct 2330 ms 4900 KB Output is correct
81 Correct 2376 ms 4972 KB Output is correct
82 Correct 2092 ms 4836 KB Output is correct
83 Correct 2085 ms 4824 KB Output is correct
84 Correct 2156 ms 4784 KB Output is correct
85 Execution timed out 3063 ms 6324 KB Time limit exceeded
86 Halted 0 ms 0 KB -