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;
// #define int long long
const int N=1e3+100;
vector<int> ma[N];
vector<int> labels;
void dfs(int x,int v,int p)
{
	labels[x]=v;
	for(auto y:ma[x])
	{
		if(y==p)continue;
		dfs(y,(v*8ll)+y,x);
	}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	labels.resize(n,0);
	for(int i=0;i<(n);i++)ma[i].clear(),labels[i]=i;
	for(int i=0;i<(n-1);i++)
	{
		ma[u[i]].push_back(v[i]);
		ma[v[i]].push_back(u[i]);
	}
	dfs(0,0,-1);
	return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
	int last=t;
	while(t>0)
	{
		t=t/8;
		if(t==s)
			return last;
		last=t;
	}
	return (s/8);
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |