제출 #247009

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

prize

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
#include <set>
#include <cmath>
#include <cstring>
#include "prize.h"
 
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<ll, ll> ii;
 
vector<vi> res(2e5 + 1, vi());
int find_best(int n){
    
    int maxi = 0;
    for (int i = 0; i < min(500, n); i++){
        res[i] = ask(i);
        if (res[i][0] + res[i][1] == 0)
            return i;
        maxi = max(maxi, res[i][0] + res[i][1]);
    }
    
    int i = 500;
    
    while(i < n){
        if (res[i].size() == 0)
            res[i] = ask(i);
        if (res[i][0] + res[i][1] == 0)
            return i;
        if (res[i][0] + res[i][1] == maxi){
            int beg = i + 1, end = n - 1;
            while(beg < end){
                int mid = (beg + end)/2;
                if (res[i].size() == 0)
                    res[mid] = ask(mid);
                if (res[mid][0] + res[mid][1] == 0)
                    return mid;
                if (res[mid][0] + res[mid][1] < maxi)
                    end = mid;
                else{
                    if (res[i][1] - res[mid][1] > 0)
                        end = mid - 1;
                    else
                        beg = mid + 1;
                }
            }
            if (res[beg].size() == 0)
                res[beg] = ask(beg);
            if (res[beg][0] + res[beg][1] == 0)
                return beg;
            i = beg + 1;
        }
        else
            i++;
    }
    return i;
}

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