Submission #858919

#	Time	Username	Problem	Language	Result	Execution time	Memory
858919		abcvuitunggio	The Big Prize (IOI17_prize)	C++17	20 / 100	3046 ms	6908 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> a[200000];
int ch[200000];
void query(int i){
    if (a[i].empty())
        a[i]=ask(i);
}
int find_best(int n){
    if (n<=5000)
        for (int i=0;i<n;i++){
            query(i);
            if (!a[i][0]&&!a[i][1])
                return i;
        }
    int mx=0;
    for (int i=0;i<472;i++){
        query(i);
        if (!a[i][0]&&!a[i][1])
            return i;
        mx=max(mx,a[i][0]+a[i][1]);
    }
    int cur=0,cnt=0;
    priority_queue <int, vector <int>, greater <int>> q;
    while (true){
        while (!q.empty()){
            if (a[q.top()][0]==cnt){
                cur=q.top()+1;
              	q.pop();
            }
            else
                break;
        }
        int tmp=cur,l=cur,r=(q.empty()?n:q.top())-1;
        if (!q.empty()){
            if (r-l+1==a[q.top()][0]-cnt){
                while (l<=r){
                    int mid=(l+r)>>1;
                    query(mid);
                    if (a[mid]==a[cur]){
                        cur=mid;
                        r=mid+1;
                    }
                    else
                        l=mid-1;
                }
                cur++;
                cnt+=cur-tmp;
                continue;
            }
        }
        while (l<=r){
            int mid=(l+r)>>1;
            query(mid);
            if (!a[mid][0]&&!a[mid][1])
                return mid;
            if (a[mid][0]+a[mid][1]==mx){
                if (a[mid][0]>cnt){
                    if (!ch[mid])
                        q.push(mid);
                    ch[mid]=1;
                    cur=mid;
                    r=mid-1;
                }
                else
                    l=mid+1;
                continue;
            }
            cur=mid;
            r=mid-1;
        }
        cnt++;
        cur++;
        while (!a[cur].empty()&&a[cur][0]+a[cur][1]==mx)
            cur++;
    }
}

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