# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
718266 | duchuy297 | Stations (IOI20_stations) | C++17 | 952 ms | 668 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 <vector>
#include<bits/stdc++.h>
using namespace std;
const int N = 1005;
vector<int> adj[N];
int cnt;
vector<int> res;
void dfs (int u, int p, int lv) {
if (lv == 0) res[u] = cnt++;
for (auto v : adj[u]) {
if (v == p) continue;
dfs(v,u,lv^1);
}
if (lv == 1) res[u] = cnt++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
cnt = 0;
res.resize(n);
for (int i=0; i<n; i++) adj[i].clear();
for (int i=0; i<n-1; i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
dfs (0,0,0);
// for (auto u : res) cout << u << ' ';
return res;
}
int find_next_station(int s, int t, vector<int> c) {
sort (c.begin(),c.end());
if (s < c[0]) { // in
if (t < s) return c.back(); // father
// ti[s] >= t
for (int i=0; i<(int)c.size()-1; i++) {
if (c[i] >= t) return c[i];
}
return c.back();
}
else { // out
if (t > s) return c[0]; // father
// to[s] >= t
for (int i=1; i<c.size(); i++) {
if (c[i] <= t) 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... |