# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1230104 | lioow | Finding Routers (IOI20_routers) | C++20 | 0 ms | 0 KiB |
#include "routers.h"
#include <vector>
#include <cassert>
#include <cstdio>
#include <algorithm>
using namespace std;
#define pb push_back
std::vector<int> find_routers(int l, int n, int q) {
vector<int>ans(n+1);
ans[0]=0;
repp(i,1,n-1){
int l=ans[i-1]+1;
int r=n-1;
int an=-1;
while(l<=r){
int mid=(l+r)/2;
int nw=use_detector(mid);
if(x>=i){
an=mid;
r=mid-1;
} else {
if(x==i-1) lol=ans[i-1]+2*lol;
l=mid+1;
}
}
ans[i]=lol;
}
return ans;
}