Submission #1082315

#	Time	Username	Problem	Language	Result	Execution time	Memory
1082315		MMihalev	커다란 상품 (IOI17_prize)	C++14	0 / 100	1 ms	344 KiB

prize

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include "prize.h"
using namespace std;
const int MAX_N=2e5+4;
int asked[MAX_N][2];
bool used[MAX_N];
pair<int,int>query(int pos)
{
    if(used[pos])return {asked[pos][0],asked[pos][1]};

    used[pos]=1;
    auto ve=ask(pos);
    asked[pos][0]=ve[0];
    asked[pos][1]=ve[1];
    return {ve[0],ve[1]};
}
int find_best(int n)
{
    long long N=n;
    int prevpos=-1;
    while(1)
    {
        prevpos++;
        if(prevpos>=n)break;
        auto cur=query(prevpos);
        long long all=cur.first+cur.second;
        if(all!=0)
        {
            int l=prevpos,r=n-1;
            while(l<=r)
            {
                int mid=(l+r)/2;
                auto cur2=query(mid);
                if(cur2.first==cur.first)
                {
                    prevpos=mid;
                    l=mid+1;
                }
                else r=mid-1;
            }
        }
        else
        {
            return prevpos;
        }
    }

}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:22:15: warning: unused variable 'N' [-Wunused-variable]
   22 |     long long N=n;
      |               ^
prize.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
   51 | }
      | ^

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