Submission #432599

#TimeUsernameProblemLanguageResultExecution timeMemory
432599salehStations (IOI20_stations)C++17
0 / 100
3053 ms2097156 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 1000 + 23; vector<int> g[MAXN]; vector<int> labels; int cnt = 0; void dfs(int v, int p = -1) { labels[v] = cnt++; for (auto i : g[v]) if (i != p) dfs(i, v); } vector<int> label(int n, int k, vector<int> u, vector<int> v) { labels.resize(n); for (int i = 0; i < n - 1; i++) { g[u[i]].push_back(v[i]), g[v[i]].push_back(u[i]); } for (int i = 0; i < n; i++) if (g[i].size() == 1) dfs(i); return labels; } int find_next_station(int s, int t, vector<int> c) { if (s < t) return s + 1; return s - 1; }
#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...