oj.uz

답안 #339259

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
339259 2020-12-25T02:08:41 Z Ta180m 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 265 ms 24428 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
constexpr int MX = 1005;


int st[MX], top[MX], cy[MX];
vector<int> vst[MX], vcy[MX];


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;
	
	int cnt_st = 0;
	for (int i = 0; i < N; ++i) {
		if (st[i]) continue;
		st[i] = ++cnt_st, vst[st[i]].push_back(i);
		for (int j = 0; j < N; ++j) {
			if (st[i] == st[j] || p[i][j] != 1) continue;
			if (st[j] && st[j] != st[i]) return 0;
			st[j] = st[i], vst[st[j]].push_back(j);
		}
	} 

	for (int i = 1; i <= cnt_st; ++i) {
		vector<int> & cur = vst[i];
		for (int j = 1; j < cur.size(); ++j)
			ans[cur[j-1]][cur[j]] = ans[cur[j]][cur[j-1]] = 1;
	}

	for (int i = 0; i < N; ++i) top[i] = vst[st[i]][0];

	int cnt_cy = 0;
	for (int i = 1; i <= cnt_st; ++i) {
		int a = vst[i][0];
		if (cy[a]) continue;
		cy[a] = ++cnt_cy, vcy[cy[a]].push_back(a);
		for (int j = 1; j <= cnt_st; ++j) {
			int b = vst[j][0];
			if (cy[a] == cy[b] || p[a][b] != 2) continue;
			if (cy[b] && cy[b] != cy[a]) return 0;
			cy[b] = cy[a], vcy[cy[b]].push_back(b);
		}
	}

	for (int i = 1; i <= cnt_cy; ++i) {
		vector<int> & cur = vcy[i];
		int sz = cur.size();
		if (sz == 1) continue;
		if (sz == 2) return 0;
		for (int j = 0; j < sz; ++j)
			ans[cur[j]][cur[(j+1)%sz]] = ans[cur[(j+1)%sz]][cur[j]] = 1;
	}

	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < N; ++j) {
			if (p[i][j] == 0 && (st[i] == st[j] || cy[top[i]] == cy[top[j]])) return 0;
			else if (p[i][j] == 1 && st[i] != st[j]) return 0;
			else if (p[i][j] == 2 && (st[i] == st[j] || cy[top[i]] != cy[top[j]])) return 0;
		}
	}

	build(ans);
	return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 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 10 ms 1260 KB Output is correct
7 Correct 237 ms 22252 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 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 10 ms 1260 KB Output is correct
7 Correct 237 ms 22252 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 10 ms 1260 KB Output is correct
13 Correct 246 ms 22252 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 876 KB Output is correct
17 Correct 113 ms 12268 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 63 ms 5996 KB Output is correct
21 Correct 243 ms 22124 KB Output is correct
22 Correct 243 ms 22124 KB Output is correct
23 Correct 252 ms 22124 KB Output is correct
24 Correct 243 ms 22252 KB Output is correct
25 Correct 111 ms 12268 KB Output is correct
26 Correct 103 ms 12268 KB Output is correct
27 Correct 250 ms 22252 KB Output is correct
28 Correct 243 ms 22380 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 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 384 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 1388 KB Output is correct
9 Correct 244 ms 24172 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 12 ms 1536 KB Output is correct
13 Correct 244 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 1004 KB Output is correct
17 Correct 114 ms 14188 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 6508 KB Output is correct
22 Correct 246 ms 24172 KB Output is correct
23 Correct 256 ms 24428 KB Output is correct
24 Correct 251 ms 24172 KB Output is correct
25 Correct 110 ms 14316 KB Output is correct
26 Correct 110 ms 14188 KB Output is correct
27 Correct 244 ms 24172 KB Output is correct
28 Correct 259 ms 24300 KB Output is correct
29 Correct 109 ms 14356 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 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 60 ms 5868 KB Output is correct
5 Correct 248 ms 22140 KB Output is correct
6 Correct 244 ms 22124 KB Output is correct
7 Correct 245 ms 22252 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 62 ms 5868 KB Output is correct
10 Correct 247 ms 22124 KB Output is correct
11 Correct 248 ms 22252 KB Output is correct
12 Correct 247 ms 22252 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 62 ms 5868 KB Output is correct
17 Correct 246 ms 22252 KB Output is correct
18 Correct 245 ms 22124 KB Output is correct
19 Correct 243 ms 22252 KB Output is correct
20 Correct 265 ms 22252 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 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 10 ms 1260 KB Output is correct
7 Correct 237 ms 22252 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 10 ms 1260 KB Output is correct
13 Correct 246 ms 22252 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 876 KB Output is correct
17 Correct 113 ms 12268 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 63 ms 5996 KB Output is correct
21 Correct 243 ms 22124 KB Output is correct
22 Correct 243 ms 22124 KB Output is correct
23 Correct 252 ms 22124 KB Output is correct
24 Correct 243 ms 22252 KB Output is correct
25 Correct 111 ms 12268 KB Output is correct
26 Correct 103 ms 12268 KB Output is correct
27 Correct 250 ms 22252 KB Output is correct
28 Correct 243 ms 22380 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 384 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 1388 KB Output is correct
37 Correct 244 ms 24172 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 12 ms 1536 KB Output is correct
41 Correct 244 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 1004 KB Output is correct
45 Correct 114 ms 14188 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 6508 KB Output is correct
50 Correct 246 ms 24172 KB Output is correct
51 Correct 256 ms 24428 KB Output is correct
52 Correct 251 ms 24172 KB Output is correct
53 Correct 110 ms 14316 KB Output is correct
54 Correct 110 ms 14188 KB Output is correct
55 Correct 244 ms 24172 KB Output is correct
56 Correct 259 ms 24300 KB Output is correct
57 Correct 109 ms 14356 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 876 KB Output is correct
61 Correct 109 ms 14188 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 61 ms 6380 KB Output is correct
66 Correct 108 ms 14316 KB Output is correct
67 Correct 106 ms 14188 KB Output is correct
68 Correct 106 ms 14324 KB Output is correct
69 Correct 108 ms 14316 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 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 10 ms 1260 KB Output is correct
7 Correct 237 ms 22252 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 10 ms 1260 KB Output is correct
13 Correct 246 ms 22252 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 876 KB Output is correct
17 Correct 113 ms 12268 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 63 ms 5996 KB Output is correct
21 Correct 243 ms 22124 KB Output is correct
22 Correct 243 ms 22124 KB Output is correct
23 Correct 252 ms 22124 KB Output is correct
24 Correct 243 ms 22252 KB Output is correct
25 Correct 111 ms 12268 KB Output is correct
26 Correct 103 ms 12268 KB Output is correct
27 Correct 250 ms 22252 KB Output is correct
28 Correct 243 ms 22380 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 384 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 1388 KB Output is correct
37 Correct 244 ms 24172 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 12 ms 1536 KB Output is correct
41 Correct 244 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 1004 KB Output is correct
45 Correct 114 ms 14188 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 6508 KB Output is correct
50 Correct 246 ms 24172 KB Output is correct
51 Correct 256 ms 24428 KB Output is correct
52 Correct 251 ms 24172 KB Output is correct
53 Correct 110 ms 14316 KB Output is correct
54 Correct 110 ms 14188 KB Output is correct
55 Correct 244 ms 24172 KB Output is correct
56 Correct 259 ms 24300 KB Output is correct
57 Correct 109 ms 14356 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 60 ms 5868 KB Output is correct
62 Correct 248 ms 22140 KB Output is correct
63 Correct 244 ms 22124 KB Output is correct
64 Correct 245 ms 22252 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 62 ms 5868 KB Output is correct
67 Correct 247 ms 22124 KB Output is correct
68 Correct 248 ms 22252 KB Output is correct
69 Correct 247 ms 22252 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 62 ms 5868 KB Output is correct
74 Correct 246 ms 22252 KB Output is correct
75 Correct 245 ms 22124 KB Output is correct
76 Correct 243 ms 22252 KB Output is correct
77 Correct 265 ms 22252 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 876 KB Output is correct
81 Correct 109 ms 14188 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 61 ms 6380 KB Output is correct
86 Correct 108 ms 14316 KB Output is correct
87 Correct 106 ms 14188 KB Output is correct
88 Correct 106 ms 14324 KB Output is correct
89 Correct 108 ms 14316 KB Output is correct
90 Correct 1 ms 364 KB Output is correct
91 Correct 1 ms 364 KB Output is correct
92 Correct 5 ms 876 KB Output is correct
93 Correct 107 ms 14332 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 3820 KB Output is correct
98 Correct 103 ms 14188 KB Output is correct
99 Correct 105 ms 14188 KB Output is correct
100 Correct 107 ms 14228 KB Output is correct
101 Correct 102 ms 14188 KB Output is correct
102 Correct 125 ms 14228 KB Output is correct
103 Correct 102 ms 14336 KB Output is correct
104 Correct 103 ms 14188 KB Output is correct
105 Correct 109 ms 14152 KB Output is correct