# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
620050 | 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 = 1;
void dfs(const vector<vector<int>>& adj, vector<bool>& vis, vector<int>& labels, int s, const int& m, const int& or) {
if (s == or) labels[s] = 0;
vis[s] = true;
if (adj[s].size() == 1) {
if(adj[s][0] != or) labels[s] = labels[adj[s][0]] + m;
else labels[s] = cur++;
}
else {
if(vis[adj[s][0]]) {
if(adj[s][0] != or) labels[s] = labels[adj[s][0]] + m;
else labels[s] = cur++;
}
else {
if(adj[s][1] != or) labels[s] = labels[adj[s][1]] + m;
else labels[s] = cur++;
}
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
cur = 1;
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 = 0;
for (int i = 0; i < n; i++) if(adj[i].size() > 2) s = i;
vector<int> labels(n);
vector<bool> vis(n, false);
dfs(adj, vis, labels, s, m, s);
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
if (!s) {
int m = c.size();
int mod = t % m;
for (auto u: c) {
if ((u % m) == mod) return u;
}
}
if (c.size() == 1) return c[0];
if (!c[0]) {
if (!t) return c[0];
else return c[1];
}
if (!c[1]) {
if (!t) return c[1];
else return c[0];
}
int m;
if (c[0] < s) {
m = s - c[0];
if ((s % m) == (t % m)) {
if (t < s) return c[0];
return c[1];
}
return c[0];
}
m = s - c[1];
if ((s % m) == (t % m)) {
if (t < s) return c[1];
return c[0];
}
return 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;
// }