# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373764 | lohacho | Construction of Highway (JOI18_construction) | C++14 | 795 ms | 22636 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 NS = (int)1e5 + 4;
int n, c[NS];
vector<int> way[NS];
int sz[NS], in[NS], incnt, up[NS], pr[NS];
pair<int, int> que[NS];
vector<pair<int, int>> block;
void dfs_sz(int x, int from){
sz[x] = 1; pr[x] = from;
for(auto&nxt:way[x]){
if(nxt == from){
continue;
}
dfs_sz(nxt, x);
sz[x] += sz[nxt];
if(way[x][0] == from || sz[way[x][0]] < sz[nxt]){
swap(way[x][0], nxt);
}
}
}
void dfs_hld(int x, int from){
in[x] = incnt++;
for(auto&nxt:way[x]){
if(nxt == from){
continue;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |