Submission #316070

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

using namespace std;

int find_best(int n) {
  /// subtask 1
  int l = 0, r = n - 1;
  while (l <= r) {
    int m = (l + r) / 2;
    vector<int> v = ask(m);
    if (v[0] == 0 && v[1] == 0) {
      return m;
    }
    if (v[0] == 1) {
      r = m - 1;
    } else {
      l = m + 1;
    }
  }
  assert(0);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...