#include "stations.h"
#include <bits/stdc++.h>
#ifdef LOCAL
#include "stub.cpp"
#endif // LOCAL
#define f first
#define s second
#define pb push_back
using namespace std;
const int N = 2e5 + 10;
int sz[N], p[N], timer;
vector<int> a[N];
int cypher(int a, int b){
return a * 1000 + (b - 1);
}
pair<int, int> decyper(int num){
return {num / 1000, num % 1000 + 1};
}
void dfs(int u, int pr){
sz[u] = 1;
p[u] = timer++;
for(auto v : a[u])
if(pr != v){
// dfs(v, u);
sz[u] += sz[v];
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> lb;
lb.resize(n);
for(int i = 0; i < n - 1; ++i){
a[u[i]].pb(v[i]);
a[v[i]].pb(u[i]);
}
dfs(0, -1);
for(int i = 0; i < n; ++i)
lb[i] = cypher(p[i], sz[i]);
return lb;
}
int find_next_station(int s, int t, vector<int> c) {
// pair<int, int> s1 = decyper(s);
// pair<int, int> t1 = decyper(t);
// int pr = 0;
// vector<pair<int, int>> p;
// for(auto v : c){
// pair<int, int> c1 = decyper(v);
// if(c1.f == s1.f - 1)
// pr = v;
// p.pb(c1);
// }
// sort(p.begin(), p.end());
//// cout << s1.f << " " << s1.s << endl;
//// cout << t1.f << " " << t1.s << endl;
// if(t1.f < s1.f || t1.f >= s1.f + s1.s)
// return pr;
//// cout << 1 << endl;
// for(int i = p.size() - 1; i >= 0; --i)
// if(t1.f >= p[i].f)
// return cypher(p[i].f, p[i].s);
exit(1);
// return cypher(p[0].f, p[0].s);
}
/*
1
5 1000000
0 1
1 2
1 3
2 4
2
2 0 1
1 3 3
9
1
3
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
5112 KB |
Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=-1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
10 ms |
5156 KB |
Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=-1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
7 ms |
5112 KB |
Invalid labels (values out of range). scenario=0, k=1000000, vertex=1, label=-1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
4972 KB |
Invalid labels (values out of range). scenario=0, k=1000000000, vertex=1, label=-1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
5112 KB |
Invalid labels (values out of range). scenario=0, k=1000000000, vertex=1, label=-1 |
2 |
Halted |
0 ms |
0 KB |
- |