#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int nx=1e3+5;
int in[nx], out[nx], lvl[nx], cnt, pa;
vector<int> res, d[nx];
void dfs(int u, int p)
{
in[u]=++cnt;
lvl[u]=lvl[p]+1;
for (auto v:d[u]) if (v!=p) dfs(v, u);
out[u]=cnt;
if (lvl[u]%2) res[u]=in[u];
else res[u]=1000+out[u];
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
cnt=-1;
for (int i=0; i<n; i++) d[i].clear();
res.resize(n);
for (int i=0; i<n-1; i++) d[u[i]].push_back(v[i]), d[v[i]].push_back(u[i]);
lvl[0]=0;
dfs(0, 0);
return res;
}
int find_next_station(int s, int t, std::vector<int> c) {
if (c.size()==1) return c[0];
if (t>=1000) t-=1000;
if (s<1000)
{
for (auto &x:c) x-=1000;
if (s==0) for (auto x:c) if (t<=x) return x+1000;
pa=c.back();
//cout<<"here "<<s<<' '<<pa<<' '<<t<<'\n';
for (int i=0; i<c.size()-1; i++) if (s<=t&&t<=c[i]) return c[i]+1000;
return pa+1000;
}
else
{
s-=1000;
pa=c.front();
for (int i=c.size()-1; i>0; i--) if (c[i]<=t&&t<=s) return c[i];
return pa;
}
}
Compilation message
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:39:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
39 | for (int i=0; i<c.size()-1; i++) if (s<=t&&t<=c[i]) return c[i]+1000;
| ~^~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
580 KB |
Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=1009 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
552 KB |
Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=1511 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
604 KB |
Invalid labels (duplicates values). scenario=1, label=1863 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
620 ms |
684 KB |
Output is correct |
2 |
Correct |
415 ms |
684 KB |
Output is correct |
3 |
Incorrect |
0 ms |
344 KB |
Invalid labels (duplicates values). scenario=1, label=1003 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
604 KB |
Invalid labels (duplicates values). scenario=1, label=1997 |
2 |
Halted |
0 ms |
0 KB |
- |