# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
431404 | Rouge_Hugo | Connecting Supertrees (IOI20_supertrees) | C++14 | 302 ms | 27952 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<bits/stdc++.h>
#include "supertrees.h"
#include <vector>
#define fi first
#define se second
#define pb push_back
using namespace std;
int n;const int N=1009;
vector<vector<int>>ans;
int pa[N],nw[N],s=0,sz[N],p[N][N],vis[N];
vector<int>v[N];vector<int>sta;
vector<int>u;
void merge(int x,int y)
{
x=pa[x];y=pa[y];
if(x==y)return;
if(sz[x]<sz[y])swap(x,y);
for(auto it:v[y])
{
sz[x]++;
v[x].pb(it);
pa[it]=x;
}
}vector<int>h;
int go(int x,int y)
{
h.clear();
sta.clear();int last=x;h.pb(x);
for(auto it:v[x])sta.pb(it);
nw[x]=++s;int three=0;
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... |