# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
550593 | krit3379 | Stations (IOI20_stations) | C++17 | 3120 ms | 1329236 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;
#include"stations.h"
#define N 100005
int st[N],en[N],sz;
vector<int> g[N];
void dfs(int s,int f){
st[s]=++sz;
for(auto x:g[s]){
if(x==f)continue;
dfs(x,s);
}
en[s]=sz;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v){
int i,a,b;
vector<int> vec;
vec.push_back(0);
for(i=0;i<=n;i++)g[i].clear();
for(i=1;i<n;i++){
a=u[i],b=v[i];
g[a].push_back(b);
g[b].push_back(a);
vec.push_back(i);
}
sz=0;
dfs(0,-1);
return vec;
}
int find_next_station(int s, int t,vector<int> c){
if(st[s]<=st[t]&&st[t]<=en[s])for(auto x:c)if(st[x]<=st[t]&&st[t]<=en[x])return x;
else for(auto x:c)if(st[x]<st[s])return 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |