oj.uz

Submission #366933

# Submission time Handle Problem Language Result Execution time Memory
366933 2021-02-15T18:41:39 Z BlancaHM Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 285 ms 24300 KB 
#include <iostream>
#include <vector>
#include <unordered_map>
#include "supertrees.h"
using namespace std;

int raiz(int a, vector<int> & padre) {
    if (padre[a] == a) return a;
    return padre[a] = raiz(padre[a], padre);
}

void unirConjuntos(int a, int b, vector<int> & padre, vector<int> & alturaAprox, int & numeroConjuntos) {
    int raiz_a, raiz_b;
    raiz_a = raiz(a, padre);
    raiz_b = raiz(b, padre);
    if (raiz_a == raiz_b) return;
    numeroConjuntos--;
    if (alturaAprox[raiz_a] > alturaAprox[raiz_b]) {
        padre[raiz_b] = raiz_a;
    } else if (alturaAprox[raiz_b] > alturaAprox[raiz_a]) {
        padre[raiz_a] = raiz_b;
    } else {
        padre[raiz_a] = raiz_b;
        alturaAprox[raiz_b]++;
    }
}

int construct(vector<vector<int>> p) {
	int N = (int) p.size(), numCCs = N;
	vector<int> padre(N), alturaAprox(N, 0);

	for (int i = 0; i < N; i++)
		padre[i] = i;

	for (int i = 0; i < N; i++) {
		for (int j = i+1; j < N; j++) {
			if (p[i][j]) {
				if (p[i][j] == 3) {
					return 0;
				}
				unirConjuntos(i, j, padre, alturaAprox, numCCs);
			} else if (raiz(i, padre) == raiz(j, padre))
				return 0;
		}
	}
	unordered_map<int, int> roots;
	int c = 0;
	for (int i = 0; i < N; i++) {
		if (padre[i] == i)
			roots[i] = c++;
	}

	vector<vector<int>> CCs(numCCs);
	for (int i = 0; i < N; i++)
		CCs[roots[raiz(i, padre)]].push_back(i);

	int CCsize, u, v, n, root_u, root_v;

	vector<vector<int>> result(N, vector<int>(N, 0)), oneTails;

	for (int i = 0; i < numCCs; i++) {
		CCsize = (int) CCs[i].size();
		if (CCsize == 1) continue;

		// encontramos las "serpientes" de esta componente conexa
		n = CCsize;
		for (auto node: CCs[i]) {
			padre[node] = node;
			alturaAprox[node] = 0;
		}
		for (int j = 0; j < CCsize; j++) {
			u = CCs[i][j];
			root_u = raiz(u, padre);
			for (int k = j+1; k < CCsize; k++) {
				v = CCs[i][k];
				if (p[u][v] == 1)
					unirConjuntos(u, v, padre, alturaAprox, n);
				else if (root_u == raiz(v, padre))
					return 0;
			}
		}

		// nos aseguramos de que no hay incongruencias en esta componente conexa
		if (n == 2) return 0;

		roots.clear();
		c = 0;
		for (int j = 0; j < CCsize; j++) {
			u = CCs[i][j];
			root_u = raiz(u, padre);
			if (root_u == u)
				roots[u] = c++;
			for (int k = j+1; k < CCsize; k++) {
				v = CCs[i][k];
				root_v = raiz(v, padre);
				if (root_u != root_v) {
					if (p[u][v] != 2) {
						return 0;
					}
				} else if (p[u][v] != 1) {
					return 0;
				}
			}
		}
		// conectar los elementos dentro de una serpiente
		oneTails = vector<vector<int>>(n);
		for (int j = 0; j < CCsize; j++)
			oneTails[roots[raiz(CCs[i][j], padre)]].push_back(CCs[i][j]);
		for (int j = 0; j < n; j++) {
			for (int k = 0; k < (int) oneTails[j].size() - 1; k++)
				result[oneTails[j][k]][oneTails[j][k+1]] = result[oneTails[j][k+1]][oneTails[j][k]] = 1;
		}

		// conectar el ciclo de cabezas de serpiente
		for (int j = 0; j < n-1; j++)
			result[oneTails[j][0]][oneTails[j+1][0]] = result[oneTails[j+1][0]][oneTails[j][0]] = 1;

		if (n > 1)
			result[oneTails[0][0]][oneTails[n-1][0]] = result[oneTails[n-1][0]][oneTails[0][0]] = 1;
	}
	build(result);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 266 ms 24044 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 266 ms 24044 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 14 ms 1388 KB Output is correct
13 Correct 246 ms 24172 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 109 ms 10192 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 65 ms 6380 KB Output is correct
21 Correct 254 ms 24044 KB Output is correct
22 Correct 252 ms 24144 KB Output is correct
23 Correct 261 ms 24044 KB Output is correct
24 Correct 256 ms 24144 KB Output is correct
25 Correct 108 ms 10220 KB Output is correct
26 Correct 107 ms 10348 KB Output is correct
27 Correct 264 ms 24044 KB Output is correct
28 Correct 261 ms 24172 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 11 ms 1260 KB Output is correct
9 Correct 271 ms 24172 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 254 ms 24172 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 112 ms 10192 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 62 ms 6380 KB Output is correct
22 Correct 249 ms 24172 KB Output is correct
23 Correct 253 ms 24044 KB Output is correct
24 Correct 285 ms 24068 KB Output is correct
25 Correct 106 ms 14316 KB Output is correct
26 Correct 107 ms 10220 KB Output is correct
27 Correct 247 ms 24044 KB Output is correct
28 Correct 260 ms 24192 KB Output is correct
29 Correct 107 ms 14188 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 62 ms 6508 KB Output is correct
5 Correct 276 ms 24044 KB Output is correct
6 Correct 248 ms 24144 KB Output is correct
7 Correct 270 ms 24172 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 71 ms 6380 KB Output is correct
10 Correct 252 ms 24300 KB Output is correct
11 Correct 252 ms 24044 KB Output is correct
12 Correct 258 ms 24172 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 73 ms 6392 KB Output is correct
17 Correct 260 ms 24044 KB Output is correct
18 Correct 257 ms 24172 KB Output is correct
19 Correct 249 ms 24044 KB Output is correct
20 Correct 251 ms 24172 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 266 ms 24044 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 14 ms 1388 KB Output is correct
13 Correct 246 ms 24172 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 109 ms 10192 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 65 ms 6380 KB Output is correct
21 Correct 254 ms 24044 KB Output is correct
22 Correct 252 ms 24144 KB Output is correct
23 Correct 261 ms 24044 KB Output is correct
24 Correct 256 ms 24144 KB Output is correct
25 Correct 108 ms 10220 KB Output is correct
26 Correct 107 ms 10348 KB Output is correct
27 Correct 264 ms 24044 KB Output is correct
28 Correct 261 ms 24172 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 271 ms 24172 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1260 KB Output is correct
41 Correct 254 ms 24172 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 5 ms 748 KB Output is correct
45 Correct 112 ms 10192 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 62 ms 6380 KB Output is correct
50 Correct 249 ms 24172 KB Output is correct
51 Correct 253 ms 24044 KB Output is correct
52 Correct 285 ms 24068 KB Output is correct
53 Correct 106 ms 14316 KB Output is correct
54 Correct 107 ms 10220 KB Output is correct
55 Correct 247 ms 24044 KB Output is correct
56 Correct 260 ms 24192 KB Output is correct
57 Correct 107 ms 14188 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 5 ms 748 KB Output is correct
61 Correct 110 ms 10220 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 78 ms 6380 KB Output is correct
66 Correct 106 ms 10220 KB Output is correct
67 Correct 108 ms 10220 KB Output is correct
68 Correct 106 ms 10220 KB Output is correct
69 Correct 108 ms 14288 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 266 ms 24044 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 14 ms 1388 KB Output is correct
13 Correct 246 ms 24172 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 109 ms 10192 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 65 ms 6380 KB Output is correct
21 Correct 254 ms 24044 KB Output is correct
22 Correct 252 ms 24144 KB Output is correct
23 Correct 261 ms 24044 KB Output is correct
24 Correct 256 ms 24144 KB Output is correct
25 Correct 108 ms 10220 KB Output is correct
26 Correct 107 ms 10348 KB Output is correct
27 Correct 264 ms 24044 KB Output is correct
28 Correct 261 ms 24172 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 271 ms 24172 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1260 KB Output is correct
41 Correct 254 ms 24172 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 5 ms 748 KB Output is correct
45 Correct 112 ms 10192 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 62 ms 6380 KB Output is correct
50 Correct 249 ms 24172 KB Output is correct
51 Correct 253 ms 24044 KB Output is correct
52 Correct 285 ms 24068 KB Output is correct
53 Correct 106 ms 14316 KB Output is correct
54 Correct 107 ms 10220 KB Output is correct
55 Correct 247 ms 24044 KB Output is correct
56 Correct 260 ms 24192 KB Output is correct
57 Correct 107 ms 14188 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 62 ms 6508 KB Output is correct
62 Correct 276 ms 24044 KB Output is correct
63 Correct 248 ms 24144 KB Output is correct
64 Correct 270 ms 24172 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 71 ms 6380 KB Output is correct
67 Correct 252 ms 24300 KB Output is correct
68 Correct 252 ms 24044 KB Output is correct
69 Correct 258 ms 24172 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 73 ms 6392 KB Output is correct
74 Correct 260 ms 24044 KB Output is correct
75 Correct 257 ms 24172 KB Output is correct
76 Correct 249 ms 24044 KB Output is correct
77 Correct 251 ms 24172 KB Output is correct
78 Correct 1 ms 364 KB Output is correct
79 Correct 1 ms 364 KB Output is correct
80 Correct 5 ms 748 KB Output is correct
81 Correct 110 ms 10220 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 78 ms 6380 KB Output is correct
86 Correct 106 ms 10220 KB Output is correct
87 Correct 108 ms 10220 KB Output is correct
88 Correct 106 ms 10220 KB Output is correct
89 Correct 108 ms 14288 KB Output is correct
90 Correct 0 ms 364 KB Output is correct
91 Correct 1 ms 364 KB Output is correct
92 Correct 5 ms 748 KB Output is correct
93 Correct 106 ms 10220 KB Output is correct
94 Correct 1 ms 364 KB Output is correct
95 Correct 1 ms 364 KB Output is correct
96 Correct 1 ms 364 KB Output is correct
97 Correct 26 ms 2924 KB Output is correct
98 Correct 106 ms 10220 KB Output is correct
99 Correct 104 ms 10400 KB Output is correct
100 Correct 105 ms 10220 KB Output is correct
101 Correct 102 ms 10220 KB Output is correct
102 Correct 103 ms 10220 KB Output is correct
103 Correct 103 ms 10220 KB Output is correct
104 Correct 103 ms 10220 KB Output is correct
105 Correct 109 ms 10220 KB Output is correct