Submission #470342

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
470342	2021-09-03T14:29:42 Z	jazzup	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	271 ms	24132 KB

supertrees

#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]==3)return 0;

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

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

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

	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;
	}
	
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:65:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   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	1228 KB	Output is correct
7	Correct	262 ms	24048 KB	Output is correct

Subtask #2

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	262 ms	24048 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	248 KB	Output is correct
12	Correct	11 ms	1228 KB	Output is correct
13	Correct	245 ms	24044 KB	Output is correct
14	Incorrect	1 ms	204 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #3

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	Incorrect	0 ms	204 KB	Answer gives possible 1 while actual possible 0
5	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	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	64 ms	6216 KB	Output is correct
5	Correct	269 ms	23980 KB	Output is correct
6	Correct	271 ms	24004 KB	Output is correct
7	Correct	259 ms	24132 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Incorrect	63 ms	6236 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	1228 KB	Output is correct
7	Correct	262 ms	24048 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	248 KB	Output is correct
12	Correct	11 ms	1228 KB	Output is correct
13	Correct	245 ms	24044 KB	Output is correct
14	Incorrect	1 ms	204 KB	Answer gives possible 1 while actual possible 0
15	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	262 ms	24048 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	248 KB	Output is correct
12	Correct	11 ms	1228 KB	Output is correct
13	Correct	245 ms	24044 KB	Output is correct
14	Incorrect	1 ms	204 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-