#include "routers.h"
#define pb push_back
using namespace std;
std::vector<int> find_routers(int l, int n, int q) {
vector<int> ans;
ans.pb(0);
for(int i = 1; i < n; ++i){
int g = ans.back();
int l = g+1;
int r = l;
int idx = -1;
while(l <= r){
int mid = (l+r)/2;
int dist = use_detector(mid);
if(dist > i-1){
r = mid-1;
} else{
idx = mid;
l = mid+1;
}
}
int z = idx+idx-g;
ans.pb(z);
}
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... |