Submission #483285

# Submission time Handle Problem Language Result Execution time Memory
483285 2021-10-28T13:21:04 Z MasterTaster Connecting Supertrees (IOI20_supertrees) C++14
11 / 100
175 ms 22024 KB
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

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

	vector< vector<int> > ress;
	ress.resize(n);
	for (int i=0; i<n; i++) ress[i].resize(n);

	for (int i=0; i<n; i++) for (int j=0; j<n; j++) ress[i][j]=0;

    for (int i=0; i<n-1; i++)
    {
        ress[i][i+1]=1;
        ress[i+1][i]=1;
    }

	build(ress);
	return 1;
}
# 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 0 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 1092 KB Output is correct
7 Correct 175 ms 22024 KB Output is correct
# 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 0 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 1092 KB Output is correct
7 Correct 175 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 -
# 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 -
# 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 -
# 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 0 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 1092 KB Output is correct
7 Correct 175 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 -
# 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 0 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 1092 KB Output is correct
7 Correct 175 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 -