Submission #316086

#TimeUsernameProblemLanguageResultExecution timeMemory
316086MrDominoThe Big Prize (IOI17_prize)C++14
20 / 100
1 ms384 KiB
#include <bits/stdc++.h>
#include "prize.h"

using namespace std;

mt19937 rng((long long) (new char));

int rn(int l, int r) {
  return l + rng() % (r - l + 1);
}

int rep(int l, int r) {
  if (l > r) {
    return 0;
  }
  int m = (l + r) / 2;
  vector<int> v = ask(m);
  if (v[0] == 0 && v[1] == 0) {
    return m;
  }
  if (v[0] > v[1]) {
    return rep(l, m - 1);
  } else {
    return rep(m + 1, r);
  }
}

int find_best(int n) {
  return rep(0, n - 1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...