# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696743 | garam1732 | Stations (IOI20_stations) | C++14 | 940 ms | 908 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> adj[1010];
int in[1010], out[1010], cnt;
void dfs(int here, int par) {
in[here] = ++cnt;
for(int there : adj[here]) {
if(there == par) continue;
dfs(there, here);
}
out[here] = cnt;
}
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; i++) adj[i].clear();
cnt = -1;
for(int i = 0; i < u.size(); i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
dfs(0, 0);
for(int i = 0; i < n; i++) labels[i] = in[i]*1000+out[i];
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if(s/1000 <= t/1000 && t%1000 <= s%1000) {
for(int i = 0; i < c.size(); i++) if(c[i]/1000 > t/1000) return c[i-1];
return *c.rbegin();
}
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... |