제출 #265150

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

prize

#include "prize.h"
#include <bits/stdc++.h>
#define MP make_pair
#define fr first
#define sc second
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());


const int N = 2e5 + 55;
vector <pair <int, int> > dz;
bool col[N];
int mx, q;
int as(int a)
{
    q++;
    if(q == 9800)
    {
        assert(0);
    }
    vector <int> fp = ask(a);
    if(fp[0] + fp[1] == 0) return 0;
    if(!col[a] && fp[0] + fp[1] < mx)
    {
        dz.push_back(MP(a, fp[0] + fp[1]));
        return 2;
    }
    int sm = 0;
    for(auto p : dz) if(p.fr < a && p.sc < fp[0] + fp[1]) sm++;
    if(fp[0] - sm) return -1;
    return 1;
}

int find_best(int n) {
    for (int i = 0; i < 200; i++)
    {
       int i1 = rnd() % n;
       vector <int> fp = ask(i1);
       mx = max(mx, fp[0] + fp[1]);
    }
    while(true)
    {
        int l = 0, r = n - 1;
        while(l <= r)
        {
            int mid = (l + r)/2;
            int r = 0;
            while(mid - r >= 0 && col[mid - r]) r++;
            if(mid - r < 0)
            {
                l = mid + 1;
                continue;
            }
            int sm = as(mid - r);
            if(sm == 0) return mid - r;
            if(sm == 2)
            {
                col[mid - r] = true;
                break;
            }
            if(sm == 1) l = mid + 1;
            if(sm == -1) r = mid - r - 1;
        }
    }
}

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