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 <vector>
#include <bits/stdc++.h>
using namespace std;
std::vector<int> label(int n, int k, std::vector<int> eu, std::vector<int> ev) {
std::vector<int> labels(n);
iota(labels.begin(), labels.end(), 0);
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
for (int i : c) cout << i << ' ';
cout << '\n';
if (s > t) {
for (int i : c) {
if (i < s) {
return i;
}
}
} else {
int sub = t;
while (true) {
if (sub == 0) {
sub = -1;
break;
}
if (sub / 2 == s) break;
sub /= 2;
}
if (sub != -1) {
return s / 2;
}
for (int i : c) {
if (i < s) {
return i;
}
}
}
assert(false);
}
# | 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... |