# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1118569 | pera | Traffickers (RMI18_traffickers) | C++17 | 1719 ms | 159884 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;
int main(){
int n;
cin >> n;
vector<vector<int>> g(n + 1);
for(int i = 1;i < n;i ++){
int u , v;
cin >> u >> v;
g[u].emplace_back(v);
g[v].emplace_back(u);
}
int timer = 0;
const int LOG = 15;
vector<int> in(n + 1) , out(n + 1) , d(n + 1);
vector<vector<int>> up(n + 1 , vector<int>(LOG));
function<void(int , int)> dfs = [&](int u , int p){
up[u][0] = p;
d[u] = d[p] + 1;
in[u] = ++timer;
for(int v : g[u]){
if(v != p){
dfs(v , u);
}
}
out[u] = timer;
};
dfs(1 , 1);
for(int bit = 1;bit < LOG;bit ++){
for(int u = 1;u <= n;u ++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |