제출 #605922

#제출 시각아이디문제언어결과실행 시간메모리
605922polya기지국 (IOI20_stations)C++14
0 / 100
872 ms516 KiB
#include "stations.h" #include <vector> using namespace std; vector<int> adj[1004]; vector<int> labels; int cnt = 0; void dfs(int nn) { if (labels[nn] != -1) return; labels[nn] = cnt++; for (auto &i : adj[nn]) dfs(i); } vector<int> label(int n, int k, vector<int> u, vector<int> v) { labels.resize(n, -1); for (int i=0; i<n-1; i++) { adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]); } for (int i=0; i<n; i++) { if (adj[i].size() != 2) dfs(i); } return labels; } int find_next_station(int s, int t, std::vector<int> c) { if (s < t) return s+1; else 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...