oj.uz

Submission #470489

# Submission time Handle Problem Language Result Execution time Memory
470489 2021-09-04T05:32:43 Z jazzup Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 292 ms 22180 KB 
#include "supertrees.h"
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
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]);
}

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());
		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:82:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |    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 10 ms 1172 KB Output is correct
7 Correct 249 ms 22084 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 10 ms 1172 KB Output is correct
7 Correct 249 ms 22084 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 0 ms 204 KB Output is correct
12 Correct 15 ms 1188 KB Output is correct
13 Correct 273 ms 22064 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 7 ms 716 KB Output is correct
17 Correct 120 ms 12228 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 79 ms 5688 KB Output is correct
21 Correct 292 ms 22144 KB Output is correct
22 Correct 247 ms 22084 KB Output is correct
23 Correct 274 ms 22092 KB Output is correct
24 Correct 260 ms 22180 KB Output is correct
25 Correct 119 ms 12172 KB Output is correct
26 Correct 110 ms 12184 KB Output is correct
27 Correct 274 ms 22140 KB Output is correct
28 Correct 260 ms 22152 KB Output is correct

Subtask #3
0 / 19.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 0 ms 204 KB Output is correct
5 Incorrect 1 ms 204 KB b[2][2] is not 0
6 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 Incorrect 0 ms 204 KB b[2][2] is not 0
3 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 10 ms 1172 KB Output is correct
7 Correct 249 ms 22084 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 0 ms 204 KB Output is correct
12 Correct 15 ms 1188 KB Output is correct
13 Correct 273 ms 22064 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 7 ms 716 KB Output is correct
17 Correct 120 ms 12228 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 79 ms 5688 KB Output is correct
21 Correct 292 ms 22144 KB Output is correct
22 Correct 247 ms 22084 KB Output is correct
23 Correct 274 ms 22092 KB Output is correct
24 Correct 260 ms 22180 KB Output is correct
25 Correct 119 ms 12172 KB Output is correct
26 Correct 110 ms 12184 KB Output is correct
27 Correct 274 ms 22140 KB Output is correct
28 Correct 260 ms 22152 KB Output is correct
29 Correct 1 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 0 ms 204 KB Output is correct
33 Incorrect 1 ms 204 KB b[2][2] is not 0
34 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 10 ms 1172 KB Output is correct
7 Correct 249 ms 22084 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 0 ms 204 KB Output is correct
12 Correct 15 ms 1188 KB Output is correct
13 Correct 273 ms 22064 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 7 ms 716 KB Output is correct
17 Correct 120 ms 12228 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 79 ms 5688 KB Output is correct
21 Correct 292 ms 22144 KB Output is correct
22 Correct 247 ms 22084 KB Output is correct
23 Correct 274 ms 22092 KB Output is correct
24 Correct 260 ms 22180 KB Output is correct
25 Correct 119 ms 12172 KB Output is correct
26 Correct 110 ms 12184 KB Output is correct
27 Correct 274 ms 22140 KB Output is correct
28 Correct 260 ms 22152 KB Output is correct
29 Correct 1 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 0 ms 204 KB Output is correct
33 Incorrect 1 ms 204 KB b[2][2] is not 0
34 Halted 0 ms 0 KB -