#include "stations.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "stub.cpp"
#endif
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
vector <vector <int>> graph(1003);
int timer, num[1003], mxnum[1003];
void dfs(int v, int p = 0){
num[v] = ++timer;
mxnum[v] = num[v];
for(auto to : graph[v]){
if(to != p){
dfs(to, v);
mxnum[v] = max(mxnum[v], mxnum[to]);
}
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v){
timer = -1;
for(int i = 0; i < n; i++){
graph[i].clear();
}
vector <int> labels(n);
for(int i = 0; i < sz(u); i++){
graph[u[i]].pb(v[i]);
graph[v[i]].pb(u[i]);
}
dfs(0);
for(int i = 0; i < n; i++){
labels[i] = num[i];
}
return labels;
}
int find_next_station(int s, int t, vector<int> c){
if(sz(c) == 1) return c[0];
if(t < c[0]) return c[0];
if(c[0] < s){
if(mxnum[s] < t) return c[0];
else{
auto it = ub(all(c), t);
return *(--it);
}
}
else{
auto it = ub(all(c), t);
return *(--it);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
582 ms |
1012 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
448 ms |
864 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
745 ms |
992 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1025 ms |
864 KB |
Output is correct |
2 |
Incorrect |
655 ms |
1072 KB |
Wrong query response. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
569 ms |
992 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |