Submission #823126

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
823126	2023-08-12T08:17:16 Z	Sohsoh84	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	186 ms	22040 KB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 10;

#define sep		' '
#define debug(x)	cerr << #x << ": " << x << endl;

int f[MAXN], sz[MAXN], L[MAXN], f2[MAXN];

vector<vector<int>> answer;

inline void add(int i, int j) {
	answer[i][j] = answer[j][i] = 1;
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n, 0);
		answer.push_back(row);
	}

	vector<int> roots;
	for (int i = 0; i < n; i++) {
		f[i] = i;
		int lst = i;
		for (int j = 0; j < i; j++)
			if (p[i][j] == 1)
				lst = j;

		if (lst != i) add(lst, i), f[i] = f[lst];
		else roots.push_back(i);
	}

	int m = roots.size();
	for (int i = 0; i < m; i++) {
		f2[i] = i;	

		int lst = i;
		for (int j = 0; j < i; j++)
			if (p[roots[i]][roots[j]] == 2)
				lst = j;

		if (lst != i) {
			add(roots[i], roots[lst]);
			f2[i] = f2[lst];
			L[f2[i]] = i;
		} else L[i] = i;

		sz[f2[i]]++;
	}

	for (int i = 0; i < m; i++) {
		if (L[i] && L[i] != i) {
			add(roots[i], roots[L[i]]);
		}

		if (sz[i] == 2) {
			assert(false);
			return 0;
		}
	}

	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			if (f[i] == f[j] && p[i][j] != 1) return 0;
			if (f[i] != f[j] && f2[f[i]] == f2[f[j]] && p[i][j] != 2) return 0;
			if (f2[f[i]] != f2[f[j]] && p[i][j] != 0) return 0;
		}
	}

	build(answer);
	return 1;
}

Subtask #1

11.0 / 11.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	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	7 ms	1108 KB	Output is correct
7	Correct	174 ms	22016 KB	Output is correct

Subtask #2

0 / 10.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	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	7 ms	1108 KB	Output is correct
7	Correct	174 ms	22016 KB	Output is correct
8	Correct	0 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	0 ms	212 KB	Output is correct
12	Correct	7 ms	1108 KB	Output is correct
13	Correct	186 ms	22040 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	3 ms	800 KB	Output is correct
17	Correct	67 ms	12052 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Incorrect	24 ms	3208 KB	Answer gives possible 0 while actual possible 1
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.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	0 ms	212 KB	Output is correct
4	Runtime error	1 ms	468 KB	Execution killed with signal 6
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	0 ms	276 KB	Output is correct
4	Incorrect	18 ms	3220 KB	Answer gives possible 0 while actual possible 1
5	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.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	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	7 ms	1108 KB	Output is correct
7	Correct	174 ms	22016 KB	Output is correct
8	Correct	0 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	0 ms	212 KB	Output is correct
12	Correct	7 ms	1108 KB	Output is correct
13	Correct	186 ms	22040 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	3 ms	800 KB	Output is correct
17	Correct	67 ms	12052 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Incorrect	24 ms	3208 KB	Answer gives possible 0 while actual possible 1
21	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.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	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	7 ms	1108 KB	Output is correct
7	Correct	174 ms	22016 KB	Output is correct
8	Correct	0 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	0 ms	212 KB	Output is correct
12	Correct	7 ms	1108 KB	Output is correct
13	Correct	186 ms	22040 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	3 ms	800 KB	Output is correct
17	Correct	67 ms	12052 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Incorrect	24 ms	3208 KB	Answer gives possible 0 while actual possible 1
21	Halted	0 ms	0 KB	-