Submission #427996

#	Time	Username	Problem	Language	Result	Execution time	Memory
427996		MOUF_MAHMALAT	커다란 상품 (IOI17_prize)	C++14	99.53 / 100	73 ms	5344 KiB

prize

#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
ll id,l,r,m,x,mx;
vector<ll>v[200009];
int find_best(int n)
{
    while(id<n)
    {
        if(v[id].empty())
            v[id]=ask(id);
        if(v[id][0]+v[id][1]==0)
            return id;
        mx=max(mx,v[id][0]+v[id][1]);
        if(mx>v[id][0]+v[id][1])
        {
            id++;
            continue;
        }
        x=min(n-1,id+488);
        if(v[x].empty())
            v[x]=ask(x);
        if(v[x][0]+v[x][1]==0)
            return x;
        mx=max(mx,v[x][0]+v[x][1]);
        if(v[x]==v[id])
        {
            id=x+1;
            continue;
        }
        l=id,r=x+1;
        while(r-l>1)
        {
            m=(l+r)/2;
            if(v[m].empty())
                v[m]=ask(m);
            if(v[m][0]+v[m][1]==0)
                return m;
            mx=max(mx,v[m][0]+v[m][1]);
            if(v[m]==v[id])
                l=m;
            else
                r=m;
        }
        id=l+1;
    }
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:48:1: warning: control reaches end of non-void function [-Wreturn-type]
   48 | }
      | ^

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