Submission #520714

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
520714	2022-01-30T22:33:22 Z	peti1234	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	164 ms	22012 KB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;

int construct(vector<vector<int>> p) {
    // 1
	int n = p.size();
	
	vector<vector<int>> valasz;
	valasz.resize(n);
	for (int i=0; i<n; i++) valasz[i].resize(n);
	
	for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            valasz[i][j]=(abs(i-j)==1 ? 1 : 0);
        }
	}

	build(valasz);
	return 1;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	7 ms	1100 KB	Output is correct
7	Correct	164 ms	22012 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	7 ms	1100 KB	Output is correct
7	Correct	164 ms	22012 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	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	7 ms	1100 KB	Output is correct
7	Correct	164 ms	22012 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	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	7 ms	1100 KB	Output is correct
7	Correct	164 ms	22012 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	-