# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402184 | victoriad | Finding Routers (IOI20_routers) | C++14 | 2 ms | 332 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 "routers.h"
using namespace std;
std::vector<int> find_routers(int l, int n, int q) {
std::vector<int> ans(n);
ans[0]=0;
for(int i=1;i<n;i++){
int low=ans[i-1]+1,hi=l,r;
while(low<=hi){
int mid=(low+hi)/2;
if(use_detector(mid)==i){
hi=mid-1;
r=mid;
}
else{
low=mid +1;
}
}
ans[i]=2*r-2-ans[i-1];
}
return ans;
}
Compilation message (stderr)
# | 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... |