답안 #805298

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
805298	2023-08-03T14:54:54 Z	Hydrolyzed	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	137 ms	23912 KB

supertrees

#include "supertrees.h"
#include <vector>

using namespace std;

int construct(std::vector<std::vector<int>> p) {
	int n = (int) p.size();
	vector<vector<int>> building(n, vector<int> (n, 0));
	for(int i=0; i<=n-2; ++i) {
		for(int j=i+1; j<=n-1; ++j) {
			if (p[i][j] == 0) {
				continue;
			}
			building[i][j] = 1;
			building[j][i] = 1;
			break;
		}
	}
	build(building);
	return 1;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 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	6 ms	1088 KB	Output is correct
7	Correct	133 ms	22024 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 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	6 ms	1088 KB	Output is correct
7	Correct	133 ms	22024 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	292 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	6 ms	1236 KB	Output is correct
13	Correct	137 ms	23912 KB	Output is correct
14	Incorrect	0 ms	212 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	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	Incorrect	0 ms	212 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Incorrect	0 ms	212 KB	Too few ways to get from 0 to 1, should be 2 found 1
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	212 KB	Output is correct
3	Correct	0 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	6 ms	1088 KB	Output is correct
7	Correct	133 ms	22024 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	292 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	6 ms	1236 KB	Output is correct
13	Correct	137 ms	23912 KB	Output is correct
14	Incorrect	0 ms	212 KB	Answer gives possible 1 while actual possible 0
15	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	212 KB	Output is correct
3	Correct	0 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	6 ms	1088 KB	Output is correct
7	Correct	133 ms	22024 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	292 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	6 ms	1236 KB	Output is correct
13	Correct	137 ms	23912 KB	Output is correct
14	Incorrect	0 ms	212 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-