Submission #329535

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
329535	2020-11-21T13:42:24 Z	pggp	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	252 ms	23532 KB

supertrees

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

using namespace std;

int construct(vector< vector < int > > p){
	int n = p.size();
	vector < vector < int > > b;
	b.resize(n);
	for (int i = 0; i < n; ++i)
	{
		b[i].resize(n);
		for (int j = 0; j < n; ++j)
		{
			b[i][j] = 0;
			if(j == i + 1 or i == j + 1){
				b[i][j] = 1;
			}
		}
	}
	build(b);
	return 1;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	10 ms	1260 KB	Output is correct
7	Correct	252 ms	23532 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	10 ms	1260 KB	Output is correct
7	Correct	252 ms	23532 KB	Output is correct
8	Incorrect	1 ms	364 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

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	364 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

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	364 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	10 ms	1260 KB	Output is correct
7	Correct	252 ms	23532 KB	Output is correct
8	Incorrect	1 ms	364 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	10 ms	1260 KB	Output is correct
7	Correct	252 ms	23532 KB	Output is correct
8	Incorrect	1 ms	364 KB	Too many ways to get from 0 to 1, should be 0 found no less than 1
9	Halted	0 ms	0 KB	-