oj.uz

Submission #1087750

# Submission time Handle Problem Language Result Execution time Memory
1087750 2024-09-13T07:47:15 Z T0p_ Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 141 ms 24404 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 1000;

bool is_add[N];
int tree_parent[N], circular_parent[N];

int find_tree_parent(int u) {
	return tree_parent[u] = (u == tree_parent[u])
		? u
		: find_tree_parent(tree_parent[u]); 
}

int find_circular_parent(int u) {
	return circular_parent[u] = (u == circular_parent[u])
		? u
		: find_circular_parent(circular_parent[u]); 
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> ans(n, vector<int>(n));

	for (int i=0 ; i<n ; i++) {
		for (int j=0 ; j<n ; j++) {
			if (p[i][j] == 3) {
				return 0;
			}
		}
	}

	for (int i=0 ; i<n ; i++) {
		tree_parent[i] = i;
		circular_parent[i] = i;
	}

	for (int i=0 ; i<n ; i++) {
		for (int j=i+1 ; j<n ; j++) {
			if (p[i][j] == 1) {
				int ii = find_tree_parent(i);
				int jj = find_tree_parent(j);

				if (ii != jj) {
					tree_parent[ii] = jj;
					ans[i][j] = ans[j][i] = 1;
				}
			}
		}
	}

	for (int i=0 ; i<n ; i++) {
		for (int j=i+1 ; j<n ; j++) {
			int ii = find_tree_parent(i);
			int jj = find_tree_parent(j);

			if (p[i][j] != 1 && ii == jj) {
				return 0;
			}
		}
	}

	for (int i=0 ; i<n ; i++) {
		for (int j=i+1 ; j<n ; j++) {
			if (p[i][j] == 2) {
				int ii = find_circular_parent(find_tree_parent(i));
				int jj = find_circular_parent(find_tree_parent(j));

				circular_parent[ii] = jj;
			}
		}
	}

	vector<int> group[N];
	for (int i=0 ; i<n ; i++) {
		int tree_i = find_tree_parent(i);

		if (is_add[tree_i]) continue;
		is_add[tree_i] = true;

		int circular_i = find_circular_parent(tree_i);
		group[circular_i].push_back(tree_i);
	}

	for (int i=0 ; i<N ; i++) {

		int sz = group[i].size();

		if (sz <= 1) {
			continue;
		}
		else if (sz == 2) {
			return 0;
		}
		else {
			for (int j=0 ; j<sz-1 ; j++) {
				ans[group[i][j]][group[i][j+1]] = ans[group[i][j+1]][group[i][j]] = 1;
			}
			ans[group[i][0]][group[i][sz-1]] = ans[group[i][sz-1]][group[i][0]] = 1;
		}
	}

	for (int i=0 ; i<n ; i++) {
		for (int j=i+1 ; j<n ; j++) {
			int tree_i = find_tree_parent(i);
			int tree_j = find_tree_parent(j);
			int circular_i = find_circular_parent(tree_i);
			int circular_j = find_circular_parent(tree_j);

			if (p[i][j] != 2 && circular_i == circular_j && tree_i != tree_j) {
				return 0;
			}
		}
	}

	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 123 ms 23928 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 123 ms 23928 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1420 KB Output is correct
13 Correct 120 ms 24148 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 59 ms 14076 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 436 KB Output is correct
20 Correct 30 ms 6224 KB Output is correct
21 Correct 125 ms 24148 KB Output is correct
22 Correct 119 ms 23928 KB Output is correct
23 Correct 126 ms 24148 KB Output is correct
24 Correct 130 ms 24060 KB Output is correct
25 Correct 50 ms 14164 KB Output is correct
26 Correct 52 ms 14160 KB Output is correct
27 Correct 141 ms 24144 KB Output is correct
28 Correct 116 ms 24144 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 1372 KB Output is correct
9 Correct 135 ms 24152 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 440 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 121 ms 24160 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 61 ms 14264 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 436 KB Output is correct
21 Correct 30 ms 6372 KB Output is correct
22 Correct 126 ms 23948 KB Output is correct
23 Correct 117 ms 23932 KB Output is correct
24 Correct 129 ms 24148 KB Output is correct
25 Correct 54 ms 14160 KB Output is correct
26 Correct 53 ms 14212 KB Output is correct
27 Correct 135 ms 24144 KB Output is correct
28 Correct 137 ms 23992 KB Output is correct
29 Correct 54 ms 14220 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 30 ms 6252 KB Output is correct
5 Correct 121 ms 24068 KB Output is correct
6 Correct 119 ms 24144 KB Output is correct
7 Correct 130 ms 24144 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 31 ms 6316 KB Output is correct
10 Correct 126 ms 23944 KB Output is correct
11 Correct 132 ms 24148 KB Output is correct
12 Correct 136 ms 23936 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 32 ms 6272 KB Output is correct
17 Correct 124 ms 24148 KB Output is correct
18 Correct 131 ms 24144 KB Output is correct
19 Correct 141 ms 24148 KB Output is correct
20 Correct 123 ms 24404 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 123 ms 23928 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1420 KB Output is correct
13 Correct 120 ms 24148 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 59 ms 14076 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 436 KB Output is correct
20 Correct 30 ms 6224 KB Output is correct
21 Correct 125 ms 24148 KB Output is correct
22 Correct 119 ms 23928 KB Output is correct
23 Correct 126 ms 24148 KB Output is correct
24 Correct 130 ms 24060 KB Output is correct
25 Correct 50 ms 14164 KB Output is correct
26 Correct 52 ms 14160 KB Output is correct
27 Correct 141 ms 24144 KB Output is correct
28 Correct 116 ms 24144 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 436 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 5 ms 1372 KB Output is correct
37 Correct 135 ms 24152 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 440 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 121 ms 24160 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 61 ms 14264 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 436 KB Output is correct
49 Correct 30 ms 6372 KB Output is correct
50 Correct 126 ms 23948 KB Output is correct
51 Correct 117 ms 23932 KB Output is correct
52 Correct 129 ms 24148 KB Output is correct
53 Correct 54 ms 14160 KB Output is correct
54 Correct 53 ms 14212 KB Output is correct
55 Correct 135 ms 24144 KB Output is correct
56 Correct 137 ms 23992 KB Output is correct
57 Correct 54 ms 14220 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 60 ms 14164 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 444 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 40 ms 6568 KB Output is correct
66 Correct 57 ms 14160 KB Output is correct
67 Correct 54 ms 14160 KB Output is correct
68 Correct 53 ms 14160 KB Output is correct
69 Correct 50 ms 14416 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 123 ms 23928 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1420 KB Output is correct
13 Correct 120 ms 24148 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 59 ms 14076 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 436 KB Output is correct
20 Correct 30 ms 6224 KB Output is correct
21 Correct 125 ms 24148 KB Output is correct
22 Correct 119 ms 23928 KB Output is correct
23 Correct 126 ms 24148 KB Output is correct
24 Correct 130 ms 24060 KB Output is correct
25 Correct 50 ms 14164 KB Output is correct
26 Correct 52 ms 14160 KB Output is correct
27 Correct 141 ms 24144 KB Output is correct
28 Correct 116 ms 24144 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 436 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 5 ms 1372 KB Output is correct
37 Correct 135 ms 24152 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 440 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 121 ms 24160 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 61 ms 14264 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 436 KB Output is correct
49 Correct 30 ms 6372 KB Output is correct
50 Correct 126 ms 23948 KB Output is correct
51 Correct 117 ms 23932 KB Output is correct
52 Correct 129 ms 24148 KB Output is correct
53 Correct 54 ms 14160 KB Output is correct
54 Correct 53 ms 14212 KB Output is correct
55 Correct 135 ms 24144 KB Output is correct
56 Correct 137 ms 23992 KB Output is correct
57 Correct 54 ms 14220 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 432 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 30 ms 6252 KB Output is correct
62 Correct 121 ms 24068 KB Output is correct
63 Correct 119 ms 24144 KB Output is correct
64 Correct 130 ms 24144 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 31 ms 6316 KB Output is correct
67 Correct 126 ms 23944 KB Output is correct
68 Correct 132 ms 24148 KB Output is correct
69 Correct 136 ms 23936 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 1 ms 344 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 32 ms 6272 KB Output is correct
74 Correct 124 ms 24148 KB Output is correct
75 Correct 131 ms 24144 KB Output is correct
76 Correct 141 ms 24148 KB Output is correct
77 Correct 123 ms 24404 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 60 ms 14164 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 444 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 40 ms 6568 KB Output is correct
86 Correct 57 ms 14160 KB Output is correct
87 Correct 54 ms 14160 KB Output is correct
88 Correct 53 ms 14160 KB Output is correct
89 Correct 50 ms 14416 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 2 ms 860 KB Output is correct
93 Correct 52 ms 14164 KB Output is correct
94 Correct 1 ms 344 KB Output is correct
95 Correct 0 ms 344 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 13 ms 3932 KB Output is correct
98 Correct 51 ms 14220 KB Output is correct
99 Correct 56 ms 14252 KB Output is correct
100 Correct 48 ms 14092 KB Output is correct
101 Correct 49 ms 14088 KB Output is correct
102 Correct 50 ms 14160 KB Output is correct
103 Correct 49 ms 14160 KB Output is correct
104 Correct 56 ms 14212 KB Output is correct
105 Correct 59 ms 14164 KB Output is correct