Submission #1054986

#TimeUsernameProblemLanguageResultExecution timeMemory
1054986Gromp15Stations (IOI20_stations)C++17
5 / 100
557 ms788 KiB
#include <bits/stdc++.h> #include "stations.h" using namespace std; bool line = 1; std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { 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]); } int r = -1; for (int i = 0; i < n; i++) { if (adj[i].size() == 1) r = i; line &= adj[i].size() <= 2; } if (line) { vector<int> ans(n); int t = 0; auto dfs = [&](auto&& s, int v, int p) -> void { ans[v] = t++; for (int u : adj[v]) if (u != p) s(s, u, v); }; dfs(dfs, r, -1); return ans; } return {}; } int find_next_station(int s, int t, std::vector<int> c) { for (int x : c) if ((x-s)*(x-t) <= 0) return x; assert(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...