# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
619884 | sokratisi | Stations (IOI20_stations) | C++17 | 0 ms | 0 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>
using namespace std;
int cur = 0;
void dfs(int s, vector<bool>& vis, const vector<vector<int>>& adj, vector<int>& labels) {
labels[s] = cur++;
vis[s] = true;
for (auto u: adj[s]) {
if (!vis[u]) {
dfs(u, vis, adj, labels);
}
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<vector<int>> adj(n);
for (int i = 0; i < u.size(); i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
int s;
for (int i = 0; i < n; i++) if(adj[i].size() == 1) s = i;
vector<int> labels(n);
vector<bool> vis(n, false);
dfs(s);
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
if (c.size() == 1) return c[0];
if (s < t) return max(c[0], c[1]);
return min(c[0], c[1]);
}
// int main() {
// int n, k;
// scanf("%d%d", &n, &k);
// vector<int> u(n-1);
// vector<int> v(n-1);
// for (int i = 0; i < n - 1; i++) {
// scanf("%d%d", &u[i], &v[i]);
// }
// label(n, k, u, v);
// return 0;
// }