# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
535352 | 79brue | Capital City (JOI20_capital_city) | C++14 | 1036 ms | 194920 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;
typedef long long ll;
int n, k;
int arr[200002], idx[200002];
vector<int> link[200002];
vector<int> vec[200002];
int in[200002], inCnt, sz[200002];
int top[200002], depth[200002], par[200002], LCADB[200002][20];
void dfs_sz(int x, int p=-1){
sz[x] = 1;
if(p!=-1) link[x].erase(find(link[x].begin(), link[x].end(), p));
for(auto &y: link[x]){
depth[y] = depth[x] + 1;
par[y] = LCADB[y][0] = x;
dfs_sz(y, x);
sz[x] += sz[y];
if(sz[y] > sz[link[x][0]]) swap(y, link[x][0]);
}
}
void dfs_hld(int x, int p=-1){
in[x] = ++inCnt;
idx[inCnt] = x;
for(auto y: link[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... |