Submission #362785

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
362785	2021-02-04T11:32:58 Z	mathking1021	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	247 ms	24096 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;
		for(int j = 0; j < n; j++)
        {
            if(i == j - 1 || i == j + 1) row.push_back(1);
            else row.push_back(0);
        }
		answer.push_back(row);
	}
	build(answer);
	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	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	10 ms	1260 KB	Output is correct
7	Correct	247 ms	24096 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	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	10 ms	1260 KB	Output is correct
7	Correct	247 ms	24096 KB	Output is correct
8	Incorrect	0 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	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	10 ms	1260 KB	Output is correct
7	Correct	247 ms	24096 KB	Output is correct
8	Incorrect	0 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	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	10 ms	1260 KB	Output is correct
7	Correct	247 ms	24096 KB	Output is correct
8	Incorrect	0 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	-