#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
template<typename T>
using Prior = priority_queue<T>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
const int maxn = 1000 + 5;
int lstvis = 0;
vector<int> adj[maxn], lab;
void dfs(int now, int lst) {
for (auto x : adj[now]) {
if (x != lst) lab[x] = lab[now] + 1, lstvis = x, dfs(x, now);
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
lab.resize(n);
for (int i = 0; i < n-1; ++i) {
adj[u[i]].eb(v[i]), adj[v[i]].eb(u[i]);
}
dfs(0, -1), lab[lstvis] = 0, dfs(lstvis, -1);
return lab;
}
int find_next_station(int s, int t, vector<int> c) {
return s > t ? c.front() : c.back();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1554 ms |
2097156 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3034 ms |
468 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1758 ms |
2097152 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
892 ms |
876 KB |
Output is correct |
2 |
Runtime error |
1403 ms |
2097156 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2967 ms |
2097156 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |