#include "stations.h"
#ifndef EVAL
#include "stub.cpp"
#endif // EVAL
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 3e5+12,INF=1e9+7;
vector <int> g[N],asd;
int cnt;
void dfs(int x,int p,int s){
if (s %2 == 0){
asd[x] = ++cnt;
}
for (int to : g[x]){
if (to == p)continue;
dfs(to,x,s+1);
}
if (s&1)asd[x] = ++cnt;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for (int i = 0; i < n; i++) {
g[u[i]].pb(v[i]);
g[v[i]].pb(u[i]);
}
asd.resize(n);
dfs(0,-1,0);
asd.clear();
for (int i=0;i<n;++i)
g[i].clear();
return asd;
}
int find_next_station(int s, int t, vector<int> c) {
int mx = c[c.size()-1],i;
if (mx > s){
for (i=c.size()-1;i>=0;--i){
if (min(s,c[i]) <= t && t <= max(s,c[i]))ret c[i];
}
}
else {
for (i=0;i<c.size();++i){
if (min(s,c[i]) <= t && t <= max(s,c[i]))ret c[i];
}
}
}
Compilation message
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:63:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
63 | for (i=0;i<c.size();++i){
| ~^~~~~~~~~
stations.cpp:67:1: warning: control reaches end of non-void function [-Wreturn-type]
67 | }
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
7404 KB |
Invalid length of array as the response of 'label'. scenario=0, n=10, len=0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
7404 KB |
Invalid length of array as the response of 'label'. scenario=0, n=996, len=0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
7404 KB |
Invalid length of array as the response of 'label'. scenario=0, n=2, len=0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
7532 KB |
Invalid length of array as the response of 'label'. scenario=0, n=2, len=0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
7404 KB |
Invalid length of array as the response of 'label'. scenario=0, n=3, len=0 |
2 |
Halted |
0 ms |
0 KB |
- |