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;
const int N = 1e3 + 7;
vector < int > lb, adj[N], used(N);
int num;
void dfs( int v ) {
used[v] = 1;
lb[v] = num++;
for ( auto u: adj[v] ) {
if ( !used[u] ) {
dfs(u);
}
}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
for ( int i = 0; i < n - 1; i++ ) {
int x = u[i], y = v[i];
adj[x].push_back(y);
adj[y].push_back(x);
}
lb.assign(n, 0);
dfs(0);
return lb;
}
int find_next_station(int s, int t, std::vector<int> c) {
int pr = c[0];
for ( auto x: c ) {
if ( x == pr ) {
continue;
}
if ( x > t ) {
break;
}
pr = x;
}
return pr;
}
# | 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... |