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 <routers.h>
#include <bits/stdc++.h>
using namespace std;
int i, lo, hi, mid;
/*int l, n, q;
int use_detector(int x) {
int y;
printf("USEDETECTOR(%d)", x);
scanf("%d", &y);
return y;
}*/
vector<int> find_routers(int l, int n, int q) {
vector<int> ans(n);
ans[0] = 0;
for (i=1; i < n; ++i) {
lo = ans[i-1]+2;
hi = l;
while (lo < hi) {
mid = (lo+hi)/2;
if (use_detector(mid) >= i) {
hi = mid;
}
else {
lo = mid+1;
}
}
ans[i] = 2*(lo-1)-ans[i-1];
}
return ans;
}
# | 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... |