| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1230275 | djsksbrbf | Finding Routers (IOI20_routers) | C++20 | 0 ms | 0 KiB | 
#include "routers.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_routers(int ln, int n, int q) {
	vector <int> v(n);v[0] = 0;
	
	int dp[ln + 1];memset(dp, -1, sizeof(dp));
	for(int i = 0 ; i < n ; i++){
		int l = 0, r = ln;
		
		int ans = -1;
		while(l <= r){
			int mid = (l + r) >> 1;
			
			if(dp[mid] == -1)dp[mid] = use_detector(mid);
			
			if(dp[mid] < i)l = mid + 1;
			else{
				tmp  =mid;
				r = mid - 1;
			}
		}
		v[i] = (ans) + (ans - v[i - 1] - 1) - 1;
	}
	
	return v;
}
