oj.uz

답안 #303860

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
303860 2020-09-20T17:30:06 Z dolphingarlic 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 265 ms 26216 KB 
#include "supertrees.h"

#include <bits/stdc++.h>
using namespace std;

int cmp[1000];
bool used[1000];
vector<pair<int, int>> has[4];
vector<int> cn[1000];

int find(int A) {
	while (A != cmp[A]) A = cmp[A], cmp[A] = cmp[cmp[A]];
	return A;
}

void onion(int A, int B) { cmp[find(A)] = find(B); }

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

	for (int i = 0; i < n; i++) for (int j = 0; j < i; j++) {
		has[p[i][j]].push_back({i, j});
	}

	vector<vector<int>> ans(n, vector<int>(n, 0));

	iota(cmp, cmp + n, 0);
	for (pair<int, int> i : has[1]) onion(i.first, i.second);
	for (int i = 0; i < n; i++) cn[find(i)].push_back(i);
	for (int i = 0; i < n; i++) {
		if (!cn[i].size()) continue;
		for (int j = 1; j < cn[i].size(); j++) {
			ans[cn[i][j]][cn[i][0]] = ans[cn[i][0]][cn[i][j]] = 1;
			used[cn[i][j]] = true;
		}
		cn[i].clear();
	}

	for (pair<int, int> i : has[2]) onion(i.first, i.second);
	for (int i = 0; i < n; i++) if (!used[i]) cn[find(i)].push_back(i);
	for (int i = 0; i < n; i++) {
		if (cn[i].size() < 2) {
			cn[i].clear();
			continue;
		}
		if (cn[i].size() == 2) return 0;
		ans[cn[i][0]][cn[i].back()] = ans[cn[i].back()][cn[i][0]] = 1;
		for (int j = 1; j < cn[i].size(); j++)
			ans[cn[i][j]][cn[i][j - 1]] = ans[cn[i][j - 1]][cn[i][j]] = 1;
		cn[i].clear();
	}

	if (has[3].size()) return 0;
	for (pair<int, int> i : has[0]) if (find(i.first) == find(i.second)) return 0;
	build(ans);
	return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1408 KB Output is correct
7 Correct 259 ms 26076 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1408 KB Output is correct
7 Correct 259 ms 26076 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 243 ms 26080 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 125 ms 16092 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 62 ms 6896 KB Output is correct
21 Correct 253 ms 26116 KB Output is correct
22 Correct 246 ms 26080 KB Output is correct
23 Correct 261 ms 26064 KB Output is correct
24 Correct 243 ms 26080 KB Output is correct
25 Correct 114 ms 16136 KB Output is correct
26 Correct 108 ms 16172 KB Output is correct
27 Correct 262 ms 26064 KB Output is correct
28 Correct 250 ms 26080 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 13 ms 1408 KB Output is correct
9 Correct 246 ms 26080 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 264 ms 26076 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 125 ms 16216 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 63 ms 6892 KB Output is correct
22 Correct 249 ms 26112 KB Output is correct
23 Correct 252 ms 26152 KB Output is correct
24 Correct 265 ms 26076 KB Output is correct
25 Correct 108 ms 16104 KB Output is correct
26 Correct 118 ms 16136 KB Output is correct
27 Correct 243 ms 26080 KB Output is correct
28 Correct 259 ms 26192 KB Output is correct
29 Correct 116 ms 16104 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 62 ms 6888 KB Output is correct
5 Correct 255 ms 26112 KB Output is correct
6 Correct 246 ms 26084 KB Output is correct
7 Correct 256 ms 26072 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 63 ms 6868 KB Output is correct
10 Correct 248 ms 26116 KB Output is correct
11 Correct 250 ms 26208 KB Output is correct
12 Correct 256 ms 26072 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 65 ms 6896 KB Output is correct
17 Correct 252 ms 26060 KB Output is correct
18 Correct 257 ms 26112 KB Output is correct
19 Correct 253 ms 26216 KB Output is correct
20 Correct 254 ms 26080 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1408 KB Output is correct
7 Correct 259 ms 26076 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 243 ms 26080 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 125 ms 16092 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 62 ms 6896 KB Output is correct
21 Correct 253 ms 26116 KB Output is correct
22 Correct 246 ms 26080 KB Output is correct
23 Correct 261 ms 26064 KB Output is correct
24 Correct 243 ms 26080 KB Output is correct
25 Correct 114 ms 16136 KB Output is correct
26 Correct 108 ms 16172 KB Output is correct
27 Correct 262 ms 26064 KB Output is correct
28 Correct 250 ms 26080 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 13 ms 1408 KB Output is correct
37 Correct 246 ms 26080 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 264 ms 26076 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 1024 KB Output is correct
45 Correct 125 ms 16216 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 63 ms 6892 KB Output is correct
50 Correct 249 ms 26112 KB Output is correct
51 Correct 252 ms 26152 KB Output is correct
52 Correct 265 ms 26076 KB Output is correct
53 Correct 108 ms 16104 KB Output is correct
54 Correct 118 ms 16136 KB Output is correct
55 Correct 243 ms 26080 KB Output is correct
56 Correct 259 ms 26192 KB Output is correct
57 Correct 116 ms 16104 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 5 ms 1024 KB Output is correct
61 Correct 129 ms 16080 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 68 ms 6892 KB Output is correct
66 Correct 125 ms 16136 KB Output is correct
67 Correct 115 ms 16136 KB Output is correct
68 Correct 110 ms 16112 KB Output is correct
69 Correct 123 ms 16104 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1408 KB Output is correct
7 Correct 259 ms 26076 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 243 ms 26080 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 125 ms 16092 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 62 ms 6896 KB Output is correct
21 Correct 253 ms 26116 KB Output is correct
22 Correct 246 ms 26080 KB Output is correct
23 Correct 261 ms 26064 KB Output is correct
24 Correct 243 ms 26080 KB Output is correct
25 Correct 114 ms 16136 KB Output is correct
26 Correct 108 ms 16172 KB Output is correct
27 Correct 262 ms 26064 KB Output is correct
28 Correct 250 ms 26080 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 13 ms 1408 KB Output is correct
37 Correct 246 ms 26080 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 264 ms 26076 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 1024 KB Output is correct
45 Correct 125 ms 16216 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 63 ms 6892 KB Output is correct
50 Correct 249 ms 26112 KB Output is correct
51 Correct 252 ms 26152 KB Output is correct
52 Correct 265 ms 26076 KB Output is correct
53 Correct 108 ms 16104 KB Output is correct
54 Correct 118 ms 16136 KB Output is correct
55 Correct 243 ms 26080 KB Output is correct
56 Correct 259 ms 26192 KB Output is correct
57 Correct 116 ms 16104 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 62 ms 6888 KB Output is correct
62 Correct 255 ms 26112 KB Output is correct
63 Correct 246 ms 26084 KB Output is correct
64 Correct 256 ms 26072 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 63 ms 6868 KB Output is correct
67 Correct 248 ms 26116 KB Output is correct
68 Correct 250 ms 26208 KB Output is correct
69 Correct 256 ms 26072 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 0 ms 384 KB Output is correct
73 Correct 65 ms 6896 KB Output is correct
74 Correct 252 ms 26060 KB Output is correct
75 Correct 257 ms 26112 KB Output is correct
76 Correct 253 ms 26216 KB Output is correct
77 Correct 254 ms 26080 KB Output is correct
78 Correct 1 ms 384 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 5 ms 1024 KB Output is correct
81 Correct 129 ms 16080 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 1 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 68 ms 6892 KB Output is correct
86 Correct 125 ms 16136 KB Output is correct
87 Correct 115 ms 16136 KB Output is correct
88 Correct 110 ms 16112 KB Output is correct
89 Correct 123 ms 16104 KB Output is correct
90 Correct 1 ms 384 KB Output is correct
91 Correct 0 ms 384 KB Output is correct
92 Correct 6 ms 1024 KB Output is correct
93 Correct 130 ms 16084 KB Output is correct
94 Correct 0 ms 384 KB Output is correct
95 Correct 0 ms 384 KB Output is correct
96 Correct 0 ms 384 KB Output is correct
97 Correct 35 ms 4340 KB Output is correct
98 Correct 134 ms 16128 KB Output is correct
99 Correct 111 ms 16132 KB Output is correct
100 Correct 110 ms 16240 KB Output is correct
101 Correct 110 ms 16104 KB Output is correct
102 Correct 123 ms 16104 KB Output is correct
103 Correct 128 ms 16348 KB Output is correct
104 Correct 130 ms 16132 KB Output is correct
105 Correct 131 ms 16092 KB Output is correct