oj.uz

답안 #559553

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
559553 2022-05-10T07:16:56 Z mosiashvililuka Simurgh (IOI17_simurgh) C++14
51 / 100
 164 ms 14252 KB 
#include<bits/stdc++.h>
#include "simurgh.h"
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,msh[200009],E,BO[200009],ans[200009],Q[200009],QI,W[200009],WI,p[200009],pi,dep[200009],O[503][503],st;
pair <int, int> P[200009];
vector <int> v[200009],xe,vv[200009],VV;
int fnd(int q){
	if(msh[q]==0) return q; else return msh[q]=fnd(msh[q]);
}
bool mrg(int q, int w){
	q=fnd(q);w=fnd(w);
	if(q==w) return 0;
	msh[q]=w;
	return 1;
}
void dfs(int q, int w){
	msh[q]=w;dep[q]=dep[w]+1;
	for(vector <int>::iterator it=vv[q].begin(); it!=vv[q].end(); it++){
		if((*it)==w) continue;
		dfs((*it),q);
	}
}
vector<int> find_roads(int Nn, std::vector<int> Uu, std::vector<int> Vv) {
	//int common = count_common_roads(r);
	a=Nn;b=Uu.size();
	for(i=0; i<Uu.size(); i++){
		P[i]={Uu[i]+1,Vv[i]+1};
		v[P[i].first].push_back(P[i].second);v[P[i].second].push_back(P[i].first);
		O[P[i].first][P[i].second]=O[P[i].second][P[i].first]=i;
	}
	for(i=0; i<b; i++){
		E=mrg(P[i].first,P[i].second);
		if(E==1){
			xe.push_back(i);BO[i]=1;
			vv[P[i].first].push_back(P[i].second);vv[P[i].second].push_back(P[i].first);
		}
	}
	st=count_common_roads(xe);
	for(i=0; i<b; i++) ans[i]=2;
	dfs(1,0);
	for(ii=0; ii<b; ii++){
		if(BO[ii]==0){
			QI=0;WI=0;pi=0;
			c=P[ii].first;d=P[ii].second;
			while(c!=d){
				if(dep[c]>=dep[d]){
					QI++;Q[QI]=c;c=msh[c];
				}else{
					WI++;W[WI]=d;d=msh[d];
				}
			}
			QI++;Q[QI]=c;
			for(i=1; i<=QI; i++){
				pi++;p[pi]=Q[i];
			}
			for(i=WI; i>=1; i--){
				pi++;p[pi]=W[i];
			}
			QI=0;
			for(i=1; i<pi; i++){
				c=O[p[i]][p[i+1]];
				if(ans[c]==2){
					QI++;Q[QI]=c;
				}
			}
			E=0;
			for(i=1; i<pi; i++){
				c=O[p[i]][p[i+1]];
				if(ans[c]!=2){
					QI++;Q[QI]=c;E=ans[c];break;
				}
			}
			if(QI==0){
				QI++;Q[QI]=O[p[1]][p[2]];
			}
			WI=0;
			for(i=1; i<=QI; i++){
				VV.clear();
				for(j=0; j<xe.size(); j++){
					if(xe[j]!=Q[i]){
						VV.push_back(xe[j]);
					}
				}
				VV.push_back(ii);
				WI++;W[WI]=count_common_roads(VV);
			}
			WI++;W[WI]=st;zx=0;xc=a+4;Q[WI]=ii;
			for(i=1; i<=WI; i++){
				zx=max(zx,W[i]);xc=min(xc,W[i]);
			}
			for(i=1; i<=WI; i++){
				if(zx==xc){
					ans[Q[i]]=E;
					//cout<<Q[i]<<" "<<E<<"\n";
					continue;
				}
				if(W[i]==zx){
					//cout<<Q[i]<<" 0\n";
					ans[Q[i]]=0;
				}else{
					//cout<<Q[i]<<" 1\n";
					ans[Q[i]]=1;
				}
			}
		}
	}
	for(ii=0; ii<b; ii++){
		if(BO[ii]==1){
			if(ans[ii]==2) ans[ii]=1;
		}
	}
	VV.clear();
	for(ii=0; ii<b; ii++){
		if(ans[ii]==1) VV.push_back(ii);
	}
	/*for(ii=0; ii<b; ii++){
		cout<<ans[ii]<<" ";
	}
	cout<<"\n";*/
	return VV;
}

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:26:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |  for(i=0; i<Uu.size(); i++){
      |           ~^~~~~~~~~~
simurgh.cpp:79:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |     for(j=0; j<xe.size(); j++){
      |              ~^~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB correct
2 Correct 5 ms 9684 KB correct
3 Correct 5 ms 9740 KB correct
4 Correct 5 ms 9684 KB correct
5 Correct 5 ms 9704 KB correct
6 Correct 5 ms 9696 KB correct
7 Correct 5 ms 9684 KB correct
8 Correct 5 ms 9704 KB correct
9 Correct 5 ms 9684 KB correct
10 Correct 5 ms 9684 KB correct
11 Correct 5 ms 9684 KB correct
12 Correct 5 ms 9684 KB correct
13 Correct 6 ms 9684 KB correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB correct
2 Correct 5 ms 9684 KB correct
3 Correct 5 ms 9740 KB correct
4 Correct 5 ms 9684 KB correct
5 Correct 5 ms 9704 KB correct
6 Correct 5 ms 9696 KB correct
7 Correct 5 ms 9684 KB correct
8 Correct 5 ms 9704 KB correct
9 Correct 5 ms 9684 KB correct
10 Correct 5 ms 9684 KB correct
11 Correct 5 ms 9684 KB correct
12 Correct 5 ms 9684 KB correct
13 Correct 6 ms 9684 KB correct
14 Correct 7 ms 9812 KB correct
15 Correct 7 ms 9836 KB correct
16 Correct 7 ms 9940 KB correct
17 Correct 7 ms 9836 KB correct
18 Correct 6 ms 9812 KB correct
19 Correct 6 ms 9812 KB correct
20 Correct 7 ms 9836 KB correct
21 Correct 6 ms 9864 KB correct
22 Correct 7 ms 9812 KB correct
23 Correct 6 ms 9812 KB correct
24 Correct 6 ms 9812 KB correct
25 Correct 5 ms 9828 KB correct
26 Correct 6 ms 9812 KB correct
27 Correct 7 ms 9812 KB correct
28 Correct 6 ms 9812 KB correct
29 Correct 6 ms 9832 KB correct
30 Correct 6 ms 9812 KB correct
31 Correct 6 ms 9796 KB correct
32 Correct 7 ms 9836 KB correct
33 Correct 6 ms 9836 KB correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB correct
2 Correct 5 ms 9684 KB correct
3 Correct 5 ms 9740 KB correct
4 Correct 5 ms 9684 KB correct
5 Correct 5 ms 9704 KB correct
6 Correct 5 ms 9696 KB correct
7 Correct 5 ms 9684 KB correct
8 Correct 5 ms 9704 KB correct
9 Correct 5 ms 9684 KB correct
10 Correct 5 ms 9684 KB correct
11 Correct 5 ms 9684 KB correct
12 Correct 5 ms 9684 KB correct
13 Correct 6 ms 9684 KB correct
14 Correct 7 ms 9812 KB correct
15 Correct 7 ms 9836 KB correct
16 Correct 7 ms 9940 KB correct
17 Correct 7 ms 9836 KB correct
18 Correct 6 ms 9812 KB correct
19 Correct 6 ms 9812 KB correct
20 Correct 7 ms 9836 KB correct
21 Correct 6 ms 9864 KB correct
22 Correct 7 ms 9812 KB correct
23 Correct 6 ms 9812 KB correct
24 Correct 6 ms 9812 KB correct
25 Correct 5 ms 9828 KB correct
26 Correct 6 ms 9812 KB correct
27 Correct 7 ms 9812 KB correct
28 Correct 6 ms 9812 KB correct
29 Correct 6 ms 9832 KB correct
30 Correct 6 ms 9812 KB correct
31 Correct 6 ms 9796 KB correct
32 Correct 7 ms 9836 KB correct
33 Correct 6 ms 9836 KB correct
34 Correct 164 ms 11500 KB correct
35 Correct 159 ms 11376 KB correct
36 Correct 112 ms 11160 KB correct
37 Correct 12 ms 10288 KB correct
38 Correct 159 ms 11476 KB correct
39 Correct 141 ms 11352 KB correct
40 Correct 109 ms 11092 KB correct
41 Correct 160 ms 11476 KB correct
42 Correct 161 ms 11496 KB correct
43 Correct 84 ms 10964 KB correct
44 Correct 70 ms 10800 KB correct
45 Correct 85 ms 10868 KB correct
46 Correct 66 ms 10744 KB correct
47 Correct 30 ms 10480 KB correct
48 Correct 7 ms 10264 KB correct
49 Correct 12 ms 10224 KB correct
50 Correct 31 ms 10484 KB correct
51 Correct 82 ms 10856 KB correct
52 Correct 70 ms 10708 KB correct
53 Correct 63 ms 10708 KB correct
54 Correct 85 ms 10964 KB correct
55 Correct 76 ms 10868 KB correct
56 Correct 75 ms 10864 KB correct
57 Correct 74 ms 10836 KB correct

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9704 KB correct
2 Correct 5 ms 9684 KB correct
3 Incorrect 135 ms 14252 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB correct
2 Correct 5 ms 9684 KB correct
3 Correct 5 ms 9740 KB correct
4 Correct 5 ms 9684 KB correct
5 Correct 5 ms 9704 KB correct
6 Correct 5 ms 9696 KB correct
7 Correct 5 ms 9684 KB correct
8 Correct 5 ms 9704 KB correct
9 Correct 5 ms 9684 KB correct
10 Correct 5 ms 9684 KB correct
11 Correct 5 ms 9684 KB correct
12 Correct 5 ms 9684 KB correct
13 Correct 6 ms 9684 KB correct
14 Correct 7 ms 9812 KB correct
15 Correct 7 ms 9836 KB correct
16 Correct 7 ms 9940 KB correct
17 Correct 7 ms 9836 KB correct
18 Correct 6 ms 9812 KB correct
19 Correct 6 ms 9812 KB correct
20 Correct 7 ms 9836 KB correct
21 Correct 6 ms 9864 KB correct
22 Correct 7 ms 9812 KB correct
23 Correct 6 ms 9812 KB correct
24 Correct 6 ms 9812 KB correct
25 Correct 5 ms 9828 KB correct
26 Correct 6 ms 9812 KB correct
27 Correct 7 ms 9812 KB correct
28 Correct 6 ms 9812 KB correct
29 Correct 6 ms 9832 KB correct
30 Correct 6 ms 9812 KB correct
31 Correct 6 ms 9796 KB correct
32 Correct 7 ms 9836 KB correct
33 Correct 6 ms 9836 KB correct
34 Correct 164 ms 11500 KB correct
35 Correct 159 ms 11376 KB correct
36 Correct 112 ms 11160 KB correct
37 Correct 12 ms 10288 KB correct
38 Correct 159 ms 11476 KB correct
39 Correct 141 ms 11352 KB correct
40 Correct 109 ms 11092 KB correct
41 Correct 160 ms 11476 KB correct
42 Correct 161 ms 11496 KB correct
43 Correct 84 ms 10964 KB correct
44 Correct 70 ms 10800 KB correct
45 Correct 85 ms 10868 KB correct
46 Correct 66 ms 10744 KB correct
47 Correct 30 ms 10480 KB correct
48 Correct 7 ms 10264 KB correct
49 Correct 12 ms 10224 KB correct
50 Correct 31 ms 10484 KB correct
51 Correct 82 ms 10856 KB correct
52 Correct 70 ms 10708 KB correct
53 Correct 63 ms 10708 KB correct
54 Correct 85 ms 10964 KB correct
55 Correct 76 ms 10868 KB correct
56 Correct 75 ms 10864 KB correct
57 Correct 74 ms 10836 KB correct
58 Correct 5 ms 9704 KB correct
59 Correct 5 ms 9684 KB correct
60 Incorrect 135 ms 14252 KB WA in grader: NO
61 Halted 0 ms 0 KB -