제출 #1280327

#제출 시각아이디문제언어결과실행 시간메모리
1280327Jawad_Akbar_JJ기지국 (IOI20_stations)C++17
0 / 100
395 ms540 KiB
#include <iostream> #include <vector> #include "stations.h" using namespace std; vector<int> nei[1005], lbl; int cur; void dfs(int u, int p){ for (int i : nei[u]){ if (i == p) continue; dfs(i, u); } lbl[u] = cur++; } vector<int> label(int n, int k, vector<int> u, vector<int> v){ for (int i=0;i<n-1;i++){ nei[v[i]].push_back(u[i]); nei[u[i]].push_back(v[i]); } lbl.resize(n); cur = 0; dfs(0, 0); for (int i=0;i<n;i++) nei[i].clear(); return lbl; } int find_next_station(int s, int t, vector<int> c){ for (int i=1;i<c.size();i++) if (t < c[i]) return c[i-1]; 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...