Submission #292361

#TimeUsernameProblemLanguageResultExecution timeMemory
292361Haunted_CppThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms384 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int find_best(int n) {
	// SUBTASK #1
  int lo = 0, hi = n;
  while(lo < hi) {
    const int mid = lo + (hi - lo) / 2;
    vector<int> res = ask(mid);
    if (res[0] == 1) hi = mid;
    else lo = mid + 1;
  }
  return hi - 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...