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<iostream>
#include<vector>
using namespace std;
#define vi vector<int>
#define vvi vector<vi>
vi label(int n, int k, vi u, vi v) {
vvi L(n);
for (int i = 0; i < n-1; i++) {
L[u[i]].push_back(v[i]);
L[v[i]].push_back(u[i]);
}
int a = -1;
for (int i = 0; i < n; i++) {if (L[i].size() == 1) {a = i; break;}}
vi L2(n, -1);
int j = 1;
while (1) {
L2[a] = j;
j++;
if (L2[L[a][0]] == -1) {
a = L[a][0]; continue;
}
if (L[a].size() == 1) break;
a = L[a][1]; continue;
}
return L2;
}
int find_next_station(int s, int t, vi c) {
if (s > t) return s-1;
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... |