Submission #426582

#TimeUsernameProblemLanguageResultExecution timeMemory
426582radaiosm7Finding Routers (IOI20_routers)C++17
69.65 / 100
3 ms332 KiB
#include <routers.h>
#include <bits/stdc++.h>
using namespace std;
int i, lo, hi, mid;
/*int l, n, q;

int use_detector(int x) {
  int y;
  printf("USEDETECTOR(%d)", x);
  scanf("%d", &y);
  return y;
}*/

vector<int> find_routers(int l, int n, int q) {
  vector<int> ans(n);
  ans[0] = 0;

  for (i=1; i < n; ++i) {
    lo = ans[i-1]+2;
    hi = l;

    while (lo < hi) {
      mid = (lo+hi)/2;

      if (use_detector(mid) >= i) {
        hi = mid;
      }

      else {
        lo = mid+1;
      }
    }

    ans[i] = 2*(lo-1)-ans[i-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...