#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,e) for (int i = s; i <= e; ++i)
#define pb push_back
typedef vector<int> vi;
const int mxn = 2e3;
int id, res[mxn];
vi neibs[mxn];
void dfs (int u, int prev) {
for (int v : neibs[u]) {
if (v==prev) continue;
dfs (v, u);
}
res[u]=id++;
}
vi label (int n, int k, vi u, vi v) {
rep (i,0,n-1) neibs[i] = vector<int>();
rep (i,0,n-2) {
neibs[u[i]].pb(v[i]);
neibs[v[i]].pb(u[i]);
}
dfs (0,-1);
vi L(n);
rep (i,0,n-1) L[i] = res[i];
return L;
}
int find_next_station (int s, int t, vi c) {
sort(c.begin(), c.end());
for (int v : c) if (v>=t) return v;
return c.back();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
328 KB |
Invalid labels (values out of range). scenario=2, k=1000, vertex=0, label=1010 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
332 KB |
Invalid labels (values out of range). scenario=1, k=1000, vertex=0, label=1989 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
577 ms |
888 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
999 ms |
664 KB |
Output is correct |
2 |
Correct |
705 ms |
656 KB |
Output is correct |
3 |
Incorrect |
772 ms |
656 KB |
Wrong query response. |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
656 ms |
740 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |