Submission #470425

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
470425	2021-09-03T17:33:20 Z	jazzup	Connecting Supertrees (IOI20_supertrees)	C++14	21 / 100	293 ms	22144 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]!=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);
				}
			}
		}
	}

	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:83:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |   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	1212 KB	Output is correct
7	Correct	249 ms	22144 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	1212 KB	Output is correct
7	Correct	249 ms	22144 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	13 ms	1196 KB	Output is correct
13	Correct	246 ms	22140 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	716 KB	Output is correct
17	Correct	121 ms	12156 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	70 ms	5744 KB	Output is correct
21	Correct	248 ms	22132 KB	Output is correct
22	Correct	245 ms	22084 KB	Output is correct
23	Correct	293 ms	22092 KB	Output is correct
24	Correct	267 ms	22084 KB	Output is correct
25	Correct	112 ms	12148 KB	Output is correct
26	Correct	107 ms	12160 KB	Output is correct
27	Correct	270 ms	22040 KB	Output is correct
28	Correct	253 ms	22140 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	1 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	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	11 ms	1220 KB	Output is correct
9	Correct	246 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	11 ms	1100 KB	Output is correct
13	Correct	273 ms	22080 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	844 KB	Output is correct
17	Correct	126 ms	14196 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	284 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Incorrect	63 ms	6184 KB	Too many ways to get from 0 to 1, should be 0 found no less than 1
22	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	5704 KB	Output is correct
5	Correct	253 ms	22144 KB	Output is correct
6	Correct	279 ms	22132 KB	Output is correct
7	Correct	263 ms	22136 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Incorrect	62 ms	5712 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	1212 KB	Output is correct
7	Correct	249 ms	22144 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	13 ms	1196 KB	Output is correct
13	Correct	246 ms	22140 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	716 KB	Output is correct
17	Correct	121 ms	12156 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	70 ms	5744 KB	Output is correct
21	Correct	248 ms	22132 KB	Output is correct
22	Correct	245 ms	22084 KB	Output is correct
23	Correct	293 ms	22092 KB	Output is correct
24	Correct	267 ms	22084 KB	Output is correct
25	Correct	112 ms	12148 KB	Output is correct
26	Correct	107 ms	12160 KB	Output is correct
27	Correct	270 ms	22040 KB	Output is correct
28	Correct	253 ms	22140 KB	Output is correct
29	Correct	0 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	1 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	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	11 ms	1220 KB	Output is correct
37	Correct	246 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	11 ms	1100 KB	Output is correct
41	Correct	273 ms	22080 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	5 ms	844 KB	Output is correct
45	Correct	126 ms	14196 KB	Output is correct
46	Correct	0 ms	204 KB	Output is correct
47	Correct	0 ms	284 KB	Output is correct
48	Correct	0 ms	204 KB	Output is correct
49	Incorrect	63 ms	6184 KB	Too many ways to get from 0 to 1, should be 0 found no less than 1
50	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	1212 KB	Output is correct
7	Correct	249 ms	22144 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	13 ms	1196 KB	Output is correct
13	Correct	246 ms	22140 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	716 KB	Output is correct
17	Correct	121 ms	12156 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	70 ms	5744 KB	Output is correct
21	Correct	248 ms	22132 KB	Output is correct
22	Correct	245 ms	22084 KB	Output is correct
23	Correct	293 ms	22092 KB	Output is correct
24	Correct	267 ms	22084 KB	Output is correct
25	Correct	112 ms	12148 KB	Output is correct
26	Correct	107 ms	12160 KB	Output is correct
27	Correct	270 ms	22040 KB	Output is correct
28	Correct	253 ms	22140 KB	Output is correct
29	Correct	0 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	1 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	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	11 ms	1220 KB	Output is correct
37	Correct	246 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	11 ms	1100 KB	Output is correct
41	Correct	273 ms	22080 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	5 ms	844 KB	Output is correct
45	Correct	126 ms	14196 KB	Output is correct
46	Correct	0 ms	204 KB	Output is correct
47	Correct	0 ms	284 KB	Output is correct
48	Correct	0 ms	204 KB	Output is correct
49	Incorrect	63 ms	6184 KB	Too many ways to get from 0 to 1, should be 0 found no less than 1
50	Halted	0 ms	0 KB	-

Submission #470425

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0