Submission #351286

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
351286	2021-01-19T20:18:41 Z	BlancaHM	Connecting Supertrees (IOI20_supertrees)	C++14	40 / 100	284 ms	22380 KB

supertrees

#include <iostream>
#include <vector>
#include <unordered_map>
#include "supertrees.h"
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;

int root(int a, vector<int> & parent) {
	if (a == parent[a])
		return a;
	return parent[a] = root(parent[a], parent);
}

void merge(int i, int j, vector<int> & parent, vector<int> & rnk, int & numCCs) {
	int root_i = root(i, parent), root_j = root(j, parent);
	if (root_i == root_j) return;
	numCCs--;
	if (rnk[i] != rnk[j]) {
		if (rnk[i] > rnk[j]) parent[root_j] = parent[root_i];
		else parent[root_i] = parent[root_j];
	} else {
		parent[root_i] = parent[root_j];
		rnk[j]++;
	}
}

int construct(vvi p) {
	int N = (int) p.size(), numCCs = N;
	vector<int> parent(N), rnk(N, 0);
	for (int i = 0; i < N; i++)
		parent[i] = i;
	for (int i = 0; i < N; i++) {
		for (int j = i+1; j < N; j++) {
			if (p[i][j]) {
				if (p[i][j] == 3) {
					return 0;
				}
				merge(i, j, parent, rnk, numCCs);
			} else if (root(i, parent) == root(j, parent))
				return 0;
		}
	}
	unordered_map<int, int> roots;
	int c = 0;
	for (int i = 0; i < N; i++) {
		if (parent[i] == i)
			roots[i] = c++;
	}
	vvi CCs(numCCs, vi());
	for (int i = 0; i < N; i++)
		CCs[roots[root(i, parent)]].push_back(i);

	vi allTwos, rest;
	vvi result(N, vi(N, 0));
	int con;
	bool twos;
	for (int i = 0; i < numCCs; i++) {
		if ((int) CCs[i].size() == 1) continue;
		allTwos.clear();
		rest.clear();
		for (int j = 0; j < (int) CCs[i].size(); j++) {
			twos = true;
			for (int k = 0; k < (int) CCs[i].size(); k++) {
				if (k == j) continue;
				con = p[CCs[i][j]][CCs[i][k]];
				if (con == 1)
					twos = false;
				else if (con == 0)
					return 0;
			}
			if (twos) allTwos.push_back(CCs[i][j]);
			else rest.push_back(CCs[i][j]);
		}
		for (int i = 0; i < (int) allTwos.size()-1; i++)
			result[allTwos[i]][allTwos[i+1]] = result[allTwos[i+1]][allTwos[i]] = 1;
		for (int i = 0; i < (int) rest.size()-1; i++)
			result[rest[i]][rest[i+1]] = result[rest[i+1]][rest[i]] = 1;
		if (rest.empty()) {
			if ((int) allTwos.size() <= 2) return 0;
			result[allTwos[0]][allTwos[(int) allTwos.size()-1]] = result[allTwos[(int) allTwos.size()-1]][allTwos[0]] = 1;
		} else if (allTwos.size())
			result[allTwos[0]][rest[0]] = result[rest[0]][allTwos[0]] = result[rest[0]][allTwos[(int) allTwos.size()-1]] = result[allTwos[(int) allTwos.size()-1]][rest[0]] = 1;
	}
	build(result);
	return 1;
}

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	11 ms	1260 KB	Output is correct
7	Correct	256 ms	22124 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	11 ms	1260 KB	Output is correct
7	Correct	256 ms	22124 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	11 ms	1260 KB	Output is correct
13	Correct	265 ms	22380 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	5 ms	620 KB	Output is correct
17	Correct	122 ms	8172 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	0 ms	364 KB	Output is correct
20	Correct	62 ms	5868 KB	Output is correct
21	Correct	264 ms	22112 KB	Output is correct
22	Correct	258 ms	22124 KB	Output is correct
23	Correct	267 ms	22124 KB	Output is correct
24	Correct	258 ms	22240 KB	Output is correct
25	Correct	123 ms	8172 KB	Output is correct
26	Correct	115 ms	8172 KB	Output is correct
27	Correct	269 ms	22124 KB	Output is correct
28	Correct	259 ms	22380 KB	Output is correct

Subtask #3
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	11 ms	1260 KB	Output is correct
9	Correct	256 ms	22252 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	11 ms	1260 KB	Output is correct
13	Correct	260 ms	22112 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	0 ms	364 KB	Output is correct
16	Correct	5 ms	620 KB	Output is correct
17	Correct	118 ms	8300 KB	Output is correct
18	Correct	0 ms	364 KB	Output is correct
19	Correct	0 ms	364 KB	Output is correct
20	Correct	0 ms	364 KB	Output is correct
21	Correct	62 ms	5868 KB	Output is correct
22	Correct	262 ms	22128 KB	Output is correct
23	Correct	261 ms	22124 KB	Output is correct
24	Correct	267 ms	22124 KB	Output is correct
25	Correct	120 ms	12268 KB	Output is correct
26	Correct	114 ms	8172 KB	Output is correct
27	Correct	262 ms	22124 KB	Output is correct
28	Correct	269 ms	22124 KB	Output is correct
29	Correct	116 ms	12256 KB	Output is correct

Subtask #4
0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	64 ms	5868 KB	Output is correct
5	Correct	275 ms	22124 KB	Output is correct
6	Correct	257 ms	22144 KB	Output is correct
7	Correct	284 ms	22124 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	67 ms	5912 KB	Output is correct
10	Correct	261 ms	22112 KB	Output is correct
11	Correct	262 ms	22124 KB	Output is correct
12	Correct	271 ms	22112 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	0 ms	364 KB	Output is correct
16	Incorrect	64 ms	5868 KB	Too few ways to get from 0 to 24, should be 2 found 1
17	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	11 ms	1260 KB	Output is correct
7	Correct	256 ms	22124 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	11 ms	1260 KB	Output is correct
13	Correct	265 ms	22380 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	5 ms	620 KB	Output is correct
17	Correct	122 ms	8172 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	0 ms	364 KB	Output is correct
20	Correct	62 ms	5868 KB	Output is correct
21	Correct	264 ms	22112 KB	Output is correct
22	Correct	258 ms	22124 KB	Output is correct
23	Correct	267 ms	22124 KB	Output is correct
24	Correct	258 ms	22240 KB	Output is correct
25	Correct	123 ms	8172 KB	Output is correct
26	Correct	115 ms	8172 KB	Output is correct
27	Correct	269 ms	22124 KB	Output is correct
28	Correct	259 ms	22380 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	0 ms	364 KB	Output is correct
31	Correct	0 ms	364 KB	Output is correct
32	Correct	0 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	0 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	11 ms	1260 KB	Output is correct
37	Correct	256 ms	22252 KB	Output is correct
38	Correct	0 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	11 ms	1260 KB	Output is correct
41	Correct	260 ms	22112 KB	Output is correct
42	Correct	0 ms	364 KB	Output is correct
43	Correct	0 ms	364 KB	Output is correct
44	Correct	5 ms	620 KB	Output is correct
45	Correct	118 ms	8300 KB	Output is correct
46	Correct	0 ms	364 KB	Output is correct
47	Correct	0 ms	364 KB	Output is correct
48	Correct	0 ms	364 KB	Output is correct
49	Correct	62 ms	5868 KB	Output is correct
50	Correct	262 ms	22128 KB	Output is correct
51	Correct	261 ms	22124 KB	Output is correct
52	Correct	267 ms	22124 KB	Output is correct
53	Correct	120 ms	12268 KB	Output is correct
54	Correct	114 ms	8172 KB	Output is correct
55	Correct	262 ms	22124 KB	Output is correct
56	Correct	269 ms	22124 KB	Output is correct
57	Correct	116 ms	12256 KB	Output is correct
58	Correct	1 ms	364 KB	Output is correct
59	Correct	1 ms	364 KB	Output is correct
60	Correct	5 ms	748 KB	Output is correct
61	Correct	116 ms	8300 KB	Output is correct
62	Correct	1 ms	364 KB	Output is correct
63	Correct	1 ms	364 KB	Output is correct
64	Correct	0 ms	364 KB	Output is correct
65	Incorrect	64 ms	5868 KB	Too few ways to get from 1 to 11, should be 2 found 1
66	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	11 ms	1260 KB	Output is correct
7	Correct	256 ms	22124 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	11 ms	1260 KB	Output is correct
13	Correct	265 ms	22380 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	5 ms	620 KB	Output is correct
17	Correct	122 ms	8172 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	0 ms	364 KB	Output is correct
20	Correct	62 ms	5868 KB	Output is correct
21	Correct	264 ms	22112 KB	Output is correct
22	Correct	258 ms	22124 KB	Output is correct
23	Correct	267 ms	22124 KB	Output is correct
24	Correct	258 ms	22240 KB	Output is correct
25	Correct	123 ms	8172 KB	Output is correct
26	Correct	115 ms	8172 KB	Output is correct
27	Correct	269 ms	22124 KB	Output is correct
28	Correct	259 ms	22380 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	0 ms	364 KB	Output is correct
31	Correct	0 ms	364 KB	Output is correct
32	Correct	0 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	0 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	11 ms	1260 KB	Output is correct
37	Correct	256 ms	22252 KB	Output is correct
38	Correct	0 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	11 ms	1260 KB	Output is correct
41	Correct	260 ms	22112 KB	Output is correct
42	Correct	0 ms	364 KB	Output is correct
43	Correct	0 ms	364 KB	Output is correct
44	Correct	5 ms	620 KB	Output is correct
45	Correct	118 ms	8300 KB	Output is correct
46	Correct	0 ms	364 KB	Output is correct
47	Correct	0 ms	364 KB	Output is correct
48	Correct	0 ms	364 KB	Output is correct
49	Correct	62 ms	5868 KB	Output is correct
50	Correct	262 ms	22128 KB	Output is correct
51	Correct	261 ms	22124 KB	Output is correct
52	Correct	267 ms	22124 KB	Output is correct
53	Correct	120 ms	12268 KB	Output is correct
54	Correct	114 ms	8172 KB	Output is correct
55	Correct	262 ms	22124 KB	Output is correct
56	Correct	269 ms	22124 KB	Output is correct
57	Correct	116 ms	12256 KB	Output is correct
58	Correct	1 ms	364 KB	Output is correct
59	Correct	1 ms	364 KB	Output is correct
60	Correct	1 ms	364 KB	Output is correct
61	Correct	64 ms	5868 KB	Output is correct
62	Correct	275 ms	22124 KB	Output is correct
63	Correct	257 ms	22144 KB	Output is correct
64	Correct	284 ms	22124 KB	Output is correct
65	Correct	0 ms	364 KB	Output is correct
66	Correct	67 ms	5912 KB	Output is correct
67	Correct	261 ms	22112 KB	Output is correct
68	Correct	262 ms	22124 KB	Output is correct
69	Correct	271 ms	22112 KB	Output is correct
70	Correct	1 ms	364 KB	Output is correct
71	Correct	1 ms	364 KB	Output is correct
72	Correct	0 ms	364 KB	Output is correct
73	Incorrect	64 ms	5868 KB	Too few ways to get from 0 to 24, should be 2 found 1
74	Halted	0 ms	0 KB	-

Submission #351286

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 19.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
19.0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0