#include "stations.h"
#include <iostream>
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
int inf = 1e9 + 7;
vector<vector<int>> g;
vector<int> label(int n, int k, vector<int> v, vector<int> u) {
vector<int> res(n);
for (int i = 0; i < n; i++) {
res[i] = i;
}
return res;
}
int find_next_station(int s, int t, vector<int> c) {
if (t < s) {
return (s - 1) / 2;
}
int cur = t;
int last = -1;
while (cur > s) {
last = cur;
cur = (cur - 1) / 2;
}
if (cur == s) {
return last;
} else {
return (s - 1) / 2;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |