# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383193 | danielcm585 | Stations (IOI20_stations) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
int find_next_station(int S, int T, vector<int> C) {
if (C.size() == 1) return C[0];
if (S < C[0]) {
for (int i = 0; i < C.size(); i++) {
if (S <= T && T <= C[i]) return C[i];
}
return C.back();
}
else {
for (int i = C.size()-1; i >= 0; i--) {
if (C[i] <= T && T <= S) return C[i];
}
return C[0];
}
}