Submission #439913

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
439913	2021-07-01T07:56:58 Z	QuantumK9	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	259 ms	23308 KB

supertrees

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

using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer;

	//assume st1
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n);
		for( int j = 0; j < n; j++ ){
			if( j == i-1 || j == i+1 ){
				row[j] = 1;
			}
			else{ row[j] = 0; }
		}
		answer.pb(row);
	}

	build(answer);
	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	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	13 ms	1240 KB	Output is correct
7	Correct	259 ms	23308 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	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	13 ms	1240 KB	Output is correct
7	Correct	259 ms	23308 KB	Output is correct
8	Incorrect	1 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	1 ms	292 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	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	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	13 ms	1240 KB	Output is correct
7	Correct	259 ms	23308 KB	Output is correct
8	Incorrect	1 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	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	13 ms	1240 KB	Output is correct
7	Correct	259 ms	23308 KB	Output is correct
8	Incorrect	1 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	-