# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673079 | pavement | Stations (IOI20_stations) | C++17 | 0 ms | 0 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 "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
using iii = tuple<int, int, int>;
int idx, dep[1005], pre[1005], mpre[1005];
vector<int> adj[1005];
void dfs(int n, int e = -1) {
mpre[n] = pre[n] = ++idx;
for (auto u : adj[n]) if (u != e) {
dep[u] = dep[n] + 1;
dfs(u, n);
mpre[n] = max(mpre[n], mpre[u]);
}
}
int find_next_station(int s, int t, vector<int> c) {
if (s > c.back()) {
int p = c[0] + 1;
if (p <= t && t <= s) {
for (int i = 1; i < (int)c.size(); i++)
if (c[i] <= t && t < (i == (int)c.size() - 1 ? s + 1 : c[i + 1])) return c[i];
assert(0);
} else {
return c[0];
}
} else {
for (int i = 0; i < (int)c.size() - 1; i++)
if ((i == 0 ? s : c[i - 1]) < t && t <= c[i]) return c[i];
return c.back();
}
}