# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
342382 | Ta180m | Stations (IOI20_stations) | C++17 | 891 ms | 1108 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>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
constexpr int MX = 1e3+5;
int cnt = 1;
vector<int> labels, G[MX];
void dfs(int u, int p) {
for (int v : G[u]) if (v != p) dfs(v, u);
labels[u] = cnt++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
for (int i = 0; i < n-1; ++i) {
G[u[i]].push_back(v[i]);
G[v[i]].push_back(u[i]);
}
labels.resize(n);
dfs(0, -1);
for (int i = 0; i < n; ++i) G[i].clear();
// for (int x : labels) cout << x << '\n';
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if (t <= c[0]) return c[0];
for (int i = 1; i < c.size(); ++i) {
if (t > c[i-1] && t <= c[i]) return c[i];
}
// cout << s << ' ' << t;
// for (int x : c) cout << ' ' << x;
// cout << '\n';
return c.back();
}
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... |