# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
329958 | oolimry | 족보 (KOI18_family) | C++14 | 1 ms | 492 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>
using namespace std;
struct tree{
int n, k, root;
vector<int> child[305];
vector<int> stuff[305];
int vis[305];
void init(){
for(int i = 1;i <= n;i++){
vis[i] = false;
}
}
void dfs(int u){
if(vis[u]) return;
vis[u] = true;
if(u <= k){
stuff[u] = {u};
return;
}
for(int v : child[u]){
dfs(v);
for(int x : stuff[v]) stuff[u].push_back(x);
}
}
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... |