Submission #412972

#TimeUsernameProblemLanguageResultExecution timeMemory
412972SuhaibSawalha1Stations (IOI20_stations)C++17
0 / 100
5 ms420 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; vector<vector<int>> adj; vector<int> lables; int cnt; void dfs (int u = 0, int p = -1) { for (int v : adj[u]) { if (v ^ p) { dfs(v, u); } } lables[u] = cnt++; } vector<int> label(int n, int k, vector<int> u, vector<int> v) { adj.assign(n, {}); lables.resize(n); cnt = 0; for (int i = 0; i < n - 1; ++i) { adj[u[i]].push_back(v[i]); } dfs(); return lables; } int find_next_station(int s, int t, vector<int> c) { return s - (t < s) + (t > s); }
#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...