Submission #451960

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
451960	2021-08-03T14:15:42 Z	rainboy	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	240 ms	24044 KB

supertrees

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

using namespace std;

typedef vector<int> vi;

int abs_(int a) { return a > 0 ? a : -a; }

int construct(vector<vi> pp) {
	int n = pp.size(), i, j;
	vector<vi> aa(n);

	for (i = 0; i < n; i++) {
		aa[i].resize(n);
		for (j = 0; j < n; j++)
			aa[i][j] = abs_(i - j) == 1 ? 1 : 0;
	}
	build(aa);
	return 1;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1228 KB	Output is correct
7	Correct	240 ms	24044 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1228 KB	Output is correct
7	Correct	240 ms	24044 KB	Output is correct
8	Incorrect	0 ms	204 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	0 ms	204 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	0 ms	204 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	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1228 KB	Output is correct
7	Correct	240 ms	24044 KB	Output is correct
8	Incorrect	0 ms	204 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	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1228 KB	Output is correct
7	Correct	240 ms	24044 KB	Output is correct
8	Incorrect	0 ms	204 KB	Too many ways to get from 0 to 1, should be 0 found no less than 1
9	Halted	0 ms	0 KB	-