# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336025 | richyrich | Stations (IOI20_stations) | C++17 | 978 ms | 1900 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 = 1e4+3;
const int inf = 1e9;
int ans[N], timer, vis[N];
vector<vector<int>> adj(N);
void dfs(int x, int par) {
vis[x] = 1;
for(int y : adj[x]) {
if(y==par || vis[y]) continue;
dfs(y, x);
}
ans[x] = timer;
timer++;
return;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
timer = 0;
for(int i = 0; i < n; i++) {
adj[i].clear();
vis[i] = 0;
ans[i] = 0;
}
for(int i = 0; i < u.size(); i++) {
adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]);
}
for(int i = 0; i < n; i++) {
if(adj[i].size()==1) {
dfs(i, -1);
break;
}
}
std::vector<int> labels(n);
for(int i = 0; i < n; i++) labels[i] = ans[i];
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
int n = c.size();
if(s > t) return c[0];
else return c[n-1];
}
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... |