oj.uz

Submission #795157

# Submission time Handle Problem Language Result Execution time Memory
795157 2023-07-27T07:11:07 Z adrilen Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 189 ms 27260 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[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] != 0 && seen.count(groups[y]) == 0) {
				adj[g].push_back(groups[y]);
				seen.insert(groups[y]);
				adj[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;

		vector<int> gs = adj[i];
		gs.insert(gs.begin(), i);

		vector<int> twos, threes, ones;

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

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

			test.insert(lower_bound(test.begin(), test.end(), x), x);
			// for (int y : test) cout << y << " ";
			// cout << "\n";


			if (test != gs) goto impossible;

			done[x] = true;
			int one = 0;
			bool two, three;
			two = three = false;

			for (int y : p[gnode[x]])
			{
				if (y == 1) one ++;
				else if (y == 2) two = true;
				else if (y == 3) three = true;
			}
			
			if (two && three) goto impossible;
			
			if (one > 1) ones.emplace_back(x); 
			else if (two) twos.emplace_back(x);
			else if (three) threes.emplace_back(x);
		}

		// cout << "Counting finished\n";

		// cerr << ones.size() << " " << twos.size() << " " << threes.size() << " \n";

		if (threes.empty())
		{
			// Twos

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

			// 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;

			
		}
	}


	
	// Build
	build(output);
	return 1;


	impossible:

	return 0;
}

Subtask #1
11.0 / 11.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 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 6 ms 1236 KB Output is correct
7 Correct 144 ms 22920 KB Output is correct

Subtask #2
10.0 / 10.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 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 6 ms 1236 KB Output is correct
7 Correct 144 ms 22920 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 6 ms 1232 KB Output is correct
13 Correct 160 ms 22976 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 3 ms 848 KB Output is correct
17 Correct 65 ms 12996 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 36 ms 6200 KB Output is correct
21 Correct 147 ms 22944 KB Output is correct
22 Correct 144 ms 22928 KB Output is correct
23 Correct 152 ms 23040 KB Output is correct
24 Correct 152 ms 22920 KB Output is correct
25 Correct 61 ms 13004 KB Output is correct
26 Correct 61 ms 12976 KB Output is correct
27 Correct 148 ms 22888 KB Output is correct
28 Correct 144 ms 22972 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 6 ms 1196 KB Output is correct
9 Correct 146 ms 22936 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1492 KB Output is correct
13 Correct 189 ms 27092 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 980 KB Output is correct
17 Correct 102 ms 16844 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 37 ms 6256 KB Output is correct
22 Correct 150 ms 24500 KB Output is correct
23 Correct 149 ms 24072 KB Output is correct
24 Correct 176 ms 27260 KB Output is correct
25 Correct 72 ms 14096 KB Output is correct
26 Correct 65 ms 14620 KB Output is correct
27 Correct 146 ms 24012 KB Output is correct
28 Correct 181 ms 26016 KB Output is correct
29 Correct 65 ms 14096 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 36 ms 6224 KB Output is correct
5 Correct 158 ms 22964 KB Output is correct
6 Correct 150 ms 22856 KB Output is correct
7 Correct 159 ms 23024 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 41 ms 6240 KB Output is correct
10 Correct 164 ms 23508 KB Output is correct
11 Correct 148 ms 23020 KB Output is correct
12 Correct 172 ms 26220 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 49 ms 6244 KB Output is correct
17 Correct 158 ms 23428 KB Output is correct
18 Correct 161 ms 23220 KB Output is correct
19 Correct 153 ms 23072 KB Output is correct
20 Correct 143 ms 22872 KB Output is correct

Subtask #5
21.0 / 21.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 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 6 ms 1236 KB Output is correct
7 Correct 144 ms 22920 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 6 ms 1232 KB Output is correct
13 Correct 160 ms 22976 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 3 ms 848 KB Output is correct
17 Correct 65 ms 12996 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 36 ms 6200 KB Output is correct
21 Correct 147 ms 22944 KB Output is correct
22 Correct 144 ms 22928 KB Output is correct
23 Correct 152 ms 23040 KB Output is correct
24 Correct 152 ms 22920 KB Output is correct
25 Correct 61 ms 13004 KB Output is correct
26 Correct 61 ms 12976 KB Output is correct
27 Correct 148 ms 22888 KB Output is correct
28 Correct 144 ms 22972 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 6 ms 1196 KB Output is correct
37 Correct 146 ms 22936 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 8 ms 1492 KB Output is correct
41 Correct 189 ms 27092 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 4 ms 980 KB Output is correct
45 Correct 102 ms 16844 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 37 ms 6256 KB Output is correct
50 Correct 150 ms 24500 KB Output is correct
51 Correct 149 ms 24072 KB Output is correct
52 Correct 176 ms 27260 KB Output is correct
53 Correct 72 ms 14096 KB Output is correct
54 Correct 65 ms 14620 KB Output is correct
55 Correct 146 ms 24012 KB Output is correct
56 Correct 181 ms 26016 KB Output is correct
57 Correct 65 ms 14096 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 3 ms 816 KB Output is correct
61 Correct 62 ms 14100 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 36 ms 6220 KB Output is correct
66 Correct 64 ms 14092 KB Output is correct
67 Correct 59 ms 14100 KB Output is correct
68 Correct 65 ms 14096 KB Output is correct
69 Correct 63 ms 14028 KB Output is correct

Subtask #6
0 / 4.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 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 6 ms 1236 KB Output is correct
7 Correct 144 ms 22920 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 6 ms 1232 KB Output is correct
13 Correct 160 ms 22976 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 3 ms 848 KB Output is correct
17 Correct 65 ms 12996 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 36 ms 6200 KB Output is correct
21 Correct 147 ms 22944 KB Output is correct
22 Correct 144 ms 22928 KB Output is correct
23 Correct 152 ms 23040 KB Output is correct
24 Correct 152 ms 22920 KB Output is correct
25 Correct 61 ms 13004 KB Output is correct
26 Correct 61 ms 12976 KB Output is correct
27 Correct 148 ms 22888 KB Output is correct
28 Correct 144 ms 22972 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 6 ms 1196 KB Output is correct
37 Correct 146 ms 22936 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 8 ms 1492 KB Output is correct
41 Correct 189 ms 27092 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 4 ms 980 KB Output is correct
45 Correct 102 ms 16844 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 37 ms 6256 KB Output is correct
50 Correct 150 ms 24500 KB Output is correct
51 Correct 149 ms 24072 KB Output is correct
52 Correct 176 ms 27260 KB Output is correct
53 Correct 72 ms 14096 KB Output is correct
54 Correct 65 ms 14620 KB Output is correct
55 Correct 146 ms 24012 KB Output is correct
56 Correct 181 ms 26016 KB Output is correct
57 Correct 65 ms 14096 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 328 KB Output is correct
61 Correct 36 ms 6224 KB Output is correct
62 Correct 158 ms 22964 KB Output is correct
63 Correct 150 ms 22856 KB Output is correct
64 Correct 159 ms 23024 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 41 ms 6240 KB Output is correct
67 Correct 164 ms 23508 KB Output is correct
68 Correct 148 ms 23020 KB Output is correct
69 Correct 172 ms 26220 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 49 ms 6244 KB Output is correct
74 Correct 158 ms 23428 KB Output is correct
75 Correct 161 ms 23220 KB Output is correct
76 Correct 153 ms 23072 KB Output is correct
77 Correct 143 ms 22872 KB Output is correct
78 Correct 1 ms 340 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 3 ms 816 KB Output is correct
81 Correct 62 ms 14100 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 36 ms 6220 KB Output is correct
86 Correct 64 ms 14092 KB Output is correct
87 Correct 59 ms 14100 KB Output is correct
88 Correct 65 ms 14096 KB Output is correct
89 Correct 63 ms 14028 KB Output is correct
90 Correct 1 ms 340 KB Output is correct
91 Correct 1 ms 340 KB Output is correct
92 Correct 5 ms 828 KB Output is correct
93 Correct 89 ms 14068 KB Output is correct
94 Correct 1 ms 212 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 1 ms 328 KB Output is correct
97 Correct 27 ms 3732 KB Output is correct
98 Correct 64 ms 14624 KB Output is correct
99 Correct 91 ms 14096 KB Output is correct
100 Correct 74 ms 14096 KB Output is correct
101 Incorrect 158 ms 23964 KB Answer gives possible 1 while actual possible 0
102 Halted 0 ms 0 KB -