Submission #319711

#TimeUsernameProblemLanguageResultExecution timeMemory
319711Drew_Stations (IOI20_stations)C++14
0 / 100
897 ms1132 KiB
#include "stations.h" #include <vector> #include <bits/stdc++.h> using namespace std; #define pb push_back std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { std::vector<int> labels(n, -1); vector<vector<int>> adj(n); for (int i = 0; i < n-1; ++i) { adj[u[i]].pb(v[i]); adj[v[i]].pb(u[i]); } int ctr = 0; function<void (int)> dfs = [&](int node) { labels[node] = ctr++; for (int to : adj[node]) { if (labels[to] == -1) dfs(to); } }; dfs(0); return labels; } int find_next_station(int s, int t, std::vector<int> c) { if (s < t) { for (int x : c) if (x > s && x <= t) { 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...