# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
408373 | muhammad_hokimiyon | 기지국 (IOI20_stations) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
const int N = 1e3 + 7;
int d[N];
vector<int> v[N];
void dfs(int x, int p)
{
for(auto y : v[x]){
if(y == p)continue;
d[y] = d[x] + 1;
dfs(y, x);
}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
std::vector<int> labels(n);
for(int i = 0; i < n - 1; i++){
int x = u[i], y = v[i];
v[x].push_back(y);
v[y].push_back(x);
}
int st = 0;
for(int i = 1; i < n; i++){
if((int)v[i].size() < (int)v[st].size()){
st = i;
}
}
dfs(st, st);
for(int i = 0; i < n; i++){
labels[i] = d[i];
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
for(auto x : c){
if(s < t && x < s)return x;
if(s > t && x > s)return x;
}
assert(0);
}