Submission #294664

#	Time	Username	Problem	Language	Result	Execution time	Memory
294664		ASDF123	The Big Prize (IOI17_prize)	C++14	20 / 100	76 ms	384 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;

int find_best(int n) {
  int pos = 0;
  
  int q = 0;
  
  while (1) {
    vi pos_res = ask(pos);q++;
    
    assert(q <= 10000);
    
    if (pos_res[0] + pos_res[1] == 0) {
      return pos;
    }
    int l = pos, r = n;
    while (r - l > 1) {
      int mid = (l + r) >> 1;
      vi mid_res = ask(mid);q++;
      assert(q <= 10000);
      if (pos_res[0] == mid_res[0] && pos_res[1] == mid_res[1]) {
        l = mid;
      } else {
        r = mid;
      }
    }
    pos = l + 1;
  }           
  // can't be here
  for (int i = 0; i < n; i++) {
		vi res = ask(i);
		if(res[0] + res[1] == 0)
			return i;
	}
	return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 80