Submission #1092889

#TimeUsernameProblemLanguageResultExecution timeMemory
1092889huyngoStations (IOI20_stations)C++17
0 / 100
608 ms684 KiB
#include "stations.h" #include<bits/stdc++.h> using namespace std; std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { std::vector<int> labels(n); vector<vector<int>> adj(n); for (int i = 0; i < n - 1; ++i) { adj[u[i]].push_back(v[i]); adj[v[i]].push_back(u[i]); } for (int i = 0; i < n; ++i) sort(adj[i].begin(), adj[i].end()); int dtime = -1; auto dfs = [&](auto self, int u, int p) -> void { labels[u] = ++dtime; for (int v : adj[u]) if (v != p) { self(self, v, u); } }; dfs(dfs, 0, -1); return labels; } int find_next_station(int s, int t, std::vector<int> c) { if (t < s) return *min_element(c.begin(), c.end()); int id = upper_bound(c.begin(), c.end(), t) - c.begin() - 1; return c[id]; }
#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...