Submission #456138

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
456138	2021-08-06T07:08:48 Z	BT21tata	Connecting Supertrees (IOI20_supertrees)	C++17	21 / 100	396 ms	22028 KB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>

using namespace std;

bool used[1005];

int construct(vector<vector<int>> p)
{
	int n = p.size(), mx=0;
	bool f=1;
	vector<vector<int>> ans;
	ans.resize(n);
	for (int i = 0; i < n; i++)
	{
		ans[i].resize(n);
		for(int j=0; j<n; j++)
			mx=max(mx, p[i][j]);
	}
	vector<int>v;
	for(int i=0; i<n; i++)
	{
		if(!used[i])
		{
			v.clear();
			for(int j=0; j<n; j++)
				if(p[i][j])
				{
					if(p[i]==p[j]) v.push_back(j);
					else f=0;
				}
			for(int j=0; j<(int)v.size()-1; j++)
				ans[v[j]][v[j+1]]=ans[v[j+1]][v[j]]=1;
			if(mx==2) ans[v[0]][v[v.size()-1]]=ans[v[v.size()-1]][v[0]]=1;
		}
	}
	if(!f) return 0;
	build(ans);
	return 1;
}

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	12 ms	1164 KB	Output is correct
7	Correct	396 ms	21988 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	12 ms	1164 KB	Output is correct
7	Correct	396 ms	21988 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	9 ms	1100 KB	Output is correct
13	Correct	221 ms	22012 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	5 ms	716 KB	Output is correct
17	Correct	108 ms	12120 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	58 ms	5756 KB	Output is correct
21	Correct	250 ms	21952 KB	Output is correct
22	Correct	223 ms	22024 KB	Output is correct
23	Correct	330 ms	22028 KB	Output is correct
24	Correct	229 ms	21976 KB	Output is correct
25	Correct	125 ms	12196 KB	Output is correct
26	Correct	100 ms	12028 KB	Output is correct
27	Correct	341 ms	21992 KB	Output is correct
28	Correct	221 ms	21980 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	Incorrect	1 ms	204 KB	Answer gives possible 0 while actual possible 1
6	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Incorrect	0 ms	204 KB	Answer gives possible 0 while actual possible 1
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	12 ms	1164 KB	Output is correct
7	Correct	396 ms	21988 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	9 ms	1100 KB	Output is correct
13	Correct	221 ms	22012 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	5 ms	716 KB	Output is correct
17	Correct	108 ms	12120 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	58 ms	5756 KB	Output is correct
21	Correct	250 ms	21952 KB	Output is correct
22	Correct	223 ms	22024 KB	Output is correct
23	Correct	330 ms	22028 KB	Output is correct
24	Correct	229 ms	21976 KB	Output is correct
25	Correct	125 ms	12196 KB	Output is correct
26	Correct	100 ms	12028 KB	Output is correct
27	Correct	341 ms	21992 KB	Output is correct
28	Correct	221 ms	21980 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	Incorrect	1 ms	204 KB	Answer gives possible 0 while actual possible 1
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	12 ms	1164 KB	Output is correct
7	Correct	396 ms	21988 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	9 ms	1100 KB	Output is correct
13	Correct	221 ms	22012 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	5 ms	716 KB	Output is correct
17	Correct	108 ms	12120 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	58 ms	5756 KB	Output is correct
21	Correct	250 ms	21952 KB	Output is correct
22	Correct	223 ms	22024 KB	Output is correct
23	Correct	330 ms	22028 KB	Output is correct
24	Correct	229 ms	21976 KB	Output is correct
25	Correct	125 ms	12196 KB	Output is correct
26	Correct	100 ms	12028 KB	Output is correct
27	Correct	341 ms	21992 KB	Output is correct
28	Correct	221 ms	21980 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	Incorrect	1 ms	204 KB	Answer gives possible 0 while actual possible 1
34	Halted	0 ms	0 KB	-