#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
vector<int> vec[li],vv;
inline void dfs(int node,int ata){
vv.pb(node);
for(auto go:vec[node]){
if(go==ata)continue;
dfs(go,node);
}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> vv) {
std::vector<int> labels(n);
for(int i=0;i<n-1;i++){
vec[u[i]].pb(vv[i]);
vec[vv[i]].pb(u[i]);
}
int ind=0;
for(int i=0;i<n;i++){
if((int)vec[i].size()==1)ind=i;
}
dfs(ind,-1);
for (int i = 0; i < n; i++) {
labels[vv[i]] = i;
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
//~ cout<<s<<" :: "<<t<<endl;
if(s==t)return s;
if(t>s)return c[1];
else return c[0];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2364 ms |
2097156 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3081 ms |
1062900 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2194 ms |
2097156 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1033 ms |
24072 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3175 ms |
1677520 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |