제출 #719514

#제출 시각아이디문제언어결과실행 시간메모리
719514mseebacher기지국 (IOI20_stations)C++17
10 / 100
852 ms600 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; #define MAXI (int)1e3+10 vector<int> ad[MAXI]; vector<int> labels; // 1 .. 1e3 // 1e3+1 ... 2e3 void dfs(int x,int e){ int cnt = 1; for(auto s: ad[x]){ if(s == e) continue; labels[s] = labels[x]*8+cnt-1; cnt++; dfs(s,x); } } vector<int> label(int n, int k, vector<int> u, vector<int> v) { labels.assign(n,0); for(int i = 0;i<MAXI;i++) ad[i].clear(); for(int i = 0;i<n-1;i++){ ad[u[i]].push_back(v[i]); ad[v[i]].push_back(u[i]); } labels[0] = 1; dfs(0,-1); return labels; } int find_next_station(int s, int t, std::vector<int> c) { if(c.size() == 1) return c[0]; while(t > s){ for(int i = 0;i<(int) c.size();i++){ if(t == c[i]) return c[i]; } t >>= (3); } 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...