#include "routers.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_routers(int l, int n, int q) {
pair <int, int> p[n + 1];
int prev = 1;
vector <int> ans;
for(int i = 0 ; i < n - 1 ; i++){
int l = prev, r = l;
int tmp = -1;
while(l <= r){
int mid = (l + r) >> 1;
if(use_detector(mid) != i)r = mid - 1;
else{
tmp = mid;
l = mid + 1;
}
}
p[i] = {prev, tmp};
prev = tmp + 1;
}
p[n - 1] = {prev, l};
vector <int> v; v.push_back(0);
for(int i = 1 ; i < n ; i++){
pair <int, int> cur = p[i], prev = p[i - 1];
int prv = v.back();
v.push_back(cur.first - prv + prev.second - 1);
}
return v;
}
# | 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... |