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 <bits/stdc++.h>
using namespace std;
#define MAXI (int)1e3+10
vector<int> ad[MAXI];
vector<int> labels;
void dfs(int x,int e,int tiefe){
labels[x] = tiefe;
for(auto s: ad[x]){
if(s == e) continue;
dfs(s,x,tiefe++);
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
labels.assign(n,0);
for(int i = 0;i<n-1;i++){
ad[u[i]].push_back(v[i]);
ad[v[i]].push_back(u[i]);
}
int start = 0;
for(int i = 0;i<n;i++){
if(ad[i].size() == 1) start = i;
}
dfs(start,-1,0);
vector<int> dummy = labels;
return dummy;
}
int find_next_station(int s, int t, std::vector<int> c) {
if(s > t) return c[0];
return c[1];
}
# | 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... |