#include "stations.h"
#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusive
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
using ll=long long;
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>;
long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
vector<int> label(int n, int k, vector<int> U, vector<int> V) {
vector<vector<int>> v(n, vector<int>());
FOR(i,0,n-2) v[U[i]].eb(V[i]), v[V[i]].eb(U[i]);
vector<int> C(n, 0);
int r = 0;
FOR(i,0,n-1) if(siz(v[i]) > siz(v[r])) r = i;
function<void(int,int,int)>dfs=[&](int x,int p,int co) {
C[x] = co;
for(auto i:v[x]) if(i^p) dfs(i, x, co + 1);
};
C[r] = 1e6;
ll co = 0;
for(auto i:v[r]) dfs(i, r, co), co += 1000;
return C;
}
int find_next_station(int s, int t, vector<int> c) {
if(s == 1e6) {
return t / 1000 * 1000;
} else {
if(s / 1000 == t / 1000) {
if(s > t) return *min_element(all(c));
else return *max_element(all(c));
} else {
return *min_element(all(c));
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
492 KB |
Invalid labels (values out of range). scenario=0, k=1000, vertex=0, label=1000000 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
364 KB |
Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=1000000 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
587 ms |
884 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1144 ms |
756 KB |
Output is correct |
2 |
Correct |
738 ms |
756 KB |
Output is correct |
3 |
Incorrect |
707 ms |
1004 KB |
Wrong query response. |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
567 ms |
1020 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |