oj.uz

Submission #462210

# Submission time Handle Problem Language Result Execution time Memory
462210 2021-08-10T08:44:25 Z armand Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 276 ms 28016 KB 
#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 (i == j)
				continue;
			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 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 11 ms 2016 KB Output is correct
7 Correct 238 ms 26572 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 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 11 ms 2016 KB Output is correct
7 Correct 238 ms 26572 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 12 ms 1996 KB Output is correct
13 Correct 276 ms 26632 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 7 ms 1612 KB Output is correct
17 Correct 120 ms 16692 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 61 ms 8172 KB Output is correct
21 Correct 243 ms 26540 KB Output is correct
22 Correct 249 ms 26536 KB Output is correct
23 Correct 261 ms 26624 KB Output is correct
24 Correct 249 ms 26564 KB Output is correct
25 Correct 148 ms 16648 KB Output is correct
26 Correct 109 ms 16632 KB Output is correct
27 Correct 243 ms 26560 KB Output is correct
28 Correct 244 ms 26564 KB Output is correct

Subtask #3
19.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 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 12 ms 2008 KB Output is correct
9 Correct 251 ms 27864 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 11 ms 1972 KB Output is correct
13 Correct 237 ms 27896 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 6 ms 1612 KB Output is correct
17 Correct 120 ms 18032 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 60 ms 8184 KB Output is correct
22 Correct 241 ms 27868 KB Output is correct
23 Correct 239 ms 27816 KB Output is correct
24 Correct 250 ms 27960 KB Output is correct
25 Correct 108 ms 17908 KB Output is correct
26 Correct 111 ms 17912 KB Output is correct
27 Correct 236 ms 27904 KB Output is correct
28 Correct 257 ms 27976 KB Output is correct
29 Correct 114 ms 17988 KB Output is correct

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 62 ms 8180 KB Output is correct
5 Correct 245 ms 27884 KB Output is correct
6 Correct 235 ms 27920 KB Output is correct
7 Correct 245 ms 27844 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 62 ms 8120 KB Output is correct
10 Correct 265 ms 27836 KB Output is correct
11 Correct 269 ms 27860 KB Output is correct
12 Correct 246 ms 28016 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Incorrect 1 ms 292 KB Too few ways to get from 0 to 1, should be 2 found 0
15 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 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 11 ms 2016 KB Output is correct
7 Correct 238 ms 26572 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 12 ms 1996 KB Output is correct
13 Correct 276 ms 26632 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 7 ms 1612 KB Output is correct
17 Correct 120 ms 16692 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 61 ms 8172 KB Output is correct
21 Correct 243 ms 26540 KB Output is correct
22 Correct 249 ms 26536 KB Output is correct
23 Correct 261 ms 26624 KB Output is correct
24 Correct 249 ms 26564 KB Output is correct
25 Correct 148 ms 16648 KB Output is correct
26 Correct 109 ms 16632 KB Output is correct
27 Correct 243 ms 26560 KB Output is correct
28 Correct 244 ms 26564 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 0 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 12 ms 2008 KB Output is correct
37 Correct 251 ms 27864 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 11 ms 1972 KB Output is correct
41 Correct 237 ms 27896 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 6 ms 1612 KB Output is correct
45 Correct 120 ms 18032 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 60 ms 8184 KB Output is correct
50 Correct 241 ms 27868 KB Output is correct
51 Correct 239 ms 27816 KB Output is correct
52 Correct 250 ms 27960 KB Output is correct
53 Correct 108 ms 17908 KB Output is correct
54 Correct 111 ms 17912 KB Output is correct
55 Correct 236 ms 27904 KB Output is correct
56 Correct 257 ms 27976 KB Output is correct
57 Correct 114 ms 17988 KB Output is correct
58 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
59 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 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 11 ms 2016 KB Output is correct
7 Correct 238 ms 26572 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 12 ms 1996 KB Output is correct
13 Correct 276 ms 26632 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 7 ms 1612 KB Output is correct
17 Correct 120 ms 16692 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 61 ms 8172 KB Output is correct
21 Correct 243 ms 26540 KB Output is correct
22 Correct 249 ms 26536 KB Output is correct
23 Correct 261 ms 26624 KB Output is correct
24 Correct 249 ms 26564 KB Output is correct
25 Correct 148 ms 16648 KB Output is correct
26 Correct 109 ms 16632 KB Output is correct
27 Correct 243 ms 26560 KB Output is correct
28 Correct 244 ms 26564 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 0 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 12 ms 2008 KB Output is correct
37 Correct 251 ms 27864 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 11 ms 1972 KB Output is correct
41 Correct 237 ms 27896 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 6 ms 1612 KB Output is correct
45 Correct 120 ms 18032 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 60 ms 8184 KB Output is correct
50 Correct 241 ms 27868 KB Output is correct
51 Correct 239 ms 27816 KB Output is correct
52 Correct 250 ms 27960 KB Output is correct
53 Correct 108 ms 17908 KB Output is correct
54 Correct 111 ms 17912 KB Output is correct
55 Correct 236 ms 27904 KB Output is correct
56 Correct 257 ms 27976 KB Output is correct
57 Correct 114 ms 17988 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 62 ms 8180 KB Output is correct
62 Correct 245 ms 27884 KB Output is correct
63 Correct 235 ms 27920 KB Output is correct
64 Correct 245 ms 27844 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 62 ms 8120 KB Output is correct
67 Correct 265 ms 27836 KB Output is correct
68 Correct 269 ms 27860 KB Output is correct
69 Correct 246 ms 28016 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Incorrect 1 ms 292 KB Too few ways to get from 0 to 1, should be 2 found 0
72 Halted 0 ms 0 KB -