#include <bits/stdc++.h>
#include "routers.h"
using namespace std;
vector<int> memo;
int search (int i, int n, int k) {
int l = 0, r = n, ans;
while (l <= r) {
int mid = (l + r) >> 1;
if (memo[mid] == -1) memo[mid] = use_detector(mid);
if (memo[mid] >= k) {
ans = mid;
r = mid - 1;
} else {
l = mid + 1;
}
}
return 2 * (ans - 1) - i;
}
vector<int> find_routers (int l, int n, int q) {
vector<int> ans;
ans.push_back(0);
memo.assign(l + 1, -1);
memo[0] = 0;
while (ans.size() != n) {
int route = search(ans.back(), l, (int) ans.size());
ans.push_back(route);
}
return ans;
}
