Submission #393127

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
393127	2021-04-22T19:23:37 Z	Carmel_Ab1	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	243 ms	22024 KB

supertrees

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

typedef vector<int> vi;
typedef vector<vi> vvi;
int construct(vvi p) {
    int n = p.size();
    vvi ans(n,vi(n));

    for(int i=0; i<n-1; i++)
        ans[i][i+1]=ans[i+1][i]=1;
    build(ans);
    return 1;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 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	10 ms	1096 KB	Output is correct
7	Correct	243 ms	22024 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 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	10 ms	1096 KB	Output is correct
7	Correct	243 ms	22024 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	208 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 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	10 ms	1096 KB	Output is correct
7	Correct	243 ms	22024 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	208 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 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	10 ms	1096 KB	Output is correct
7	Correct	243 ms	22024 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	-