# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
854192 | nnin | Stations (IOI20_stations) | C++14 | 507 ms | 1556 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;
vector<int> tmp, adj[1005];
int num;
void dfs(int cur, int prev, bool mx) {
if(!mx) tmp[cur] = num++;
for(int next:adj[cur]) {
if(next==prev) continue;
dfs(next, cur, !mx);
}
if(mx) tmp[cur] = num++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
std::vector<int> labels(n);
tmp.resize(n);
num = 0;
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, -1, 0);
for(int i=0;i<n;i++) labels[i] = tmp[i];
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if(s<c[0]) {
if(t<s) return c[c.size()-1];
for (int i=0;i<c.size()-1;i++) if(t<=c[i]) return c[i];
return c[c.size()-1];
} else {
if(t>s) return c[0];
for (int i=c.size()-1;i>=1;i--) if(t>=c[i]) 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... |