oj.uz

답안 #398599

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
398599 2021-05-04T15:17:55 Z mosiashvililuka 다리 (APIO19_bridges) C++14
59 / 100
 3000 ms 5564 KB 
#include<bits/stdc++.h>
using namespace std;
const int T=450;
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){
      |        ~~~~~~~~^~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 356 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 33 ms 536 KB Output is correct
4 Correct 33 ms 516 KB Output is correct
5 Correct 31 ms 524 KB Output is correct
6 Correct 31 ms 504 KB Output is correct
7 Correct 34 ms 520 KB Output is correct
8 Correct 34 ms 524 KB Output is correct
9 Correct 38 ms 460 KB Output is correct
10 Correct 38 ms 460 KB Output is correct
11 Correct 34 ms 460 KB Output is correct
12 Correct 42 ms 512 KB Output is correct
13 Correct 43 ms 460 KB Output is correct
14 Correct 38 ms 460 KB Output is correct
15 Correct 35 ms 520 KB Output is correct
16 Correct 35 ms 460 KB Output is correct
17 Correct 40 ms 520 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2249 ms 4856 KB Output is correct
2 Correct 2233 ms 4772 KB Output is correct
3 Correct 2162 ms 4744 KB Output is correct
4 Correct 2234 ms 4872 KB Output is correct
5 Correct 2266 ms 4808 KB Output is correct
6 Correct 2631 ms 4972 KB Output is correct
7 Correct 2766 ms 4972 KB Output is correct
8 Correct 2717 ms 4944 KB Output is correct
9 Correct 333 ms 2084 KB Output is correct
10 Correct 2095 ms 5000 KB Output is correct
11 Correct 2083 ms 4904 KB Output is correct
12 Correct 2147 ms 5160 KB Output is correct
13 Correct 1938 ms 4856 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1542 ms 3748 KB Output is correct
2 Correct 870 ms 2492 KB Output is correct
3 Correct 1717 ms 3856 KB Output is correct
4 Correct 1617 ms 3888 KB Output is correct
5 Correct 334 ms 2028 KB Output is correct
6 Correct 1653 ms 3872 KB Output is correct
7 Correct 1495 ms 3864 KB Output is correct
8 Correct 1476 ms 3856 KB Output is correct
9 Correct 1464 ms 3996 KB Output is correct
10 Correct 1447 ms 3996 KB Output is correct
11 Correct 1215 ms 3728 KB Output is correct
12 Correct 1163 ms 3792 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3070 ms 5564 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2249 ms 4856 KB Output is correct
2 Correct 2233 ms 4772 KB Output is correct
3 Correct 2162 ms 4744 KB Output is correct
4 Correct 2234 ms 4872 KB Output is correct
5 Correct 2266 ms 4808 KB Output is correct
6 Correct 2631 ms 4972 KB Output is correct
7 Correct 2766 ms 4972 KB Output is correct
8 Correct 2717 ms 4944 KB Output is correct
9 Correct 333 ms 2084 KB Output is correct
10 Correct 2095 ms 5000 KB Output is correct
11 Correct 2083 ms 4904 KB Output is correct
12 Correct 2147 ms 5160 KB Output is correct
13 Correct 1938 ms 4856 KB Output is correct
14 Correct 1542 ms 3748 KB Output is correct
15 Correct 870 ms 2492 KB Output is correct
16 Correct 1717 ms 3856 KB Output is correct
17 Correct 1617 ms 3888 KB Output is correct
18 Correct 334 ms 2028 KB Output is correct
19 Correct 1653 ms 3872 KB Output is correct
20 Correct 1495 ms 3864 KB Output is correct
21 Correct 1476 ms 3856 KB Output is correct
22 Correct 1464 ms 3996 KB Output is correct
23 Correct 1447 ms 3996 KB Output is correct
24 Correct 1215 ms 3728 KB Output is correct
25 Correct 1163 ms 3792 KB Output is correct
26 Correct 2193 ms 4744 KB Output is correct
27 Correct 2479 ms 4824 KB Output is correct
28 Correct 2380 ms 5024 KB Output is correct
29 Correct 2004 ms 4728 KB Output is correct
30 Correct 2508 ms 4788 KB Output is correct
31 Correct 2436 ms 4796 KB Output is correct
32 Correct 2455 ms 4864 KB Output is correct
33 Correct 2270 ms 4904 KB Output is correct
34 Correct 2323 ms 4904 KB Output is correct
35 Correct 2259 ms 4768 KB Output is correct
36 Correct 2021 ms 4788 KB Output is correct
37 Correct 2058 ms 4712 KB Output is correct
38 Correct 2045 ms 4876 KB Output is correct
39 Correct 2043 ms 4952 KB Output is correct
40 Correct 1974 ms 4856 KB Output is correct
41 Correct 1991 ms 5024 KB Output is correct
42 Correct 1685 ms 4880 KB Output is correct
43 Correct 1690 ms 4768 KB Output is correct
44 Correct 1692 ms 4716 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 356 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 33 ms 536 KB Output is correct
4 Correct 33 ms 516 KB Output is correct
5 Correct 31 ms 524 KB Output is correct
6 Correct 31 ms 504 KB Output is correct
7 Correct 34 ms 520 KB Output is correct
8 Correct 34 ms 524 KB Output is correct
9 Correct 38 ms 460 KB Output is correct
10 Correct 38 ms 460 KB Output is correct
11 Correct 34 ms 460 KB Output is correct
12 Correct 42 ms 512 KB Output is correct
13 Correct 43 ms 460 KB Output is correct
14 Correct 38 ms 460 KB Output is correct
15 Correct 35 ms 520 KB Output is correct
16 Correct 35 ms 460 KB Output is correct
17 Correct 40 ms 520 KB Output is correct
18 Correct 2249 ms 4856 KB Output is correct
19 Correct 2233 ms 4772 KB Output is correct
20 Correct 2162 ms 4744 KB Output is correct
21 Correct 2234 ms 4872 KB Output is correct
22 Correct 2266 ms 4808 KB Output is correct
23 Correct 2631 ms 4972 KB Output is correct
24 Correct 2766 ms 4972 KB Output is correct
25 Correct 2717 ms 4944 KB Output is correct
26 Correct 333 ms 2084 KB Output is correct
27 Correct 2095 ms 5000 KB Output is correct
28 Correct 2083 ms 4904 KB Output is correct
29 Correct 2147 ms 5160 KB Output is correct
30 Correct 1938 ms 4856 KB Output is correct
31 Correct 1542 ms 3748 KB Output is correct
32 Correct 870 ms 2492 KB Output is correct
33 Correct 1717 ms 3856 KB Output is correct
34 Correct 1617 ms 3888 KB Output is correct
35 Correct 334 ms 2028 KB Output is correct
36 Correct 1653 ms 3872 KB Output is correct
37 Correct 1495 ms 3864 KB Output is correct
38 Correct 1476 ms 3856 KB Output is correct
39 Correct 1464 ms 3996 KB Output is correct
40 Correct 1447 ms 3996 KB Output is correct
41 Correct 1215 ms 3728 KB Output is correct
42 Correct 1163 ms 3792 KB Output is correct
43 Execution timed out 3070 ms 5564 KB Time limit exceeded
44 Halted 0 ms 0 KB -