제출 #319938

#제출 시각아이디문제언어결과실행 시간메모리
319938nickmet2004기지국 (IOI20_stations)C++14
0 / 100
2 ms752 KiB
#include<bits/stdc++.h> #include "stations.h" using namespace std; const int N = 1505; vector<int> adj[N]; int tin[N] , tout[N] , dtime; vector<int> R; void dfs(int u , int p = -1){ R[u] =tin[u] = dtime++; for(int v : adj[u]){ if(v==p)continue; dfs(v ,u); } tout[u]= dtime; } vector<int> label(int n , int k ,vector<int> u , vector<int> v){ for(int i = 0; i < n; ++i) adj[u[i]].emplace_back(v[i]) , adj[v[i]].emplace_back(u[i]); dfs(0); R.resize(n); return R; } bool cmp(int a, int b){ return tin[a] < tin[b]; } int find_next_station(int s , int t , vector<int> c){ sort(c.begin() , c.end() , cmp); for(int u : c){ if(tin[u] <= tin[t] && tout[t] <= tout[u]) return u; } return c[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...