제출 #98437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
98437		bogdan10bos	커다란 상품 (IOI17_prize)	C++14	20 / 100	96 ms	1212 KiB

prize

#include <bits/stdc++.h>

#include "prize.h"

using namespace std;

typedef pair<int, int> pii;

int sq, mxcnt, ans;
map<int, int> mp[2];

pii myask(int pos)
{
    if(mp[0].count(pos))
        return {mp[0][pos], mp[1][pos]};

    auto v = ask(pos);
    mp[0][pos] = v[0];
    mp[1][pos] = v[1];
    return {v[0], v[1]};
}

void solve(int st, int dr)
{
    if(st > dr) return;
    if(ans != -1)   return;
    auto askst = myask(st);
    auto askdr = myask(dr);

    int sumst = askst.first + askst.second;
    int sumdr = askdr.first + askdr.second;

    if(sumst == 0)  { ans = st; return; }
    if(sumdr == 0)  { ans = dr; return; }

    if(askst.second == 0 || askdr.first == 0)   return;

    if(dr - st <= 1)    return;

    if(sumst != mxcnt)
    {
        solve(st + 1, dr);
        return;
    }

    if(sumdr != mxcnt)
    {
        solve(st, dr - 1);
        return;
    }

    int cnt = askdr.first - askst.first;
    if(cnt == 0)    return;

    int lgt = dr - st - 1;

    int add = lgt / (cnt + 1);
    add = max(add, 1);

    solve(st, st + add);
    solve(st + add, dr);
}

int find_best(int N)
{
    ans = -1;
    sq = sqrt(N) + 1;
    sq = min(sq, N);
    mxcnt = 0;
	for(int i = 0; i < sq; i++)
    {
        auto x = myask(i);
        int sum = x.first + x.second;
        if(sum == 0)    ans = i;
        mxcnt = max(mxcnt, sum);
    }
    solve(0, N - 1);
    return ans;
}

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