# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078741 | Muhammad_Aneeq | Connecting Supertrees (IOI20_supertrees) | C++17 | 145 ms | 22136 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 <vector>
#include <iostream>
using namespace std;
int const MAXN=1000;
bool ed[MAXN][MAXN]={};
bool vis[MAXN]={};
bool in[MAXN]={};
vector<int>ans,cur;
vector<int>all;
bool check(int u)
{
for (auto i:cur)
{
if (ed[i][u]==0)
return 0;
}
return 1;
}
void dfs(int u,int p=-1)
{
all.push_back(u);
cur.push_back(u);
vis[u]=1;
in[u]=1;
for (int i=0;i<MAXN;i++)
{
if (u==i)
continue;
if (!vis[i]&&ed[u][i]&&check(i))
dfs(i,u);
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... |