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;
vector<int> adj[1005];
void dfs(int cur, int prev, int num, vector<int>& l) {
l[cur] = num;
for(int next:adj[cur]) {
if(next==prev) continue;
dfs(next, cur, num+1, l);
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
for(int i=0;i<n-1;i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
for(int i=0;i<n;i++) {
if(adj[i].size()==1) {
dfs(i, -1, 0, labels);
break;
}
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if(t>s) return s+1;
else return s-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... |