oj.uz

Submission #795245

# Submission time Handle Problem Language Result Execution time Memory
795245 2023-07-27T07:45:53 Z adrilen Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 203 ms 27352 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 }, siz[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[gnode[g]]) goto impossible;
		}

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

		siz[g] = clique.size();

		set <int> seen;
		for (int y = 0; y < i; y++)
		{
			if (p[i][y] == 2 && seen.count(groups[y]) == 0) {
				adj[0][g].push_back(groups[y]);
				seen.insert(groups[y]);
				adj[0][groups[y]].push_back(g);
			}
			if (p[i][y] == 3 && seen.count(groups[y]) == 0) {
				adj[1][g].push_back(groups[y]);
				seen.insert(groups[y]);
				adj[1][groups[y]].push_back(g);
			}
		}
	}

	// cerr << "Groups complete\n";

	// 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][1].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);

		vector<int> twos, threes;

		if (gs.size() == 1) continue;
		if (gs.size() == 2) goto impossible;
		// cout << i << "\n";
		// for (int y : gs) cout << y << " ";
		// cout << "\n";

		for (int x : gs)
		{
			vector<int> test = adj[t][x];

			if (!adj[t ^ 1][x].empty()) goto impossible;

			test.insert(lower_bound(test.begin(), test.end(), x), x);

			if (test != gs) goto impossible;

			done[x] = true;
		}

		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
		{
			if (gs.size() < 4) goto impossible;

			output[gnode[gs[0]]][gnode[gs[2]]] = output[gnode[gs[2]]][gnode[gs[0]]] = 1;
		}
	}


	
	// Build
	build(output);
	return 1;


	impossible:

	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 356 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 1212 KB Output is correct
7 Correct 156 ms 23152 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 356 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 1212 KB Output is correct
7 Correct 156 ms 23152 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 7 ms 1292 KB Output is correct
13 Correct 147 ms 23200 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 880 KB Output is correct
17 Correct 66 ms 13328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 41 ms 6220 KB Output is correct
21 Correct 151 ms 23252 KB Output is correct
22 Correct 162 ms 23264 KB Output is correct
23 Correct 159 ms 23184 KB Output is correct
24 Correct 146 ms 23216 KB Output is correct
25 Correct 65 ms 13328 KB Output is correct
26 Correct 60 ms 13256 KB Output is correct
27 Correct 151 ms 23200 KB Output is correct
28 Correct 151 ms 23264 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 356 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 6 ms 1236 KB Output is correct
9 Correct 157 ms 23208 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 10 ms 1488 KB Output is correct
13 Correct 189 ms 27352 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 980 KB Output is correct
17 Correct 91 ms 15444 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 356 KB Output is correct
21 Correct 37 ms 6372 KB Output is correct
22 Correct 150 ms 23228 KB Output is correct
23 Correct 145 ms 22692 KB Output is correct
24 Correct 171 ms 26024 KB Output is correct
25 Correct 60 ms 12732 KB Output is correct
26 Correct 65 ms 13356 KB Output is correct
27 Correct 150 ms 22760 KB Output is correct
28 Correct 172 ms 24776 KB Output is correct
29 Correct 60 ms 12736 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 36 ms 6220 KB Output is correct
5 Correct 144 ms 23164 KB Output is correct
6 Correct 145 ms 23172 KB Output is correct
7 Correct 151 ms 23196 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 37 ms 6372 KB Output is correct
10 Correct 151 ms 23700 KB Output is correct
11 Correct 147 ms 23284 KB Output is correct
12 Correct 170 ms 26552 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 36 ms 6304 KB Output is correct
17 Correct 148 ms 23772 KB Output is correct
18 Correct 147 ms 23464 KB Output is correct
19 Correct 149 ms 23284 KB Output is correct
20 Correct 154 ms 23184 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 356 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 1212 KB Output is correct
7 Correct 156 ms 23152 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 7 ms 1292 KB Output is correct
13 Correct 147 ms 23200 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 880 KB Output is correct
17 Correct 66 ms 13328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 41 ms 6220 KB Output is correct
21 Correct 151 ms 23252 KB Output is correct
22 Correct 162 ms 23264 KB Output is correct
23 Correct 159 ms 23184 KB Output is correct
24 Correct 146 ms 23216 KB Output is correct
25 Correct 65 ms 13328 KB Output is correct
26 Correct 60 ms 13256 KB Output is correct
27 Correct 151 ms 23200 KB Output is correct
28 Correct 151 ms 23264 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 356 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 6 ms 1236 KB Output is correct
37 Correct 157 ms 23208 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 10 ms 1488 KB Output is correct
41 Correct 189 ms 27352 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 980 KB Output is correct
45 Correct 91 ms 15444 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 356 KB Output is correct
49 Correct 37 ms 6372 KB Output is correct
50 Correct 150 ms 23228 KB Output is correct
51 Correct 145 ms 22692 KB Output is correct
52 Correct 171 ms 26024 KB Output is correct
53 Correct 60 ms 12732 KB Output is correct
54 Correct 65 ms 13356 KB Output is correct
55 Correct 150 ms 22760 KB Output is correct
56 Correct 172 ms 24776 KB Output is correct
57 Correct 60 ms 12736 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 3 ms 844 KB Output is correct
61 Correct 64 ms 12752 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 0 ms 360 KB Output is correct
64 Correct 1 ms 468 KB Output is correct
65 Correct 44 ms 6320 KB Output is correct
66 Correct 66 ms 13012 KB Output is correct
67 Correct 62 ms 12940 KB Output is correct
68 Correct 62 ms 12932 KB Output is correct
69 Correct 62 ms 12936 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 356 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 1212 KB Output is correct
7 Correct 156 ms 23152 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 7 ms 1292 KB Output is correct
13 Correct 147 ms 23200 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 880 KB Output is correct
17 Correct 66 ms 13328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 41 ms 6220 KB Output is correct
21 Correct 151 ms 23252 KB Output is correct
22 Correct 162 ms 23264 KB Output is correct
23 Correct 159 ms 23184 KB Output is correct
24 Correct 146 ms 23216 KB Output is correct
25 Correct 65 ms 13328 KB Output is correct
26 Correct 60 ms 13256 KB Output is correct
27 Correct 151 ms 23200 KB Output is correct
28 Correct 151 ms 23264 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 356 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 6 ms 1236 KB Output is correct
37 Correct 157 ms 23208 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 10 ms 1488 KB Output is correct
41 Correct 189 ms 27352 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 980 KB Output is correct
45 Correct 91 ms 15444 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 356 KB Output is correct
49 Correct 37 ms 6372 KB Output is correct
50 Correct 150 ms 23228 KB Output is correct
51 Correct 145 ms 22692 KB Output is correct
52 Correct 171 ms 26024 KB Output is correct
53 Correct 60 ms 12732 KB Output is correct
54 Correct 65 ms 13356 KB Output is correct
55 Correct 150 ms 22760 KB Output is correct
56 Correct 172 ms 24776 KB Output is correct
57 Correct 60 ms 12736 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 36 ms 6220 KB Output is correct
62 Correct 144 ms 23164 KB Output is correct
63 Correct 145 ms 23172 KB Output is correct
64 Correct 151 ms 23196 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 37 ms 6372 KB Output is correct
67 Correct 151 ms 23700 KB Output is correct
68 Correct 147 ms 23284 KB Output is correct
69 Correct 170 ms 26552 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 36 ms 6304 KB Output is correct
74 Correct 148 ms 23772 KB Output is correct
75 Correct 147 ms 23464 KB Output is correct
76 Correct 149 ms 23284 KB Output is correct
77 Correct 154 ms 23184 KB Output is correct
78 Correct 1 ms 340 KB Output is correct
79 Correct 1 ms 340 KB Output is correct
80 Correct 3 ms 844 KB Output is correct
81 Correct 64 ms 12752 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 0 ms 360 KB Output is correct
84 Correct 1 ms 468 KB Output is correct
85 Correct 44 ms 6320 KB Output is correct
86 Correct 66 ms 13012 KB Output is correct
87 Correct 62 ms 12940 KB Output is correct
88 Correct 62 ms 12932 KB Output is correct
89 Correct 62 ms 12936 KB Output is correct
90 Correct 1 ms 352 KB Output is correct
91 Correct 1 ms 340 KB Output is correct
92 Correct 3 ms 852 KB Output is correct
93 Correct 64 ms 12860 KB Output is correct
94 Correct 1 ms 340 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 0 ms 340 KB Output is correct
97 Correct 19 ms 3760 KB Output is correct
98 Correct 65 ms 13488 KB Output is correct
99 Correct 61 ms 12868 KB Output is correct
100 Correct 63 ms 12852 KB Output is correct
101 Correct 61 ms 12928 KB Output is correct
102 Incorrect 203 ms 26708 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -