답안 #1087725

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1087725	2024-09-13T06:58:57 Z	T0p_	슈퍼트리 잇기 (IOI20_supertrees)	C++14	21 / 100	146 ms	24144 KB

supertrees

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

using namespace std;

const int N = 1000;

int tree_parent[N];

int find_tree_parent(int u) {
	return tree_parent[u] = (u == tree_parent[u])
		? u
		: find_tree_parent(tree_parent[u]); 
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> ans(n, vector<int>(n));

	for (int i=0 ; i<n ; i++) {
		for (int j=0 ; j<n ; j++) {
			if (p[i][j] == 3) {
				return 0;
			}
		}
	}

	for (int i=0 ; i<n ; i++) {
		tree_parent[i] = i;
	}

	for (int i=0 ; i<n ; i++) {
		for (int j=i+1 ; j<n ; j++) {
			if (p[i][j] == 1) {
				int ii = find_tree_parent(i);
				int jj = find_tree_parent(j);

				if (ii != jj) {
					tree_parent[ii] = jj;
					ans[i][j] = ans[j][i] = 1;
				}
			}
		}
	}

	for (int i=0 ; i<n ; i++) {
		for (int j=i+1 ; j<n ; j++) {
			if (p[i][j] == 0) {
				int ii = find_tree_parent(i);
				int jj = find_tree_parent(j);

				if (ii == jj) {
					return 0;
				}
			}
		}
	}
	
	build(ans);
	return 1;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1116 KB	Output is correct
7	Correct	117 ms	22108 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1116 KB	Output is correct
7	Correct	117 ms	22108 KB	Output is correct
8	Correct	0 ms	600 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	5 ms	1112 KB	Output is correct
13	Correct	114 ms	22096 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	60 ms	14096 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	30 ms	6284 KB	Output is correct
21	Correct	141 ms	24144 KB	Output is correct
22	Correct	146 ms	23892 KB	Output is correct
23	Correct	130 ms	24072 KB	Output is correct
24	Correct	115 ms	24144 KB	Output is correct
25	Correct	51 ms	14160 KB	Output is correct
26	Correct	49 ms	14168 KB	Output is correct
27	Correct	116 ms	24008 KB	Output is correct
28	Correct	142 ms	23892 KB	Output is correct

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Incorrect	0 ms	600 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Incorrect	0 ms	348 KB	Too few ways to get from 0 to 1, should be 2 found 0
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1116 KB	Output is correct
7	Correct	117 ms	22108 KB	Output is correct
8	Correct	0 ms	600 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	5 ms	1112 KB	Output is correct
13	Correct	114 ms	22096 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	60 ms	14096 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	30 ms	6284 KB	Output is correct
21	Correct	141 ms	24144 KB	Output is correct
22	Correct	146 ms	23892 KB	Output is correct
23	Correct	130 ms	24072 KB	Output is correct
24	Correct	115 ms	24144 KB	Output is correct
25	Correct	51 ms	14160 KB	Output is correct
26	Correct	49 ms	14168 KB	Output is correct
27	Correct	116 ms	24008 KB	Output is correct
28	Correct	142 ms	23892 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Incorrect	0 ms	600 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1116 KB	Output is correct
7	Correct	117 ms	22108 KB	Output is correct
8	Correct	0 ms	600 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	5 ms	1112 KB	Output is correct
13	Correct	114 ms	22096 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	60 ms	14096 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	30 ms	6284 KB	Output is correct
21	Correct	141 ms	24144 KB	Output is correct
22	Correct	146 ms	23892 KB	Output is correct
23	Correct	130 ms	24072 KB	Output is correct
24	Correct	115 ms	24144 KB	Output is correct
25	Correct	51 ms	14160 KB	Output is correct
26	Correct	49 ms	14168 KB	Output is correct
27	Correct	116 ms	24008 KB	Output is correct
28	Correct	142 ms	23892 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Incorrect	0 ms	600 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-