oj.uz

Submission #470418

# Submission time Handle Problem Language Result Execution time Memory
470418 2021-09-03T17:23:10 Z jazzup Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 297 ms 22212 KB 
#include "supertrees.h"
#include <vector>
#include <cstdio>

using namespace std;

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

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[j]=findPar(i);
					answer[j][par[j]]=1;
					answer[par[j]][j]=1;
				}
				else if(findPar(i)>findPar(j)){
					par[i]=findPar(j);
					answer[i][par[i]]=1;
					answer[par[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)){
					return 0;
				}

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

			else if(p[i][j]==0){
				if(findPar(i)==findPar(j)){
					return 0;
				}
			}
		}
	}

	for(int i=0;i<n;i++){
		if(c[i])heads.push_back(i);
	}

	if(!heads.empty()){
		for(int i=0;i<heads.size()-1;i++){
			answer[heads[i]][heads[i+1]]=1;
			answer[heads[i+1]][heads[i]]=1;
		}
	
		answer[heads[heads.size()-1]][heads[0]]=1;
		answer[heads[0]][heads[heads.size()-1]]=1;
	}

	if(heads.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:16: 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.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 1220 KB Output is correct
7 Correct 269 ms 22076 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 1220 KB Output is correct
7 Correct 269 ms 22076 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 1 ms 204 KB Output is correct
12 Correct 11 ms 1204 KB Output is correct
13 Correct 260 ms 22132 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 736 KB Output is correct
17 Correct 120 ms 12160 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 82 ms 5700 KB Output is correct
21 Correct 271 ms 22084 KB Output is correct
22 Correct 264 ms 22088 KB Output is correct
23 Correct 269 ms 22212 KB Output is correct
24 Correct 256 ms 22084 KB Output is correct
25 Correct 114 ms 12144 KB Output is correct
26 Correct 116 ms 12160 KB Output is correct
27 Correct 297 ms 22092 KB Output is correct
28 Correct 257 ms 22084 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 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 11 ms 1196 KB Output is correct
9 Correct 258 ms 22136 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 1228 KB Output is correct
13 Correct 256 ms 22140 KB Output is correct
14 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
15 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 69 ms 5716 KB Output is correct
5 Correct 262 ms 22140 KB Output is correct
6 Correct 286 ms 22084 KB Output is correct
7 Correct 271 ms 22152 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Incorrect 76 ms 5744 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
10 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 1220 KB Output is correct
7 Correct 269 ms 22076 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 1 ms 204 KB Output is correct
12 Correct 11 ms 1204 KB Output is correct
13 Correct 260 ms 22132 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 736 KB Output is correct
17 Correct 120 ms 12160 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 82 ms 5700 KB Output is correct
21 Correct 271 ms 22084 KB Output is correct
22 Correct 264 ms 22088 KB Output is correct
23 Correct 269 ms 22212 KB Output is correct
24 Correct 256 ms 22084 KB Output is correct
25 Correct 114 ms 12144 KB Output is correct
26 Correct 116 ms 12160 KB Output is correct
27 Correct 297 ms 22092 KB Output is correct
28 Correct 257 ms 22084 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 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 11 ms 1196 KB Output is correct
37 Correct 258 ms 22136 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 1228 KB Output is correct
41 Correct 256 ms 22140 KB Output is correct
42 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
43 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 1220 KB Output is correct
7 Correct 269 ms 22076 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 1 ms 204 KB Output is correct
12 Correct 11 ms 1204 KB Output is correct
13 Correct 260 ms 22132 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 736 KB Output is correct
17 Correct 120 ms 12160 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 82 ms 5700 KB Output is correct
21 Correct 271 ms 22084 KB Output is correct
22 Correct 264 ms 22088 KB Output is correct
23 Correct 269 ms 22212 KB Output is correct
24 Correct 256 ms 22084 KB Output is correct
25 Correct 114 ms 12144 KB Output is correct
26 Correct 116 ms 12160 KB Output is correct
27 Correct 297 ms 22092 KB Output is correct
28 Correct 257 ms 22084 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 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 11 ms 1196 KB Output is correct
37 Correct 258 ms 22136 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 1228 KB Output is correct
41 Correct 256 ms 22140 KB Output is correct
42 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -