# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
400323 | REALITYNB | Stations (IOI20_stations) | C++14 | 1156 ms | 992 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>
#include "stations.h"
using namespace std;
vector<int> label(int n ,int l , vector<int> u , vector<int> v){
vector<int> ans(n) ;
vector<int> adj[n] ;
for(int i=0;i<n-1;++i){
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
function<vector<int>(int,int,int)> dfs = [&](int a ,int p , int lvl){
vector<int> ans ;
if(lvl)
ans.push_back(a) ;
for(int x : adj[a]){
if(x!=p){
vector<int> res = dfs(x,a,lvl^1) ;
for(int x :res) ans.push_back(x) ;
}
}
if(lvl==0) ans.push_back(a) ;
return ans ;
};
vector<int> res = dfs(0,-1,1) ;
for(int i=0;i<n;i++) ans[res[i]]=i ;
return ans ;
}
int find_next_station(int u , int v , vector<int> ne){
if(u==0){
if(u<=v&&v<=ne[0]) return ne[0] ;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |