Submission #828809

#TimeUsernameProblemLanguageResultExecution timeMemory
828809Minindu206Stations (IOI20_stations)C++14
0 / 100
613 ms640 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; vector<int> vals; int t = 0; void dfs(vector<vector<int>> &adj,int node, int p) { t++; for (auto a : adj[node]) { if (a != p) dfs(adj, a, node); } vals[node] = t++; } vector<int> label(int n, int k, vector<int> u, vector<int> v) { vector<vector<int>> adj(n + 1); for (int i = 0; i < n - 1; i++) { adj[u[i]].push_back(v[i]); adj[v[i]].push_back(u[i]); } vals.resize(n, 0); dfs(adj, 0, -1); // for (int i = 0; i < n; i++) // cout << vals[i] << "\n"; // cout << '\n'; return vals; } int find_next_station(int s, int t, vector<int> c) { if (c.back() < s) reverse(c.begin(), c.end()); for (int x: c) if (min(s, x) <= t && t <= max(s, x)) return x; return c.back(); }
#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...