제출 #1230253

#제출 시각아이디문제언어결과실행 시간메모리
1230253sethodFinding Routers (IOI20_routers)C++20
100 / 100
1 ms584 KiB
#include "routers.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_routers(int l, int n, int q) {
  vector<int> ans(n);
  ans[0] = 0;
  vector<int> road(l + 1, -1);
  for(int i = 1; i < n; i++){
    int lft = 1;
    int r = l;
    int pos = -1;
    while(lft <= r){
      int m = (lft + r) / 2;
      if(road[m] == -1) road[m] = use_detector(m);
      if(road[m] >= i){ 
        r = m - 1;
        pos = m;
      }
      else lft = m + 1;
    }
    int tmp = pos - ans[i - 1];
		ans[i] = pos + (tmp - 1) - 1;
  }
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...