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;
vector<int> find_routers(int len, int n, int q) {
vector<int> ans;
ans.push_back(0);
int lft = 0;
for(int cur = 1; cur < n; cur++){
again:
int curlen = ceil(((len - lft) / (n - cur)) * 0.95);
int l = lft, r = min(lft + curlen, len) + 1;
while(r - l > 1){
int m = l + (r - l) / 2;
if(use_detector(m) >= cur) r = m;
else l = m;
}
if(r == min(lft + curlen, len) + 1){
lft = r - 1;
goto again;
}
l = r - 1;
lft = l + (l - ans.back());
ans.push_back(lft);
}
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... |