Submission #734990

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
734990	2023-05-03T10:46:20 Z	MODDI	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	167 ms	23908 KB

supertrees

#include "supertrees.h"
//#include "grader.cpp"
#include <vector>
using namespace std;
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int> > answer;
	for(int i = 0; i < n; i++){
		vector<int> row;
		row.assign(n, 0);
		if(i + 1 < n)
			row[i+1] = 1;
		if(i - 1 >= 0)
			row[i-1] = 1;
			
		answer.push_back(row);
	}
	
	build(answer);
	return 1;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1168 KB	Output is correct
7	Correct	167 ms	23908 KB	Output is correct

Subtask #2

0 / 10.0

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