Submission #462094

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
462094	2021-08-10T07:50:12 Z	armand	Connecting Supertrees (IOI20_supertrees)	C++14	21 / 100	270 ms	28016 KB

supertrees

#include "supertrees.h"
#include <vector>

int pp[1001][1001];
int n;
std::vector<std::vector<int>> answer;

bool all1()
{
	int i, j;
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			if (pp[i][j] != 1)
				return false;
	return true;
}

bool all01()
{
	int i, j;
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			if (pp[i][j] > 1)
				return false;
	return true;
}

bool all02()
{
	int i, j;
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			if (pp[i][j] != 0 && pp[i][j] != 2)
				return false;
	return true;
}

void solve1()
{
	int i;
	for (i = 0; i < n - 1; i++) {
		answer[i][i + 1] = 1;
		answer[i + 1][i] = 1;
	}
}

int color[1001];
int nodes[1001];
int nn;
bool flag2, flag3;
int nc;
void dfs(int u, int prnt)
{
	int j;
	for(j=0; j<n; j++)
		if (pp[u][j] && !color[j]) {
			nodes[nn++] = j;
			color[j] = nc;
			dfs(j, u);
		}
}

void solve2()
{
	int i, j;
	for (i = 0; i < n; i++) {
		if (!color[i]) {
			nn = 0;
			nc++;
			color[i] = nc;
			nodes[nn++] = i;
			dfs(i, -1);
			for (j = 1; j < nn; j++) {
				answer[nodes[j]][nodes[j - 1]] = 1;
				answer[nodes[j - 1]][nodes[j]] = 1;
			}
		}
	}
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++) {
			if (i == j)
				continue;
			if (color[i] == color[j] && !pp[i][j])
				flag2 = false;
		}
}

void solve3()
{
	int i, j;
	for (i = 0; i < n; i++) {
		if (!color[i]) {
			nn = 0;
			nc++;
			color[i] = nc;
			nodes[nn++] = i;
			dfs(i, -1);
			if (nn > 2) {
				for (j = 1; j < nn; j++) {
					answer[nodes[j]][nodes[j - 1]] = 1;
					answer[nodes[j - 1]][nodes[j]] = 1;
				}
				answer[nodes[0]][nodes[nn - 1]] = 1;
				answer[nodes[nn - 1]][nodes[0]] = 1;
			}
			else if (nn == 2)
				flag3 = false;
		}
	}
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++) {
			if (i == j)
				continue;
			if (color[i] == color[j] && !pp[i][j])
				flag3 = false;
		}
}

int construct(std::vector<std::vector<int>> p)
{
	n = p.size();
	int i, j;
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			pp[i][j] = p[i][j];
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}
	if (all1())
		solve1();
	else if (all01()) {
		flag2 = true;
		solve2();
		if (flag2) {
			build(answer);
			return 1;
		}
		return 0;
	}
	else if (all02()) {
		flag3 = true;
		solve3();
		if (flag3) {
			build(answer);
			return 1;
		}
		return 0;
	}
	build(answer);
	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	332 KB	Output is correct
6	Correct	10 ms	2036 KB	Output is correct
7	Correct	260 ms	27920 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	332 KB	Output is correct
6	Correct	10 ms	2036 KB	Output is correct
7	Correct	260 ms	27920 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	14 ms	1996 KB	Output is correct
13	Correct	241 ms	27904 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	5 ms	1612 KB	Output is correct
17	Correct	118 ms	18056 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	60 ms	8212 KB	Output is correct
21	Correct	255 ms	28016 KB	Output is correct
22	Correct	255 ms	27888 KB	Output is correct
23	Correct	270 ms	27816 KB	Output is correct
24	Correct	247 ms	27884 KB	Output is correct
25	Correct	114 ms	17956 KB	Output is correct
26	Correct	117 ms	17912 KB	Output is correct
27	Correct	247 ms	27952 KB	Output is correct
28	Correct	238 ms	27844 KB	Output is correct

Subtask #3
0 / 19.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Incorrect	292 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 KB	-

Subtask #4
0 / 35.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Incorrect	204 KB	Too few ways to get from 0 to 1, should be 2 found 0
3	Halted	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	332 KB	Output is correct
6	Correct	10 ms	2036 KB	Output is correct
7	Correct	260 ms	27920 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	14 ms	1996 KB	Output is correct
13	Correct	241 ms	27904 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	5 ms	1612 KB	Output is correct
17	Correct	118 ms	18056 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	60 ms	8212 KB	Output is correct
21	Correct	255 ms	28016 KB	Output is correct
22	Correct	255 ms	27888 KB	Output is correct
23	Correct	270 ms	27816 KB	Output is correct
24	Correct	247 ms	27884 KB	Output is correct
25	Correct	114 ms	17956 KB	Output is correct
26	Correct	117 ms	17912 KB	Output is correct
27	Correct	247 ms	27952 KB	Output is correct
28	Correct	238 ms	27844 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	Incorrect	0 ms	292 KB	Answer gives possible 1 while actual possible 0
33	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	332 KB	Output is correct
6	Correct	10 ms	2036 KB	Output is correct
7	Correct	260 ms	27920 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	14 ms	1996 KB	Output is correct
13	Correct	241 ms	27904 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	5 ms	1612 KB	Output is correct
17	Correct	118 ms	18056 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	60 ms	8212 KB	Output is correct
21	Correct	255 ms	28016 KB	Output is correct
22	Correct	255 ms	27888 KB	Output is correct
23	Correct	270 ms	27816 KB	Output is correct
24	Correct	247 ms	27884 KB	Output is correct
25	Correct	114 ms	17956 KB	Output is correct
26	Correct	117 ms	17912 KB	Output is correct
27	Correct	247 ms	27952 KB	Output is correct
28	Correct	238 ms	27844 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	Incorrect	0 ms	292 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Submission #462094

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