# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
652991 | mychecksedad | Stations (IOI20_stations) | C++17 | 799 ms | 656 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;
#define pb push_back
vector<int> label(int n, int k, vector<int> u, vector<int> v){
int timer = 0, tin[n], tout[n];
vector<vector<int>> g(n);
for(int i = 0; i < n-1; ++i) g[u[i]].pb(v[i]), g[v[i]].pb(u[i]);
function<void(int, int)> dfs = [&](int v, int p){
tin[v] = ++timer;
for(int u: g[v]){
if(u != p) dfs(u, v);
}
};
dfs(0, 0);
vector<int> l;
for(int i = 0; i < n; ++i) l.pb(tin[i]);
return l;
}
int find_next_station(int s, int t, vector<int> c){
for(int p: c){
if(p==t) return t;
}
int par = c[0];
if(t <= par)
return par;
for(int i = 1; i < c.size() - 1; ++i){
if(c[i] <= t && t <= c[i + 1]){
return c[i];
}
}
return par;
}
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... |