#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
int n;
vector<int> lb;
bool find (int u, int p, int t) {
if (u == t) {
return 1;
}
for (int v : adj[u]) {
if (v ^ p && find(v, u, t)) {
return 1;
}
}
return 0;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
::n = n;
adj.clear();
adj.resize(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]);
}
iota(lb.begin(), lb.end(), 0);
return lb;
}
int find_next_station(int s, int t, vector<int> c) {
return find(c[0], s, t) ? c[0] : c[1];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
4 ms |
864 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
6 ms |
1280 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
4 ms |
936 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
940 ms |
756 KB |
Output is correct |
2 |
Runtime error |
2 ms |
992 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
4 ms |
1180 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |