# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
348373 | Chaska | Connecting Supertrees (IOI20_supertrees) | C++17 | 1031 ms | 30188 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"
#include <vector>
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
vector<int> g[1005],s;
bool vs[1005],y;
int pp[1005][1005];
void dfs(int u)
{
s.pb(u);
vs[u] = true;
for (int v : g[u]) if (!vs[v]) dfs(v);
}
void gg(int in,int u)
{
if (pp[in][u]==0) y = false;
vs[u] = true;
for (int v : g[u]) if (!vs[v]) gg(in,v);
}
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
std::vector<std::vector<int>> answer;
for (int i = 0; i < n; i++) {
std::vector<int> row;
row.resize(n);
answer.push_back(row);
}
for (int i=0;i<n;i++) for (int j=0;j<n;j++) if (i!=j) if (p[i][j]==1) g[i].pb(j);
for (int i=0;i<n;i++) for (int j=0;j<n;j++) pp[i][j] = p[i][j];
# | 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... |