oj.uz

답안 #470956

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
470956 2021-09-06T11:49:49 Z jazzup 슈퍼트리 잇기 (IOI20_supertrees) C++14
40 / 100
 311 ms 28012 KB 
#include "supertrees.h"
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
using namespace std;

int par[1010];
vector<int> heads[1000];
vector<int>::iterator it;

int findPar(int n){
	if(par[n]==n)return n;

	return par[n]=findPar(par[n]);
}

vector<vector<int> > answer;

int construct(vector<vector<int> > p) {
	int n = p.size();
	for(int i=0;i<=n;i++){
		par[i]=i;
	}
	
	

	for(int i=0;i<n;i++){
		vector<int> vv;
		answer.push_back(vv);
		for(int j=0;j<n;j++){
			answer[i].push_back(0);
		}
	}

	for(int i=0;i<n-1;i++){
		for(int j=i+1;j<n;j++){
			if(p[i][j]!=p[j][i])return 0;
		}
	}
	
	for(int i=0;i<n-1;i++){
		for(int j=i+1;j<n;j++){
			if(p[i][j]==3)return 0;

			if(p[i][j]==1){
				if(findPar(i)<findPar(j)){
					par[findPar(j)]=findPar(i);
					answer[j][findPar(j)]=1;
					answer[findPar(j)][j]=1;
				}
				else if(findPar(i)>findPar(j)){
					par[findPar(i)]=findPar(j);
					answer[i][findPar(i)]=1;
					answer[findPar(i)][i]=1;
				}
			}
		}
	}

	for(int i=0;i<n-1;i++){
		for(int j=i+1;j<n;j++){
			// if(i==j)continue;
			if(p[i][j]==2){

				if(findPar(i)<findPar(j)){
					par[findPar(j)]=findPar(i);
				}
				else if(findPar(i)>findPar(j)){
					par[findPar(i)]=findPar(j);
				}
 
				heads[findPar(i)].push_back(i);
				heads[findPar(j)].push_back(j);
			}
		}
	}

	for(int h=0;h<n;h++){
		sort(heads[h].begin(),heads[h].end());
		it=unique(heads[h].begin(),heads[h].end());
		heads[h].resize(distance(heads[h].begin(),it));
		if(!heads[h].empty()){
			for(int i=0;i<heads[h].size()-1;i++){
				answer[heads[h][i]][heads[h][i+1]]=1;
				answer[heads[h][i+1]][heads[h][i]]=1;
				// printf("%d ",heads[h][i]);
			}

		
			answer[heads[h][heads[h].size()-1]][heads[h][0]]=1;
			answer[heads[h][0]][heads[h][heads[h].size()-1]]=1;
		}

		if(heads[h].size()==2)return 0;
		// printf("\n");

	}

	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(i==j)continue;
			else if(p[i][j]==0){
				if(findPar(i)==findPar(j)){
					return 0;
				}
			}
		}
	}

	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:84:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |    for(int i=0;i<heads[h].size()-1;i++){
      |                ~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1296 KB Output is correct
7 Correct 255 ms 24056 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1296 KB Output is correct
7 Correct 255 ms 24056 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 12 ms 1228 KB Output is correct
13 Correct 254 ms 24068 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 124 ms 14204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 65 ms 6264 KB Output is correct
21 Correct 256 ms 24008 KB Output is correct
22 Correct 261 ms 24004 KB Output is correct
23 Correct 271 ms 24124 KB Output is correct
24 Correct 292 ms 24036 KB Output is correct
25 Correct 118 ms 14204 KB Output is correct
26 Correct 115 ms 14200 KB Output is correct
27 Correct 267 ms 24068 KB Output is correct
28 Correct 255 ms 24004 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 11 ms 1248 KB Output is correct
9 Correct 258 ms 24004 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 13 ms 1472 KB Output is correct
13 Correct 311 ms 28012 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 7 ms 1100 KB Output is correct
17 Correct 171 ms 16372 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 65 ms 6268 KB Output is correct
22 Correct 261 ms 24540 KB Output is correct
23 Correct 254 ms 24076 KB Output is correct
24 Correct 298 ms 25996 KB Output is correct
25 Correct 125 ms 14148 KB Output is correct
26 Correct 123 ms 14732 KB Output is correct
27 Correct 279 ms 24080 KB Output is correct
28 Correct 286 ms 26028 KB Output is correct
29 Correct 117 ms 14200 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 66 ms 6280 KB Output is correct
5 Correct 255 ms 24072 KB Output is correct
6 Correct 258 ms 24064 KB Output is correct
7 Correct 262 ms 24112 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 64 ms 6292 KB Output is correct
10 Correct 258 ms 24516 KB Output is correct
11 Correct 257 ms 24108 KB Output is correct
12 Correct 292 ms 25996 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Incorrect 0 ms 204 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1296 KB Output is correct
7 Correct 255 ms 24056 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 12 ms 1228 KB Output is correct
13 Correct 254 ms 24068 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 124 ms 14204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 65 ms 6264 KB Output is correct
21 Correct 256 ms 24008 KB Output is correct
22 Correct 261 ms 24004 KB Output is correct
23 Correct 271 ms 24124 KB Output is correct
24 Correct 292 ms 24036 KB Output is correct
25 Correct 118 ms 14204 KB Output is correct
26 Correct 115 ms 14200 KB Output is correct
27 Correct 267 ms 24068 KB Output is correct
28 Correct 255 ms 24004 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 308 KB Output is correct
35 Correct 1 ms 312 KB Output is correct
36 Correct 11 ms 1248 KB Output is correct
37 Correct 258 ms 24004 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 13 ms 1472 KB Output is correct
41 Correct 311 ms 28012 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 7 ms 1100 KB Output is correct
45 Correct 171 ms 16372 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 65 ms 6268 KB Output is correct
50 Correct 261 ms 24540 KB Output is correct
51 Correct 254 ms 24076 KB Output is correct
52 Correct 298 ms 25996 KB Output is correct
53 Correct 125 ms 14148 KB Output is correct
54 Correct 123 ms 14732 KB Output is correct
55 Correct 279 ms 24080 KB Output is correct
56 Correct 286 ms 26028 KB Output is correct
57 Correct 117 ms 14200 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 304 KB Output is correct
60 Correct 6 ms 956 KB Output is correct
61 Correct 148 ms 16380 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Incorrect 64 ms 6220 KB Too many ways to get from 1 to 183, should be 1 found no less than 2
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1296 KB Output is correct
7 Correct 255 ms 24056 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 12 ms 1228 KB Output is correct
13 Correct 254 ms 24068 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 124 ms 14204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 65 ms 6264 KB Output is correct
21 Correct 256 ms 24008 KB Output is correct
22 Correct 261 ms 24004 KB Output is correct
23 Correct 271 ms 24124 KB Output is correct
24 Correct 292 ms 24036 KB Output is correct
25 Correct 118 ms 14204 KB Output is correct
26 Correct 115 ms 14200 KB Output is correct
27 Correct 267 ms 24068 KB Output is correct
28 Correct 255 ms 24004 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 308 KB Output is correct
35 Correct 1 ms 312 KB Output is correct
36 Correct 11 ms 1248 KB Output is correct
37 Correct 258 ms 24004 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 13 ms 1472 KB Output is correct
41 Correct 311 ms 28012 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 7 ms 1100 KB Output is correct
45 Correct 171 ms 16372 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 65 ms 6268 KB Output is correct
50 Correct 261 ms 24540 KB Output is correct
51 Correct 254 ms 24076 KB Output is correct
52 Correct 298 ms 25996 KB Output is correct
53 Correct 125 ms 14148 KB Output is correct
54 Correct 123 ms 14732 KB Output is correct
55 Correct 279 ms 24080 KB Output is correct
56 Correct 286 ms 26028 KB Output is correct
57 Correct 117 ms 14200 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 308 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 66 ms 6280 KB Output is correct
62 Correct 255 ms 24072 KB Output is correct
63 Correct 258 ms 24064 KB Output is correct
64 Correct 262 ms 24112 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 64 ms 6292 KB Output is correct
67 Correct 258 ms 24516 KB Output is correct
68 Correct 257 ms 24108 KB Output is correct
69 Correct 292 ms 25996 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Incorrect 0 ms 204 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
73 Halted 0 ms 0 KB -