답안 #771883

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
771883	2023-07-03T11:14:39 Z	Alty	슈퍼트리 잇기 (IOI20_supertrees)	C++17	21 / 100	1000 ms	2097152 KB

supertrees

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

using namespace std;

int leader[1005], ranking[1005];

int Find(int n) {
	if (leader[n] != n) leader[n] = Find(leader[n]);
	return leader[n];
}

void Union(int x, int y) {
	x = Find(x), y = Find(y);
	if (ranking[x] > ranking[y]) swap(x, y);
	ranking[y] += ranking[x];
	leader[x] = y;
}

vector<int> g[1005];
bool visited[1005];
vector<int> components;

void dfs(int n) {
	visited[n] = 1;
	components.push_back(n);
	for (auto x : g[n]) {
		if (visited[x]) continue;
		dfs(n);
	}
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	for (int i = 0; i <= n; i++) {
		leader[i] = i;
		ranking[i] = 1;
	}
	vector<vector<int>> answer(n, vector<int>(n));
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			if (p[i][j] == 3) return 0;
			if (p[i][j] == 1) Union(i, j);
		}
	}
	for (int i = 0; i < n; i++) if (Find(i) != i) answer[Find(i)][i] = answer[i][Find(i)] = 1;
	for (int i = 0; i < n; i++) { 
		for (int j = i + 1; j < n; j++) {
			if (p[i][j] == 0 && Find(i) == Find(j)) return 0;
			if (p[i][j] == 2 && Find(i) == i && Find(j) == j) {
				g[i].push_back(j);
				g[j].push_back(i);
			}
		}
	}
	for (int i = 0; i < n; i++) {
		if (Find(i) != i || visited[i]) continue;
		dfs(i);
		if (components.size() == 2) return 0;
		for (auto x : components) {
			for (auto y : components) if (x != y && p[x][y] != 2) return 0;
		}
		for (int j = 0; j < components.size() - 1; j++) {
			answer[components[j]][components[j + 1]] = answer[components[j + 1]][components[j]] = 1;
		}
		if (components.size() != 1) answer[components[0]][components[components.size() - 1]] = answer[components.size() - 1][components[0]] = 1;
		components.clear();
	}
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:63:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |   for (int j = 0; j < components.size() - 1; j++) {
      |                   ~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1276 KB	Output is correct
7	Correct	157 ms	23948 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1276 KB	Output is correct
7	Correct	157 ms	23948 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	8 ms	1236 KB	Output is correct
13	Correct	153 ms	24012 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	852 KB	Output is correct
17	Correct	70 ms	14100 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	38 ms	6220 KB	Output is correct
21	Correct	157 ms	24028 KB	Output is correct
22	Correct	150 ms	23952 KB	Output is correct
23	Correct	154 ms	24012 KB	Output is correct
24	Correct	154 ms	23908 KB	Output is correct
25	Correct	64 ms	14104 KB	Output is correct
26	Correct	63 ms	14096 KB	Output is correct
27	Correct	158 ms	23952 KB	Output is correct
28	Correct	154 ms	23924 KB	Output is correct

Subtask #3
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Execution timed out	1163 ms	1762076 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #4
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	328 KB	Output is correct
2	Execution timed out	1133 ms	2097152 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1276 KB	Output is correct
7	Correct	157 ms	23948 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	8 ms	1236 KB	Output is correct
13	Correct	153 ms	24012 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	852 KB	Output is correct
17	Correct	70 ms	14100 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	38 ms	6220 KB	Output is correct
21	Correct	157 ms	24028 KB	Output is correct
22	Correct	150 ms	23952 KB	Output is correct
23	Correct	154 ms	24012 KB	Output is correct
24	Correct	154 ms	23908 KB	Output is correct
25	Correct	64 ms	14104 KB	Output is correct
26	Correct	63 ms	14096 KB	Output is correct
27	Correct	158 ms	23952 KB	Output is correct
28	Correct	154 ms	23924 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Execution timed out	1163 ms	1762076 KB	Time limit exceeded
33	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1276 KB	Output is correct
7	Correct	157 ms	23948 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	8 ms	1236 KB	Output is correct
13	Correct	153 ms	24012 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	852 KB	Output is correct
17	Correct	70 ms	14100 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	38 ms	6220 KB	Output is correct
21	Correct	157 ms	24028 KB	Output is correct
22	Correct	150 ms	23952 KB	Output is correct
23	Correct	154 ms	24012 KB	Output is correct
24	Correct	154 ms	23908 KB	Output is correct
25	Correct	64 ms	14104 KB	Output is correct
26	Correct	63 ms	14096 KB	Output is correct
27	Correct	158 ms	23952 KB	Output is correct
28	Correct	154 ms	23924 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Execution timed out	1163 ms	1762076 KB	Time limit exceeded
33	Halted	0 ms	0 KB	-

답안 #771883

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