| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1353427 | nikulid | Connecting Supertrees (IOI20_supertrees) | C++20 | 63 ms | 22012 KiB |
#include "supertrees.h"
#include <vector>
using namespace std;
int construct(vector<vector<int>> p) {
int n = p.size();
// assume test case 1.
vector<vector<int>> answer(n, vector<int>(n,0));
answer[0] = vector<int>(n,1);
answer[0][0] = 0;
for(int i=1; i<n; i++){
answer[i][0]=1;
}
build(answer);
return 1;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
