# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
718475 | baojiaopisu | Stations (IOI20_stations) | C++14 | 1214 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 <vector>
#include <algorithm>
using namespace std;
const int N = 1e3 + 10;
#define pb push_back
vector<int> ans;
int Time = 0;
vector<int> g[N];
void dfs(int u, int par, int t) {
if(!t) ans[u] = ++Time;
for(auto v : g[u]) {
if(v != par) {
dfs(v, par, t ^ 1);
}
}
if(t) ans[u] = ++Time;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for(int i = 0; i < n; i++) {
g[u[i]].pb(v[i]);
g[v[i]].pb(u[i]);
}
ans.resize(n);
dfs(0, -1, 0);
return ans;
}
int find_next_station(int s, int t, vector<int> c) {
sort(c.begin(), c.end());
if(c.size() == 1) return c[0];
if(s < c[0]) {
int ans = c[0];
for(int i = 0; i < c.size() - 1; i++) {
if(t > c[i]) ans = c[i + 1];
}
return ans;
} else {
int ans = c[0];
for(int i = 1; i < c.size(); i++) {
if(t >= c[i]) ans = c[i];
}
return ans;
}
}
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... |