답안 #301544

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
301544	2020-09-18T04:08:53 Z	jwvg0425	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	255 ms	22136 KB

supertrees

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

using namespace std;

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

	for(int i = 0; i < n - 1; i++)
		answer[i][i+1] = answer[i+1][i] = 1;

	build(answer);
	return 1;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	10 ms	1152 KB	Output is correct
7	Correct	255 ms	22136 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	10 ms	1152 KB	Output is correct
7	Correct	255 ms	22136 KB	Output is correct
8	Incorrect	0 ms	256 KB	Too many ways to get from 0 to 1, should be 0 found no less than 1
9	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	256 KB	Too many ways to get from 0 to 1, should be 0 found no less than 1
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	256 KB	Too many ways to get from 0 to 1, should be 0 found no less than 1
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	10 ms	1152 KB	Output is correct
7	Correct	255 ms	22136 KB	Output is correct
8	Incorrect	0 ms	256 KB	Too many ways to get from 0 to 1, should be 0 found no less than 1
9	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	10 ms	1152 KB	Output is correct
7	Correct	255 ms	22136 KB	Output is correct
8	Incorrect	0 ms	256 KB	Too many ways to get from 0 to 1, should be 0 found no less than 1
9	Halted	0 ms	0 KB	-