#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
vector<vector<set<int>>> rec;
int n;
vector<int> lb;
void dfs (int nd, int e, int u, int p) {
rec[nd][e].insert(u);
for (int v : adj[u]) {
if (v ^ p) {
dfs(nd, e, 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]);
}
rec.resize(n, vector<set<int>>(n));
for (int i = 0; i < n; ++i) {
for (int j : adj[i]) {
dfs(i, j, j, i);
}
}
iota(lb.begin(), lb.end(), 0);
return lb;
}
int find_next_station(int s, int t, vector<int> c) {
for (int i : c) {
if (rec[s][i].count(t)) {
return i;
}
}
return -1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
90 ms |
95212 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
453 ms |
189684 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
93 ms |
95232 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
992 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
92 ms |
95340 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |