제출 #117559

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
117559		nvmdava	커다란 상품 (IOI17_prize)	C++17	0 / 100	17 ms	9852 KiB

prize

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

vector<int> ask(int i);

vector<int> res[200005];
int ans;
int big, nn;

vector<int> query(int i){
   if(i == 0)
      return vector<int>({0, big});
   if(i == nn + 1)
      return vector<int>({big, 0});
   return ask(i - 1);
}

void find(int l, int r){
   if(ans) return;
   if(res[l][0] == res[r][0]) return;
   int ll, rr, m = (l + r) >> 1;
   res[m] = query(m);
   if(res[m][0] + res[m][1] == big){
      find(l, m);
      find(m, r);
      return;
   }

   if(res[m][0] + res[m][1] == 0){
         ans = m;return;
   }
   for(rr = m + 1; rr < r; rr++){
      res[rr] = query(rr);
      if(res[rr][0] + res[rr][1] == big){
         find(rr, r);
         break;
      }
      if(res[rr][0] + res[rr][1] == 0){
         ans = rr;
         return;
      }
   }
   for(ll = m - 1; ll > l; ll--){
      res[ll] = query(ll);
      if(res[ll][0] + res[ll][1] == big){
         find(l, ll);
         break;
      }
      if(res[ll][0] + res[ll][1] == 0){
         ans = ll;
         return;
      }
   }

}

int find_best(int n) {
   nn = n;
   int lol = 0;
	for(int i = 0; i < 480; i++) {
		vector<int> res = ask(i);
		if(res[0] + res[1] == 0)
			return i;
      big = max(big, res[0] + res[1]);
      if(big <= res[0] + res[1]){
         big = res[0] + res[1];
         lol = i + 1;
      }
	}
   res[0] = query(0);
   res[nn + 1] = query(nn + 1);

   find(lol, nn + 1);

	return ans - 1;
}

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