oj.uz

Submission #470492

# Submission time Handle Problem Language Result Execution time Memory
470492 2021-09-04T05:44:30 Z jazzup Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 350 ms 26072 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

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
6 Correct 11 ms 1216 KB Output is correct
7 Correct 253 ms 22140 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
6 Correct 11 ms 1216 KB Output is correct
7 Correct 253 ms 22140 KB Output is correct
8 Correct 0 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 0 ms 204 KB Output is correct
12 Correct 10 ms 1196 KB Output is correct
13 Correct 250 ms 22108 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 126 ms 12168 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 75 ms 5740 KB Output is correct
21 Correct 255 ms 22164 KB Output is correct
22 Correct 251 ms 22084 KB Output is correct
23 Correct 261 ms 22084 KB Output is correct
24 Correct 249 ms 22084 KB Output is correct
25 Correct 112 ms 12228 KB Output is correct
26 Correct 112 ms 12180 KB Output is correct
27 Correct 264 ms 22120 KB Output is correct
28 Correct 249 ms 22084 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 11 ms 1228 KB Output is correct
9 Correct 251 ms 22156 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 14 ms 1376 KB Output is correct
13 Correct 350 ms 26068 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 7 ms 1100 KB Output is correct
17 Correct 163 ms 16164 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 65 ms 6260 KB Output is correct
22 Correct 257 ms 24536 KB Output is correct
23 Correct 263 ms 24128 KB Output is correct
24 Correct 300 ms 26072 KB Output is correct
25 Correct 121 ms 14148 KB Output is correct
26 Correct 123 ms 14852 KB Output is correct
27 Correct 251 ms 24080 KB Output is correct
28 Correct 296 ms 26028 KB Output is correct
29 Correct 111 ms 14212 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 63 ms 5740 KB Output is correct
5 Correct 276 ms 22068 KB Output is correct
6 Correct 262 ms 22156 KB Output is correct
7 Correct 258 ms 22120 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 64 ms 6264 KB Output is correct
10 Correct 263 ms 24500 KB Output is correct
11 Correct 260 ms 24072 KB Output is correct
12 Correct 289 ms 26036 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 256 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

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
6 Correct 11 ms 1216 KB Output is correct
7 Correct 253 ms 22140 KB Output is correct
8 Correct 0 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 0 ms 204 KB Output is correct
12 Correct 10 ms 1196 KB Output is correct
13 Correct 250 ms 22108 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 126 ms 12168 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 75 ms 5740 KB Output is correct
21 Correct 255 ms 22164 KB Output is correct
22 Correct 251 ms 22084 KB Output is correct
23 Correct 261 ms 22084 KB Output is correct
24 Correct 249 ms 22084 KB Output is correct
25 Correct 112 ms 12228 KB Output is correct
26 Correct 112 ms 12180 KB Output is correct
27 Correct 264 ms 22120 KB Output is correct
28 Correct 249 ms 22084 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 11 ms 1228 KB Output is correct
37 Correct 251 ms 22156 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 14 ms 1376 KB Output is correct
41 Correct 350 ms 26068 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 7 ms 1100 KB Output is correct
45 Correct 163 ms 16164 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 65 ms 6260 KB Output is correct
50 Correct 257 ms 24536 KB Output is correct
51 Correct 263 ms 24128 KB Output is correct
52 Correct 300 ms 26072 KB Output is correct
53 Correct 121 ms 14148 KB Output is correct
54 Correct 123 ms 14852 KB Output is correct
55 Correct 251 ms 24080 KB Output is correct
56 Correct 296 ms 26028 KB Output is correct
57 Correct 111 ms 14212 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 7 ms 972 KB Output is correct
61 Correct 168 ms 16376 KB Output is correct
62 Correct 0 ms 308 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Incorrect 63 ms 6268 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

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
6 Correct 11 ms 1216 KB Output is correct
7 Correct 253 ms 22140 KB Output is correct
8 Correct 0 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 0 ms 204 KB Output is correct
12 Correct 10 ms 1196 KB Output is correct
13 Correct 250 ms 22108 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 126 ms 12168 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 75 ms 5740 KB Output is correct
21 Correct 255 ms 22164 KB Output is correct
22 Correct 251 ms 22084 KB Output is correct
23 Correct 261 ms 22084 KB Output is correct
24 Correct 249 ms 22084 KB Output is correct
25 Correct 112 ms 12228 KB Output is correct
26 Correct 112 ms 12180 KB Output is correct
27 Correct 264 ms 22120 KB Output is correct
28 Correct 249 ms 22084 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 11 ms 1228 KB Output is correct
37 Correct 251 ms 22156 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 14 ms 1376 KB Output is correct
41 Correct 350 ms 26068 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 7 ms 1100 KB Output is correct
45 Correct 163 ms 16164 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 65 ms 6260 KB Output is correct
50 Correct 257 ms 24536 KB Output is correct
51 Correct 263 ms 24128 KB Output is correct
52 Correct 300 ms 26072 KB Output is correct
53 Correct 121 ms 14148 KB Output is correct
54 Correct 123 ms 14852 KB Output is correct
55 Correct 251 ms 24080 KB Output is correct
56 Correct 296 ms 26028 KB Output is correct
57 Correct 111 ms 14212 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 63 ms 5740 KB Output is correct
62 Correct 276 ms 22068 KB Output is correct
63 Correct 262 ms 22156 KB Output is correct
64 Correct 258 ms 22120 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 64 ms 6264 KB Output is correct
67 Correct 263 ms 24500 KB Output is correct
68 Correct 260 ms 24072 KB Output is correct
69 Correct 289 ms 26036 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Correct 1 ms 256 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 -