Submission #434290

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
434290	2021-06-20T21:32:15 Z	moyindavid	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	232 ms	23924 KB

supertrees

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

using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
    vector<vector<int>> z(n, vector<int>(n, 0));
    for(int i=0;i<n-1;i++){
        for(int j=0;j<n;j++){
            if(i+1==j){
                z[i][j]=1;
                z[j][i]=1;
            }
        }
    }
	build(z);
	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	280 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	9 ms	1216 KB	Output is correct
7	Correct	232 ms	23924 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	280 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	9 ms	1216 KB	Output is correct
7	Correct	232 ms	23924 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	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	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	280 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	9 ms	1216 KB	Output is correct
7	Correct	232 ms	23924 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	280 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	9 ms	1216 KB	Output is correct
7	Correct	232 ms	23924 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	-