Submission #421123

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
421123	2021-06-08T18:22:05 Z	Monchito	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	227 ms	23924 KB

supertrees

#include <iostream>
#include <vector>
#include "supertrees.h"
using namespace std;

int construct(vector<vector<int>> p){
    int N = (int)p.size(); 
    vector<vector<int>> b = vector<vector<int>>(N, vector<int>(N, 0));

    b[0][1] = 1;
    for(int i=1; i<N; i++){
        b[i][i-1] = 1;
        if(i+1 < N) b[i][i+1] = 1;
    }

    build(b);
    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	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	12 ms	1228 KB	Output is correct
7	Correct	227 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	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	12 ms	1228 KB	Output is correct
7	Correct	227 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	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	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	12 ms	1228 KB	Output is correct
7	Correct	227 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	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	12 ms	1228 KB	Output is correct
7	Correct	227 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	-