제출 #606153

#제출 시각아이디문제언어결과실행 시간메모리
606153polya기지국 (IOI20_stations)C++14
0 / 100
790 ms548 KiB
#pragma GCC optimize("O0") #include "stations.h" using namespace std; vector<int> adj[1004]; vector<int> labels; int cnt = 0; int dfs(int nn) { if (labels[nn] != 10000) return 0; labels[nn] = cnt++; for (auto &ii : adj[nn]) dfs(ii); return 0; } vector<int> label(int n, int k, vector<int> u, vector<int> v) { for (int i=0; i<n; i++) adj[i].clear(); labels.resize(n, 10000); for (int i=0; i<n-1; i++) { adj[u[i]].emplace_back(v[i]); adj[v[i]].emplace_back(u[i]); } for (int i=0; i<n; i++) { if (adj[i].size() == 1) { dfs(i); return labels;} } 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...