#include "routers.h"
#include "bits/stdc++.h"
using namespace std;
map<int , int> askd;
int ask(int i)
{
if(askd.find(i) != askd.end())
return askd[i];
return askd[i] = use_detector(i);
}
vector<int> find_routers(int l , int n , int q)
{
vector<int> ans;
ans.push_back(0);
while(ans.size() < n)
{
int st = ans.back() , en = l , i;
while(st <= en)
{
int mid = (st + en) / 2;
if(ask(mid) != ans.size() - 1)
en = mid - 1;
else
st = mid + 1 , i = mid;
}
ans.push_back(2 * i);
}
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... |