oj.uz

Submission #580640

# Submission time Handle Problem Language Result Execution time Memory
580640 2022-06-21T14:49:03 Z joelau Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 307 ms 22172 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

int N,ufds[1005], rnk[1005], ufds2[1005], rnk2[1005];
vector<int> lst[1005];

int findSet(int i) {
	return ufds[i] == i ? i : ufds[i] = findSet(ufds[i]);
}

void unionSet(int i, int j) {
	int a = findSet(i), b = findSet(j);
	if (a == b) return;
	if (rnk[a] < rnk[b]) ufds[a] = b;
	if (rnk[a] > rnk[b]) ufds[b] = a;
	if (rnk[a] == rnk[b]) ufds[a] = b, rnk[b]++;
}

int findSet2(int i) {
	return ufds2[i] == i ? i : ufds2[i] = findSet2(ufds2[i]);
}

void unionSet2(int i, int j) {
	int a = findSet2(i), b = findSet2(j);
	if (a == b) return;
	if (rnk2[a] < rnk2[b]) ufds2[a] = b;
	if (rnk2[a] > rnk2[b]) ufds2[b] = a;
	if (rnk2[a] == rnk2[b]) ufds2[a] = b, rnk2[b]++;
}

int construct(vector<vector<int>> p) {
	N = p.size();
	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) ufds[i] = i, rnk[i] = 1, ufds2[i] = i, rnk2[i] = 1;
	for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) if (p[i][j] == 1) unionSet(i,j);
	for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) if (p[i][j] == 0 && findSet(i) == findSet(j)) return 0;
	vector< vector<int> > ans (N, vector<int>(N,0));
	for (int i = 0; i < N; ++i) if (findSet(i) != i) ans[i][findSet(i)] = ans[findSet(i)][i] = 1;
	for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) if (p[i][j] == 2) unionSet2(findSet(i),findSet(j));
	for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) if (p[i][j] == 0 && findSet2(findSet(i)) == findSet2(findSet(j))) return 0;
	for (int i = 0; i < N; ++i) if (findSet(i) == i) lst[findSet2(i)].push_back(i);
	for (int i = 0; i < N; ++i) {
		if (lst[i].size() == 2) return 0;
		if (lst[i].size() >= 3) {
			for (int j = 1; j < lst[i].size(); ++j) ans[lst[i][j-1]][lst[i][j]] = ans[lst[i][j]][lst[i][j-1]] = 1;
			ans[lst[i].front()][lst[i].back()] = ans[lst[i].back()][lst[i].front()] = 1;
		}
	}
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:46:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |    for (int j = 1; j < lst[i].size(); ++j) ans[lst[i][j-1]][lst[i][j]] = ans[lst[i][j]][lst[i][j-1]] = 1;
      |                    ~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 14 ms 1108 KB Output is correct
7 Correct 195 ms 22052 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 14 ms 1108 KB Output is correct
7 Correct 195 ms 22052 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 11 ms 1108 KB Output is correct
13 Correct 212 ms 22104 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 5 ms 596 KB Output is correct
17 Correct 118 ms 8108 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 56 ms 5800 KB Output is correct
21 Correct 248 ms 22032 KB Output is correct
22 Correct 215 ms 21980 KB Output is correct
23 Correct 249 ms 22036 KB Output is correct
24 Correct 307 ms 22032 KB Output is correct
25 Correct 78 ms 8100 KB Output is correct
26 Correct 73 ms 8140 KB Output is correct
27 Correct 205 ms 22056 KB Output is correct
28 Correct 207 ms 21992 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 13 ms 1236 KB Output is correct
9 Correct 213 ms 22012 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 9 ms 1108 KB Output is correct
13 Correct 191 ms 22032 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 99 ms 12072 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 60 ms 5740 KB Output is correct
22 Correct 202 ms 22028 KB Output is correct
23 Correct 194 ms 21984 KB Output is correct
24 Correct 207 ms 22048 KB Output is correct
25 Correct 91 ms 12196 KB Output is correct
26 Correct 85 ms 12064 KB Output is correct
27 Correct 285 ms 22052 KB Output is correct
28 Correct 215 ms 22064 KB Output is correct
29 Correct 88 ms 12192 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 51 ms 5756 KB Output is correct
5 Correct 220 ms 22172 KB Output is correct
6 Correct 221 ms 22012 KB Output is correct
7 Correct 211 ms 22172 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 55 ms 5776 KB Output is correct
10 Correct 199 ms 22044 KB Output is correct
11 Correct 195 ms 22064 KB Output is correct
12 Correct 208 ms 22064 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 54 ms 5788 KB Output is correct
17 Correct 190 ms 22056 KB Output is correct
18 Correct 202 ms 22044 KB Output is correct
19 Correct 203 ms 22060 KB Output is correct
20 Correct 204 ms 22016 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 14 ms 1108 KB Output is correct
7 Correct 195 ms 22052 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 11 ms 1108 KB Output is correct
13 Correct 212 ms 22104 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 5 ms 596 KB Output is correct
17 Correct 118 ms 8108 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 56 ms 5800 KB Output is correct
21 Correct 248 ms 22032 KB Output is correct
22 Correct 215 ms 21980 KB Output is correct
23 Correct 249 ms 22036 KB Output is correct
24 Correct 307 ms 22032 KB Output is correct
25 Correct 78 ms 8100 KB Output is correct
26 Correct 73 ms 8140 KB Output is correct
27 Correct 205 ms 22056 KB Output is correct
28 Correct 207 ms 21992 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 13 ms 1236 KB Output is correct
37 Correct 213 ms 22012 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 9 ms 1108 KB Output is correct
41 Correct 191 ms 22032 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 5 ms 724 KB Output is correct
45 Correct 99 ms 12072 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 60 ms 5740 KB Output is correct
50 Correct 202 ms 22028 KB Output is correct
51 Correct 194 ms 21984 KB Output is correct
52 Correct 207 ms 22048 KB Output is correct
53 Correct 91 ms 12196 KB Output is correct
54 Correct 85 ms 12064 KB Output is correct
55 Correct 285 ms 22052 KB Output is correct
56 Correct 215 ms 22064 KB Output is correct
57 Correct 88 ms 12192 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 4 ms 596 KB Output is correct
61 Correct 87 ms 8108 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 0 ms 340 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 52 ms 5724 KB Output is correct
66 Correct 83 ms 12068 KB Output is correct
67 Correct 74 ms 8100 KB Output is correct
68 Correct 104 ms 12060 KB Output is correct
69 Correct 92 ms 12188 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 14 ms 1108 KB Output is correct
7 Correct 195 ms 22052 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 11 ms 1108 KB Output is correct
13 Correct 212 ms 22104 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 5 ms 596 KB Output is correct
17 Correct 118 ms 8108 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 56 ms 5800 KB Output is correct
21 Correct 248 ms 22032 KB Output is correct
22 Correct 215 ms 21980 KB Output is correct
23 Correct 249 ms 22036 KB Output is correct
24 Correct 307 ms 22032 KB Output is correct
25 Correct 78 ms 8100 KB Output is correct
26 Correct 73 ms 8140 KB Output is correct
27 Correct 205 ms 22056 KB Output is correct
28 Correct 207 ms 21992 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 13 ms 1236 KB Output is correct
37 Correct 213 ms 22012 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 9 ms 1108 KB Output is correct
41 Correct 191 ms 22032 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 5 ms 724 KB Output is correct
45 Correct 99 ms 12072 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 60 ms 5740 KB Output is correct
50 Correct 202 ms 22028 KB Output is correct
51 Correct 194 ms 21984 KB Output is correct
52 Correct 207 ms 22048 KB Output is correct
53 Correct 91 ms 12196 KB Output is correct
54 Correct 85 ms 12064 KB Output is correct
55 Correct 285 ms 22052 KB Output is correct
56 Correct 215 ms 22064 KB Output is correct
57 Correct 88 ms 12192 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 51 ms 5756 KB Output is correct
62 Correct 220 ms 22172 KB Output is correct
63 Correct 221 ms 22012 KB Output is correct
64 Correct 211 ms 22172 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 55 ms 5776 KB Output is correct
67 Correct 199 ms 22044 KB Output is correct
68 Correct 195 ms 22064 KB Output is correct
69 Correct 208 ms 22064 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 54 ms 5788 KB Output is correct
74 Correct 190 ms 22056 KB Output is correct
75 Correct 202 ms 22044 KB Output is correct
76 Correct 203 ms 22060 KB Output is correct
77 Correct 204 ms 22016 KB Output is correct
78 Correct 0 ms 340 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 4 ms 596 KB Output is correct
81 Correct 87 ms 8108 KB Output is correct
82 Correct 0 ms 340 KB Output is correct
83 Correct 0 ms 340 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 52 ms 5724 KB Output is correct
86 Correct 83 ms 12068 KB Output is correct
87 Correct 74 ms 8100 KB Output is correct
88 Correct 104 ms 12060 KB Output is correct
89 Correct 92 ms 12188 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 0 ms 212 KB Output is correct
92 Correct 4 ms 596 KB Output is correct
93 Correct 79 ms 8108 KB Output is correct
94 Correct 0 ms 212 KB Output is correct
95 Correct 1 ms 328 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 21 ms 2692 KB Output is correct
98 Correct 75 ms 10132 KB Output is correct
99 Correct 75 ms 10136 KB Output is correct
100 Correct 123 ms 10052 KB Output is correct
101 Correct 80 ms 10144 KB Output is correct
102 Correct 84 ms 10124 KB Output is correct
103 Correct 71 ms 10140 KB Output is correct
104 Correct 74 ms 10140 KB Output is correct
105 Correct 76 ms 10060 KB Output is correct