# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
578306 | SlavicG | Stations (IOI20_stations) | C++17 | 3040 ms | 2097152 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;
const int N = 1000;
vector<int> adj[N];
int in[N], s[N], tt = 0;
void dfs(int u, int par) {
in[u] = tt++;
s[u] = 1;
for(int v: adj[u]) {
if(v == par) continue;
dfs(v, u);
s[u] += s[v];
}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
std::vector<int> labels(n);
for(int i = 0; i < n - 1; ++i) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
dfs(0, -1);
for (int i = 0; i < n; i++) {
labels[i] = 1000 * s[i] + in[i];
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
int in_s = s % 1000, in_t = t % 1000, sz_s = s / 1000, sz_t = t / 1000;
if(in_s <= in_t && in_t <= in_s + sz_s - 1) {
for(auto x: c) {
int in_c = x % 1000, sz_c = x / 1000;
if(in_c <= in_t && in_t <= in_c + sz_c - 1) return x;
}
} else {
int mn = INT_MAX, idx = 0;
for(auto x: c) {
int val = x % 1000;
if(val < mn) {
mn = val;
idx = x;
}
}
return idx;
}
}
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... |