제출 #606073

#제출 시각아이디문제언어결과실행 시간메모리
606073polya기지국 (IOI20_stations)C++14
0 / 100
3118 ms2097152 KiB
#include "stations.h" #define MAXN 1000 std::vector<int> adj[MAXN], labels; void dfs(int v, int p, int d) { labels[v] = d; for (int i : adj[v]) if (i != p) dfs(i, v, d + 1); } std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { for (int i = 0; i < n - 1; i++) { adj[u[i]].push_back(v[i]); adj[v[i]].push_back(u[i]); } labels.resize(n); for (int i = 0; i < n; i++) { if(adj[i].size() == 1) { dfs(i, -1, 0); return labels; } } return labels; } int find_next_station(int s, int t, std::vector<int> c) { return s < t ? s + 1 : 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...