#include<bits/stdc++.h>
#include "stations.h"
#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;
const int N=1009;
int la[N];
vector<int>v[N];int re=-1;
void dfs(int x,int p)
{
la[x]=++re;
for(auto it:v[x])
{
if(it==p)continue;
dfs(it,x);
}
}
vector<int> label(int n, int k,vector<int> U, vector<int> V) {
vector<int> l(n);
for(int i=0;i<n-1;i++)
{
v[U[i]].pb(V[i]);
v[V[i]].pb(U[i]);
}
int root=0;
for(int i=0;i<n;i++)if(v[i].size()==1)root=i;
dfs(root,-1);
for(int i=0;i<n;i++)l[i]=la[i];
memset(la,0,sizeof la);for(int i=0;i<n;i++)v[i].clear();
return l;
}
int find_next_station(int s, int t, std::vector<int> c) {
if(s<t)
{
return c[1];
}
return c[0];
}
/*
1
5 1000000
0 1
1 2
1 3
2 4
2
2 0 1
1 3 3
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
392 KB |
Invalid labels (values out of range). scenario=2, k=1000, vertex=41, label=1004 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
328 KB |
Invalid labels (values out of range). scenario=1, k=1000, vertex=0, label=1005 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
542 ms |
528 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
883 ms |
504 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
534 ms |
508 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |