# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
347035 | Pety | Finding Routers (IOI20_routers) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
vector<int> find_routers (int l, int n, int q) {
vector<int>p;
p.resize(n);
for (int i = 1; i < n; i++) {
int st = p[i - 1], dr = l, poz = 0;
while (st <= dr) {
int mij = (st + dr) / 2;
if (use_detector(mij) == i - 1) {
st = mij + 1;
poz = mij;
}
else
dr = mij - 1;
}
p[i] = p[i - 1] + 2* (poz - p[i - 1]);
}
return p;
}
/*int main () {
return 0;
}*/