#include "routers.h" using namespace std; std::vector<int> find_routers(int len, int n, int q) { vector<int> memorization(len + 1, -1), ans_({0}); for(int i=0;i<n-1;++i) { int l = 0, r = len, ans = -1; while(l <= r) { int mid = (l + r) / 2; if(memorization[mid] == -1) { memorization[mid] = use_detector(mid); } if(memorization[mid] <= i) { l = mid + 1; } else { ans = mid; r = mid - 1; } } int dt = ans - ans_.back(); --dt; ans_.push_back(ans_.back() + (dt * 2)); } return ans_; }