#include<bits/stdc++.h>
#include "stations.h"
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
vector<int>label(int n,int k,vector<int>u,vector<int>v){
vector<int>l(n);
vector<int>adj[n];
for(int i=0;i<n-1;i++){
adj[u[i]].pb(v[i]);
adj[v[i]].pb(u[i]);
}
int mx=0,root=0;
for(int i=0;i<n;i++){
if((int)adj[i].size()>mx){
mx=(int)adj[i].size();
root=i;
}
}
int cur=0,g=0;
function <void(int,int)> dfs=[&](int x,int p){
l[x]=g*1000+cur;
cur++;
for(auto y:adj[x]){
if(y!=p){
dfs(y,x);
}
}
};
for(auto j:adj[root]){
g++;
cur=0;
dfs(j,root);
}
return l;
}
int find_next_station(int s,int t,vector<int>c){
if(s==0){
int ans=c[0];
for(int i:c){
if(i/1000==t/1000){
ans=i;
break;
}
}
return ans;
}
if(t==0||s>t){
return c[0];
}
return c.back();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
576 KB |
Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=2004 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
680 KB |
Invalid labels (values out of range). scenario=0, k=1000, vertex=2, label=1001 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
352 ms |
924 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
564 ms |
684 KB |
Output is correct |
2 |
Correct |
429 ms |
692 KB |
Output is correct |
3 |
Incorrect |
370 ms |
684 KB |
Wrong query response. |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
317 ms |
928 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |