Submission #794687

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
794687	2023-07-26T19:03:05 Z	adrilen	Connecting Supertrees (IOI20_supertrees)	C++17	21 / 100	170 ms	22272 KB

supertrees

#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.push_back(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)
		{
			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); continue;}
			
			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 (twos.size() < ones.size()) goto impossible;

			// Connect the ring to the arms
			for (int y = 0; y < (int)ones.size(); y++) output[gnode[ones[y]]][gnode[twos[y]]] = output[gnode[twos[y]]][gnode[ones[y]]] = 1;

			// Connect the ring
			for (int y = 0; y < (int)twos.size() - 1; y++) 
				output[gnode[twos[y]]][gnode[twos[y + 1]]] = output[gnode[twos[y + 1]]][gnode[twos[y]]] = 1;

			output[gnode[twos[0]]][gnode[twos[twos.size() - 1]]] = output[gnode[twos[twos.size() - 1]]][gnode[twos[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	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1108 KB	Output is correct
7	Correct	150 ms	22044 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1108 KB	Output is correct
7	Correct	150 ms	22044 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	6 ms	1204 KB	Output is correct
13	Correct	170 ms	22060 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	3 ms	724 KB	Output is correct
17	Correct	64 ms	12060 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	43 ms	5792 KB	Output is correct
21	Correct	163 ms	22020 KB	Output is correct
22	Correct	149 ms	22060 KB	Output is correct
23	Correct	152 ms	22048 KB	Output is correct
24	Correct	149 ms	22004 KB	Output is correct
25	Correct	86 ms	12072 KB	Output is correct
26	Correct	61 ms	12076 KB	Output is correct
27	Correct	170 ms	22060 KB	Output is correct
28	Correct	149 ms	22092 KB	Output is correct

Subtask #3
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Incorrect	1 ms	364 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	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	38 ms	5900 KB	Output is correct
5	Correct	155 ms	22272 KB	Output is correct
6	Correct	168 ms	22232 KB	Output is correct
7	Correct	159 ms	22256 KB	Output is correct
8	Incorrect	1 ms	332 KB	Too many ways to get from 0 to 2, should be 2 found no less than 3
9	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1108 KB	Output is correct
7	Correct	150 ms	22044 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	6 ms	1204 KB	Output is correct
13	Correct	170 ms	22060 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	3 ms	724 KB	Output is correct
17	Correct	64 ms	12060 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	43 ms	5792 KB	Output is correct
21	Correct	163 ms	22020 KB	Output is correct
22	Correct	149 ms	22060 KB	Output is correct
23	Correct	152 ms	22048 KB	Output is correct
24	Correct	149 ms	22004 KB	Output is correct
25	Correct	86 ms	12072 KB	Output is correct
26	Correct	61 ms	12076 KB	Output is correct
27	Correct	170 ms	22060 KB	Output is correct
28	Correct	149 ms	22092 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Incorrect	1 ms	364 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	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1108 KB	Output is correct
7	Correct	150 ms	22044 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	6 ms	1204 KB	Output is correct
13	Correct	170 ms	22060 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	3 ms	724 KB	Output is correct
17	Correct	64 ms	12060 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	43 ms	5792 KB	Output is correct
21	Correct	163 ms	22020 KB	Output is correct
22	Correct	149 ms	22060 KB	Output is correct
23	Correct	152 ms	22048 KB	Output is correct
24	Correct	149 ms	22004 KB	Output is correct
25	Correct	86 ms	12072 KB	Output is correct
26	Correct	61 ms	12076 KB	Output is correct
27	Correct	170 ms	22060 KB	Output is correct
28	Correct	149 ms	22092 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Incorrect	1 ms	364 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Submission #794687

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0