oj.uz

Submission #470431

# Submission time Handle Problem Language Result Execution time Memory
470431 2021-09-03T18:05:47 Z jazzup Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 272 ms 22216 KB 
#include "supertrees.h"
#include <vector>
#include <cstdio>

using namespace std;

int par[1010];
vector<int> heads[1000];

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

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

bool c[1010];
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){

				c[findPar(i)]=true;
				c[findPar(j)]=true;

				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());
		// unique(heads[h].begin(),heads[h].end());
		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;
			}
		
			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;
	}

	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:85:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |    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 1228 KB Output is correct
7 Correct 255 ms 22104 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 1228 KB Output is correct
7 Correct 255 ms 22104 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 11 ms 1208 KB Output is correct
13 Correct 257 ms 22156 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 123 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 74 ms 5908 KB Output is correct
21 Correct 260 ms 22084 KB Output is correct
22 Correct 254 ms 22212 KB Output is correct
23 Correct 263 ms 22164 KB Output is correct
24 Correct 250 ms 22164 KB Output is correct
25 Correct 120 ms 12228 KB Output is correct
26 Correct 110 ms 12176 KB Output is correct
27 Correct 272 ms 22156 KB Output is correct
28 Correct 252 ms 22216 KB Output is correct

Subtask #3
0 / 19.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 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 220 KB Output is correct
8 Correct 12 ms 1188 KB Output is correct
9 Correct 256 ms 22152 KB Output is correct
10 Incorrect 1 ms 204 KB Too many ways to get from 0 to 3, should be 2 found no less than 3
11 Halted 0 ms 0 KB -

Subtask #4
0 / 35.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 65 ms 5772 KB Output is correct
5 Correct 259 ms 22152 KB Output is correct
6 Correct 264 ms 22084 KB Output is correct
7 Correct 263 ms 22084 KB Output is correct
8 Incorrect 0 ms 204 KB Too many ways to get from 0 to 2, should be 2 found no less than 3
9 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 1228 KB Output is correct
7 Correct 255 ms 22104 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 11 ms 1208 KB Output is correct
13 Correct 257 ms 22156 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 123 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 74 ms 5908 KB Output is correct
21 Correct 260 ms 22084 KB Output is correct
22 Correct 254 ms 22212 KB Output is correct
23 Correct 263 ms 22164 KB Output is correct
24 Correct 250 ms 22164 KB Output is correct
25 Correct 120 ms 12228 KB Output is correct
26 Correct 110 ms 12176 KB Output is correct
27 Correct 272 ms 22156 KB Output is correct
28 Correct 252 ms 22216 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 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 0 ms 204 KB Output is correct
35 Correct 0 ms 220 KB Output is correct
36 Correct 12 ms 1188 KB Output is correct
37 Correct 256 ms 22152 KB Output is correct
38 Incorrect 1 ms 204 KB Too many ways to get from 0 to 3, should be 2 found no less than 3
39 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 1228 KB Output is correct
7 Correct 255 ms 22104 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 11 ms 1208 KB Output is correct
13 Correct 257 ms 22156 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 123 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 74 ms 5908 KB Output is correct
21 Correct 260 ms 22084 KB Output is correct
22 Correct 254 ms 22212 KB Output is correct
23 Correct 263 ms 22164 KB Output is correct
24 Correct 250 ms 22164 KB Output is correct
25 Correct 120 ms 12228 KB Output is correct
26 Correct 110 ms 12176 KB Output is correct
27 Correct 272 ms 22156 KB Output is correct
28 Correct 252 ms 22216 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 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 0 ms 204 KB Output is correct
35 Correct 0 ms 220 KB Output is correct
36 Correct 12 ms 1188 KB Output is correct
37 Correct 256 ms 22152 KB Output is correct
38 Incorrect 1 ms 204 KB Too many ways to get from 0 to 3, should be 2 found no less than 3
39 Halted 0 ms 0 KB -