oj.uz

Submission #502965

# Submission time Handle Problem Language Result Execution time Memory
502965 2022-01-06T20:37:32 Z sliviu Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 214 ms 24040 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;
	vector<vector<int>> ans(n, vector<int>(n));
	vector<int> seen(n), solved(n), cycle;
	function<void(int)> dfs = [&](int 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 (!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();
			++cur;
			dfs(i);
			if (bad)
				return 0;
			if (!cycle.empty()) {
				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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 8 ms 1204 KB Output is correct
7 Correct 186 ms 22020 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 8 ms 1204 KB Output is correct
7 Correct 186 ms 22020 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 276 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1180 KB Output is correct
13 Correct 203 ms 23040 KB Output is correct
14 Correct 0 ms 288 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 804 KB Output is correct
17 Correct 96 ms 13100 KB Output is correct
18 Correct 1 ms 288 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 53 ms 6192 KB Output is correct
21 Correct 192 ms 23760 KB Output is correct
22 Correct 185 ms 23764 KB Output is correct
23 Correct 214 ms 23092 KB Output is correct
24 Correct 211 ms 23000 KB Output is correct
25 Correct 74 ms 13124 KB Output is correct
26 Correct 83 ms 13168 KB Output is correct
27 Correct 179 ms 23148 KB Output is correct
28 Correct 214 ms 23972 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory 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 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory 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 48 ms 6240 KB Output is correct
5 Correct 170 ms 23796 KB Output is correct
6 Correct 204 ms 23876 KB Output is correct
7 Correct 172 ms 23888 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 41 ms 6256 KB Output is correct
10 Correct 197 ms 23920 KB Output is correct
11 Correct 165 ms 23936 KB Output is correct
12 Correct 185 ms 24040 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Incorrect 43 ms 6156 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 8 ms 1204 KB Output is correct
7 Correct 186 ms 22020 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 276 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1180 KB Output is correct
13 Correct 203 ms 23040 KB Output is correct
14 Correct 0 ms 288 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 804 KB Output is correct
17 Correct 96 ms 13100 KB Output is correct
18 Correct 1 ms 288 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 53 ms 6192 KB Output is correct
21 Correct 192 ms 23760 KB Output is correct
22 Correct 185 ms 23764 KB Output is correct
23 Correct 214 ms 23092 KB Output is correct
24 Correct 211 ms 23000 KB Output is correct
25 Correct 74 ms 13124 KB Output is correct
26 Correct 83 ms 13168 KB Output is correct
27 Correct 179 ms 23148 KB Output is correct
28 Correct 214 ms 23972 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 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 8 ms 1204 KB Output is correct
7 Correct 186 ms 22020 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 276 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1180 KB Output is correct
13 Correct 203 ms 23040 KB Output is correct
14 Correct 0 ms 288 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 804 KB Output is correct
17 Correct 96 ms 13100 KB Output is correct
18 Correct 1 ms 288 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 53 ms 6192 KB Output is correct
21 Correct 192 ms 23760 KB Output is correct
22 Correct 185 ms 23764 KB Output is correct
23 Correct 214 ms 23092 KB Output is correct
24 Correct 211 ms 23000 KB Output is correct
25 Correct 74 ms 13124 KB Output is correct
26 Correct 83 ms 13168 KB Output is correct
27 Correct 179 ms 23148 KB Output is correct
28 Correct 214 ms 23972 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 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -