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 l, int n, int q) {
vector<int> ret(n);
int st=0;
vector<int> cut;
for(int i=0;i<n-1;i++) {
int lo=st;
int hi=l;
while (lo+1<hi) {
int mid=(lo+hi)/2;
if (use_detector(mid)==i) {
lo=mid;
}
else {
hi=mid;
}
}
cut.push_back(lo);
st=hi;
}
ret[0]=0;
for(int i=1;i<n;i++) {
ret[i]=cut[i-1]+cut[i-1]-ret[i-1];
}
return ret;
}
# | 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... |