Submission #396125

#TimeUsernameProblemLanguageResultExecution timeMemory
396125snasibov05Stations (IOI20_stations)C++14
0 / 100
3071 ms280 KiB
#include "stations.h" #include <vector> #define pb push_back using namespace std; vector<int> label(int n, int k, vector<int> u, vector<int> v) { vector<int> labels(n); vector<int> ed[n]; for (int i = 0; i < n - 1; ++i) { ed[u[i]].pb(v[i]); ed[v[i]].pb(u[i]); } int prev = -1, cur = -1; for (int i = 0; i < n; ++i) { if (ed[i].size() == 1) cur = i; } int x = 1; while (true){ labels[cur] = x++; prev = cur; for (auto to : ed[cur]){ if (to != prev) { cur = to; break; } } if (prev == cur) break; } return labels; } int find_next_station(int s, int t, vector<int> c) { if (s > t){ for (auto x : c){ if (s > x) return x; } } else{ for (auto x : c){ if (s < x) return x; } } return c[0]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...