# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
173133 | Akashi | Construction of Highway (JOI18_construction) | C++14 | 391 ms | 107016 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;
const int N = 1e5 + 5;
int n;
int a[N], H[N], TT[N], sz[N], Next[N], x[N], y[N];
bool viz[N];
vector <int> v[N];
deque <pair <int, int> > L[N];
vector <pair <int, int> > aux, tmp;
vector <int> val;
void adfs(int nod = 1){
sz[nod] = 1;
for(auto &it : v[nod]){
TT[it] = nod; H[it] = H[nod] + 1;
adfs(it);
if(sz[it] > sz[v[nod][0]]) swap(it, v[nod][0]);
}
}
void bdfs(int nod = 1){
if(v[nod].empty()) return ;
Next[v[nod][0]] = Next[nod];
bdfs(v[nod][0]);
for(int i = 1; i < v[nod].size() ; ++i){
Next[v[nod][i]] = v[nod][i];
bdfs(v[nod][i]);
}
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... |