oj.uz

답안 #502979

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
502979 2022-01-06T20:57:15 Z sliviu 슈퍼트리 잇기 (IOI20_supertrees) C++14
40 / 100
 213 ms 22524 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size(), cur = 0, bad = 0, sp = 0;
	vector<vector<int>> ans(n, vector<int>(n));
	vector<int> seen(n), solved(n), cycle;
	vector<int> ccur;
	function<void(int)> dfs = [&](int node) {
		ccur.emplace_back(node);
		if (bad)
			return;
		seen[node] = cur;
		int c1 = 0, c2 = 0;
		for (int i = 0; i < n; ++i)
			if (i != node) {
				if (p[node][i] == 1)
					++c1;
				else if (p[node][i] == 2)
					++c2;
				else if (p[node][i] == 3)
					bad = 1;
				if (!seen[i] && p[node][i])
					dfs(i);
				if (!p[node][i] && seen[i] == cur)
					bad = 1;
			}
		if (!c1 && c2)
			cycle.emplace_back(node);
		if (c1 && c2)
			++sp;
		if (!solved[cur] && c1) {
			solved[cur] = 1;
			int cur = node;
			for (int i = 0; i < n; ++i)
				if (i != node && p[node][i] == 1)
					ans[cur][i] = ans[i][cur] = 1, cur = i;
		}
	};
	for (int i = 0; i < n; ++i)
		if (!seen[i]) {
			cycle.clear();
			ccur.clear();
			++cur;
			sp = 0;
			dfs(i);
			if (bad)
				return 0;
			if (!cycle.empty()) {
				if (cycle.size() + sp == 2)
					return 0;
				int cur = i;
				for (auto x : cycle)
					if (x != i) {
						ans[cur][x] = ans[x][cur] = 1;
						cur = x;
					}
				ans[cur][i] = ans[i][cur] = 1;
			}
		}
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 244 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 1100 KB Output is correct
7 Correct 161 ms 22024 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 244 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 1100 KB Output is correct
7 Correct 161 ms 22024 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 7 ms 1100 KB Output is correct
13 Correct 165 ms 22024 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 69 ms 12172 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 42 ms 5700 KB Output is correct
21 Correct 172 ms 22012 KB Output is correct
22 Correct 164 ms 22020 KB Output is correct
23 Correct 187 ms 22028 KB Output is correct
24 Correct 163 ms 21956 KB Output is correct
25 Correct 136 ms 12028 KB Output is correct
26 Correct 64 ms 12036 KB Output is correct
27 Correct 168 ms 22024 KB Output is correct
28 Correct 168 ms 21928 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 11 ms 1100 KB Output is correct
9 Correct 184 ms 21984 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 12 ms 1144 KB Output is correct
13 Correct 182 ms 22028 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 92 ms 12024 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 46 ms 5716 KB Output is correct
22 Correct 185 ms 22516 KB Output is correct
23 Correct 175 ms 22020 KB Output is correct
24 Correct 181 ms 22004 KB Output is correct
25 Correct 67 ms 12536 KB Output is correct
26 Correct 63 ms 12668 KB Output is correct
27 Correct 180 ms 22060 KB Output is correct
28 Correct 179 ms 22524 KB Output is correct
29 Correct 125 ms 12536 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 51 ms 5692 KB Output is correct
5 Correct 167 ms 21992 KB Output is correct
6 Correct 174 ms 22016 KB Output is correct
7 Correct 203 ms 22052 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 60 ms 5832 KB Output is correct
10 Correct 199 ms 22008 KB Output is correct
11 Correct 166 ms 22012 KB Output is correct
12 Correct 213 ms 22012 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Incorrect 49 ms 5664 KB Too few ways to get from 0 to 24, should be 2 found 0
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 244 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 1100 KB Output is correct
7 Correct 161 ms 22024 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 7 ms 1100 KB Output is correct
13 Correct 165 ms 22024 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 69 ms 12172 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 42 ms 5700 KB Output is correct
21 Correct 172 ms 22012 KB Output is correct
22 Correct 164 ms 22020 KB Output is correct
23 Correct 187 ms 22028 KB Output is correct
24 Correct 163 ms 21956 KB Output is correct
25 Correct 136 ms 12028 KB Output is correct
26 Correct 64 ms 12036 KB Output is correct
27 Correct 168 ms 22024 KB Output is correct
28 Correct 168 ms 21928 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 11 ms 1100 KB Output is correct
37 Correct 184 ms 21984 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 12 ms 1144 KB Output is correct
41 Correct 182 ms 22028 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 3 ms 716 KB Output is correct
45 Correct 92 ms 12024 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 46 ms 5716 KB Output is correct
50 Correct 185 ms 22516 KB Output is correct
51 Correct 175 ms 22020 KB Output is correct
52 Correct 181 ms 22004 KB Output is correct
53 Correct 67 ms 12536 KB Output is correct
54 Correct 63 ms 12668 KB Output is correct
55 Correct 180 ms 22060 KB Output is correct
56 Correct 179 ms 22524 KB Output is correct
57 Correct 125 ms 12536 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 0 ms 296 KB Output is correct
60 Correct 3 ms 844 KB Output is correct
61 Correct 76 ms 12540 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Incorrect 41 ms 5756 KB Too few ways to get from 1 to 11, should be 2 found 0
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 244 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 1100 KB Output is correct
7 Correct 161 ms 22024 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 7 ms 1100 KB Output is correct
13 Correct 165 ms 22024 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 69 ms 12172 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 42 ms 5700 KB Output is correct
21 Correct 172 ms 22012 KB Output is correct
22 Correct 164 ms 22020 KB Output is correct
23 Correct 187 ms 22028 KB Output is correct
24 Correct 163 ms 21956 KB Output is correct
25 Correct 136 ms 12028 KB Output is correct
26 Correct 64 ms 12036 KB Output is correct
27 Correct 168 ms 22024 KB Output is correct
28 Correct 168 ms 21928 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 11 ms 1100 KB Output is correct
37 Correct 184 ms 21984 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 12 ms 1144 KB Output is correct
41 Correct 182 ms 22028 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 3 ms 716 KB Output is correct
45 Correct 92 ms 12024 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 46 ms 5716 KB Output is correct
50 Correct 185 ms 22516 KB Output is correct
51 Correct 175 ms 22020 KB Output is correct
52 Correct 181 ms 22004 KB Output is correct
53 Correct 67 ms 12536 KB Output is correct
54 Correct 63 ms 12668 KB Output is correct
55 Correct 180 ms 22060 KB Output is correct
56 Correct 179 ms 22524 KB Output is correct
57 Correct 125 ms 12536 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 51 ms 5692 KB Output is correct
62 Correct 167 ms 21992 KB Output is correct
63 Correct 174 ms 22016 KB Output is correct
64 Correct 203 ms 22052 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 60 ms 5832 KB Output is correct
67 Correct 199 ms 22008 KB Output is correct
68 Correct 166 ms 22012 KB Output is correct
69 Correct 213 ms 22012 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 0 ms 204 KB Output is correct
73 Incorrect 49 ms 5664 KB Too few ways to get from 0 to 24, should be 2 found 0
74 Halted 0 ms 0 KB -