제출 #147494

#제출 시각아이디문제언어결과실행 시간메모리
147494RafaelSusThe Big Prize (IOI17_prize)C++17
95.63 / 100
60 ms504 KiB
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

int mx = -1;
int answ = -1;

int N;

int bSearch(int l, int r, int L, int R){
  l = max(l, 0);
  r = min(r, N);
  if (l >= r) return -1;
  if (L + R == mx) return -1;
  int mid = l + r >> 1;

  for (int i = mid; i < r; i++){
    vector <int> a = ask(i);
    if (a[0] + a[1] == mx){
      int x = bSearch(l, mid, L, a[1] + (mid - i));
      if (x != -1) return x;
      x = bSearch(i + 1, r, a[0], R);
      if (x != -1) return x;
      return -1;
    }else if (a[0] + a[1] == 0){
      return i;
    }
  }
  return bSearch(l, mid, L, R + (r - mid));
}


int find_best(int n){
  N = n;
  for (int i = 0; i < 500; i++){
    vector <int> a = ask(i);
    if (a[0] + a[1] == 0){
      return i;
    }
    mx = max(a[0] + a[1], mx);
  }
  return bSearch(0, n, 0, 0);
}

컴파일 시 표준 에러 (stderr) 메시지

prize.cpp: In function 'int bSearch(int, int, int, int)':
prize.cpp:16:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
             ~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...