oj.uz

Submission #795425

# Submission time Handle Problem Language Result Execution time Memory
795425 2023-07-27T09:28:36 Z adrilen Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 233 ms 26180 KB 
#include "supertrees.h"
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using arr = array<int, 2>;
using arrr = array<int, 3>;

constexpr int maxn = 1e3 + 5;

int next_group = 1;
int groups[maxn] = { 0 }, gnode[maxn] = { 0 };
bool done[maxn] = { 0 };

vector <int> adj[2][maxn];


int construct(std::vector<std::vector<int>> p) {

	int g;
	int n = p.size();

	vector<vector<int>> output(n, vector<int>(n));

	for (int i = 0; i < n; i++)
	{
		if (groups[i]) continue;

		g = next_group++;

		vector<int> clique = { i };

		for (int y = i + 1; y < n; y++)
		{
			if (p[i][y] == 1) clique.emplace_back(y);
		}
		gnode[g] = i;

		for (int y : clique) {
			groups[y] = g;

			if (p[y] != p[i]) goto impossible;
		}

		for (int i = 1; i < (int)clique.size(); i++)
		{
			output[clique[i]][clique[i - 1]] = output[clique[i - 1]][clique[i]] = 1;
		}

		set <int> seen;
		for (int y = 0; y < i; y++)
		{
			if (seen.count(groups[y])) continue;

			if (p[i][y] == 2) {
				adj[0][g].push_back(groups[y]);
				adj[0][groups[y]].push_back(g);
			}
			if (p[i][y] == 3) {
				adj[1][g].push_back(groups[y]);
				adj[1][groups[y]].push_back(g);
			}
			seen.insert(groups[y]);
		}
	}


	// Combining groups
	// in each connected component, there must be either 2, 3, or none, but not both

	for (int i = 1; i < next_group; i++)
	{
		if (done[i]) continue;

		if (!adj[0][i].empty() && !adj[1][i].empty()) goto impossible;

		int t;
		if (!adj[0][i].empty()) t = 0;
		else t = 1;
		
		
		vector<int> gs = adj[t][i];
		gs.insert(gs.begin(), i);

		if (gs.size() == 1) continue;
		if (gs.size() == 2) goto impossible;

		for (int x : gs)
		{
			if (!adj[t ^ 1][x].empty()) goto impossible;

			vector<int> test = adj[t][x];
			test.insert(lower_bound(test.begin(), test.end(), x), x);

			if (test != gs) goto impossible;

			assert(!done[x]);
			done[x] = true;
		}

		// Make a cycle
		for (int y = 0; y < (int)gs.size() - 1; y++) {
			output[gnode[gs[y]]][gnode[gs[y + 1]]] = output[gnode[gs[y + 1]]][gnode[gs[y]]] = 1;
		}
		output[gnode[gs[0]]][gnode[gs[gs.size() - 1]]] = output[gnode[gs[gs.size() - 1]]][gnode[gs[0]]] = 1;


		if (t == 0)
		{
			if (gs.size() < 3) goto impossible;
		}
		else
		{
			goto impossible;
		}
	}


	
	// Build
	build(output);
	return 1;


impossible:

	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 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 6 ms 1244 KB Output is correct
7 Correct 150 ms 22084 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 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 6 ms 1244 KB Output is correct
7 Correct 150 ms 22084 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 182 ms 22088 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 73 ms 12232 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 38 ms 5736 KB Output is correct
21 Correct 152 ms 22084 KB Output is correct
22 Correct 155 ms 22088 KB Output is correct
23 Correct 154 ms 22092 KB Output is correct
24 Correct 196 ms 22004 KB Output is correct
25 Correct 71 ms 12156 KB Output is correct
26 Correct 61 ms 12212 KB Output is correct
27 Correct 153 ms 22096 KB Output is correct
28 Correct 181 ms 22092 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 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 340 KB Output is correct
5 Correct 0 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 7 ms 1236 KB Output is correct
9 Correct 188 ms 22096 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 8 ms 1364 KB Output is correct
13 Correct 193 ms 26180 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 109 ms 14848 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 48 ms 5816 KB Output is correct
22 Correct 202 ms 22600 KB Output is correct
23 Correct 181 ms 22156 KB Output is correct
24 Correct 214 ms 25400 KB Output is correct
25 Correct 95 ms 12208 KB Output is correct
26 Correct 98 ms 12744 KB Output is correct
27 Correct 180 ms 22072 KB Output is correct
28 Correct 197 ms 24140 KB Output is correct
29 Correct 93 ms 12188 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 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 41 ms 5836 KB Output is correct
5 Correct 150 ms 22092 KB Output is correct
6 Correct 153 ms 22132 KB Output is correct
7 Correct 161 ms 22076 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 45 ms 5812 KB Output is correct
10 Correct 187 ms 22584 KB Output is correct
11 Correct 186 ms 22080 KB Output is correct
12 Correct 233 ms 25408 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 46 ms 5768 KB Output is correct
17 Correct 226 ms 22604 KB Output is correct
18 Correct 166 ms 22328 KB Output is correct
19 Correct 163 ms 22208 KB Output is correct
20 Correct 182 ms 22072 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 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 6 ms 1244 KB Output is correct
7 Correct 150 ms 22084 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 182 ms 22088 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 73 ms 12232 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 38 ms 5736 KB Output is correct
21 Correct 152 ms 22084 KB Output is correct
22 Correct 155 ms 22088 KB Output is correct
23 Correct 154 ms 22092 KB Output is correct
24 Correct 196 ms 22004 KB Output is correct
25 Correct 71 ms 12156 KB Output is correct
26 Correct 61 ms 12212 KB Output is correct
27 Correct 153 ms 22096 KB Output is correct
28 Correct 181 ms 22092 KB Output is correct
29 Correct 0 ms 340 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 340 KB Output is correct
33 Correct 0 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 7 ms 1236 KB Output is correct
37 Correct 188 ms 22096 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 8 ms 1364 KB Output is correct
41 Correct 193 ms 26180 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 4 ms 852 KB Output is correct
45 Correct 109 ms 14848 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 48 ms 5816 KB Output is correct
50 Correct 202 ms 22600 KB Output is correct
51 Correct 181 ms 22156 KB Output is correct
52 Correct 214 ms 25400 KB Output is correct
53 Correct 95 ms 12208 KB Output is correct
54 Correct 98 ms 12744 KB Output is correct
55 Correct 180 ms 22072 KB Output is correct
56 Correct 197 ms 24140 KB Output is correct
57 Correct 93 ms 12188 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 3 ms 724 KB Output is correct
61 Correct 63 ms 12084 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 352 KB Output is correct
65 Correct 45 ms 5784 KB Output is correct
66 Correct 64 ms 12100 KB Output is correct
67 Correct 65 ms 12096 KB Output is correct
68 Correct 60 ms 12084 KB Output is correct
69 Correct 90 ms 12212 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 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 6 ms 1244 KB Output is correct
7 Correct 150 ms 22084 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 182 ms 22088 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 73 ms 12232 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 38 ms 5736 KB Output is correct
21 Correct 152 ms 22084 KB Output is correct
22 Correct 155 ms 22088 KB Output is correct
23 Correct 154 ms 22092 KB Output is correct
24 Correct 196 ms 22004 KB Output is correct
25 Correct 71 ms 12156 KB Output is correct
26 Correct 61 ms 12212 KB Output is correct
27 Correct 153 ms 22096 KB Output is correct
28 Correct 181 ms 22092 KB Output is correct
29 Correct 0 ms 340 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 340 KB Output is correct
33 Correct 0 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 7 ms 1236 KB Output is correct
37 Correct 188 ms 22096 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 8 ms 1364 KB Output is correct
41 Correct 193 ms 26180 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 4 ms 852 KB Output is correct
45 Correct 109 ms 14848 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 48 ms 5816 KB Output is correct
50 Correct 202 ms 22600 KB Output is correct
51 Correct 181 ms 22156 KB Output is correct
52 Correct 214 ms 25400 KB Output is correct
53 Correct 95 ms 12208 KB Output is correct
54 Correct 98 ms 12744 KB Output is correct
55 Correct 180 ms 22072 KB Output is correct
56 Correct 197 ms 24140 KB Output is correct
57 Correct 93 ms 12188 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 41 ms 5836 KB Output is correct
62 Correct 150 ms 22092 KB Output is correct
63 Correct 153 ms 22132 KB Output is correct
64 Correct 161 ms 22076 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 45 ms 5812 KB Output is correct
67 Correct 187 ms 22584 KB Output is correct
68 Correct 186 ms 22080 KB Output is correct
69 Correct 233 ms 25408 KB Output is correct
70 Correct 0 ms 340 KB Output is correct
71 Correct 0 ms 340 KB Output is correct
72 Correct 0 ms 340 KB Output is correct
73 Correct 46 ms 5768 KB Output is correct
74 Correct 226 ms 22604 KB Output is correct
75 Correct 166 ms 22328 KB Output is correct
76 Correct 163 ms 22208 KB Output is correct
77 Correct 182 ms 22072 KB Output is correct
78 Correct 0 ms 340 KB Output is correct
79 Correct 0 ms 340 KB Output is correct
80 Correct 3 ms 724 KB Output is correct
81 Correct 63 ms 12084 KB Output is correct
82 Correct 0 ms 340 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 352 KB Output is correct
85 Correct 45 ms 5784 KB Output is correct
86 Correct 64 ms 12100 KB Output is correct
87 Correct 65 ms 12096 KB Output is correct
88 Correct 60 ms 12084 KB Output is correct
89 Correct 90 ms 12212 KB Output is correct
90 Correct 0 ms 340 KB Output is correct
91 Correct 0 ms 340 KB Output is correct
92 Correct 3 ms 724 KB Output is correct
93 Correct 63 ms 12096 KB Output is correct
94 Correct 0 ms 340 KB Output is correct
95 Correct 0 ms 340 KB Output is correct
96 Correct 0 ms 340 KB Output is correct
97 Correct 23 ms 3384 KB Output is correct
98 Correct 96 ms 12764 KB Output is correct
99 Correct 81 ms 12092 KB Output is correct
100 Correct 59 ms 12108 KB Output is correct
101 Correct 93 ms 12220 KB Output is correct
102 Correct 104 ms 16212 KB Output is correct
103 Correct 139 ms 19720 KB Output is correct
104 Correct 61 ms 14132 KB Output is correct
105 Correct 109 ms 16924 KB Output is correct