# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
800549 | Liudas | Stations (IOI20_stations) | C++17 | 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 <bits/stdc++.h>
#define endl "\n"
using namespace std;
void dfs(int head, int par, vector<vector<int>> &tree, int &col, vector<int> &labels){
for(int i : tree[head]){
if(i != par){
dfs(i, head, tree, col, labels);
}
}
labels[head] = col ++;
}
int find_next_station(int s, int t, vector<int> labels){
sort(labels.begin(), labels.end());
for(int i : labels){
}
if(t >= labels.back()){
return labels.back();
}
for(int i : labels){
if(t <= i){
return i;
}
}
}
vector<int> label(int N, int K, vector<int> U, vector<int> V){
vector<vector<int>> tree(N);
for(int i = 0; i < N-1; i ++){
tree[U[i]].push_back(V[i]);
tree[V[i]].push_back(U[i]);
}
vector<int> labels(N);
iota(labels.begin(), labels.end());
int col = 0;
for(int i = 0; i < N; i ++)if(tree[i].size() > 2)
dfs(i, -1, tree, col, labels);
return labels;
}