# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
963854 | nguyentunglam | Connecting Supertrees (IOI20_supertrees) | C++17 | 169 ms | 24348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "supertrees.h"
#ifdef ngu
#include "grader.cpp"
#endif // ngu
#include <vector>
#include<bits/stdc++.h>
using namespace std;
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
auto valid = [&] (vector<int> a, vector<int> b, int c) {
for(int &j : a) for(int &k : b) if (p[j][k] != c) return false;
return true;
};
vector<int> vis(n), arr;
auto dfs = [&] (auto self, int u) -> void {
vis[u] = 1;
arr.push_back(u);
for(int v = 0; v < n; v++) if (!vis[v] && p[u][v] == 1) self(self, v);
};
std::vector<std::vector<int>> answer(n, vector<int> (n));
auto add = [&] (int u, int v) {
answer[u][v] = answer[v][u] = 1;
};
Compilation message (stderr)
# | 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... |