# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
653282 | mychecksedad | Stations (IOI20_stations) | C++17 | 980 ms | 756 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<int> l(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, int)> dfs = [&](int v, int p, int d){
if(d) l[v] = timer++;
for(int u: g[v]){
if(u != p) dfs(u, v, d^1);
}
if(!d) l[v] = timer++;
};
dfs(0, 0, 1);
return l;
}
int find_next_station(int s, int t, vector<int> c){
int m = c.size();
if (s < c[0]) {
if (s < t && t <= c[0]) {
return c[0];
}
for (int i = 1; i < m - 1; i++) {
if (c[i - 1] < t && t <= c[i]) {
return c[i];
}
}
return c[m - 1];
} else {
if (c[m - 1] <= t && t < s) {
return c[m - 1];
}
for (int i = 1; i < m - 1; i++) {
if (c[i] <= t && t < c[i + 1]) {
return c[i];
}
}
return c[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... |