#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
int n;
vector<int> lb, ord;
void dfs (int u, int p = -1) {
ord.push_back(u);
for (int v : adj[u]) {
if (v ^ p) {
dfs(v, u);
}
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
::n = n;
adj.assign(n, {});
lb.resize(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);
break;
}
}
for (int i = 0; i < n; ++i) {
lb[ord[i]] = i;
}
return lb;
}
int find_next_station(int s, int t, vector<int> c) {
return s > t ? c[0] : c[1];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
496 KB |
Invalid labels (duplicates values). scenario=2, label=0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
492 KB |
Invalid labels (duplicates values). scenario=3, label=0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
492 KB |
Invalid labels (duplicates values). scenario=1, label=0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
848 ms |
868 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
492 KB |
Invalid labels (duplicates values). scenario=1, label=0 |
2 |
Halted |
0 ms |
0 KB |
- |