제출 #527482

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
527482		stefantaga	커다란 상품 (IOI17_prize)	C++14	90 / 100	93 ms	5368 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> sal[200005];
int find_best(int n) {
    int Max=0,i;
    srand(time(NULL));
    for (i=0;i<100;i++)
    {
        int poz = rand()%n;
        vector <int> val = ask(poz);
        sal[poz]=val;
        Max=max(Max,val[0]+val[1]);
    }
    for (int i = 0; i < n; ++ i ) {
        int left = i+1, right = n-1;
        vector <int> val;
        if (sal[i].size()!=0)
        {
            val=sal[i];
        }
        else
        {
            val=ask(i);
            sal[i]=val;
        }
        Max=max(Max,val[0]+val[1]);
        int poz_right = i;
        if (val[0] + val[1] == 0) {
            return i;
        }
        if (Max!=val[0]+val[1])
        {
            continue;
        }
        while (left <= right) {
            int mid = (left + right) / 2;
            vector <int> cnt;
            if (sal[mid].size())
            {
                cnt=sal[mid];
            }
            else
            {
                cnt=ask(mid);
                sal[mid]=cnt;
            }

            if (cnt[0] + cnt[1] == 0) {
                return mid;
            }

            bool Type = (cnt[0] + cnt[1] == val[0] + val[1]);

            if (Type) {
                int cate_sunt = cnt[0] - val[0];

                if (cate_sunt == 0) {
                    poz_right = mid;
                    left = mid + 1;
                }
                else right = mid - 1;
            }
            else {
                right = mid - 1;
            }
        }

        i = poz_right;
    }

    return n-1;
}

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