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"
#define pb push_back
using namespace std;
std::vector<int> find_routers(int l, int n, int q) {
vector<int> ans = {0};
vector<int> lastSeen(n + 1, l);
lastSeen[0] = 0;
int lastRouterIndex = 0;
for (int toFind = 1; toFind <= n - 1; toFind++)
{
int lo = lastRouterIndex + 1, hi = lastSeen[toFind + 1];
while(lo <= hi){
int mid = (lo + hi)/2;
int detected = use_detector(mid);
if(detected >= toFind) hi = mid - 1;
else lo = mid + 1;
lastSeen[detected] = min(lastSeen[detected], mid);
}
int nextRouter = lastRouterIndex + (lo - 1 - lastRouterIndex)*2;
ans.pb(nextRouter);
lastRouterIndex = nextRouter;
}
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... |