Submission #808020

#TimeUsernameProblemLanguageResultExecution timeMemory
808020The_SamuraiConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
173 ms22336 KiB
#include "bits/stdc++.h"
#ifdef sunnatov
#include "grader.cpp"
#else
#include "supertrees.h"
#endif

using namespace std;

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

    vector<vector<int>> g(n, vector<int>(n));
    for (int i = 1; i < n; i++) {
        g[i][i - 1] = g[i - 1][i] = 1;
    }
    build(g);

	return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...