Submission #103369

#	Time	Username	Problem	Language	Result	Execution time	Memory
103369		daniel920712	커다란 상품 (IOI17_prize)	C++14	0 / 100	6 ms	1912 KiB

prize

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <assert.h>
#include "prize.h"

using namespace std;
int all[200005];
int l[200005],r[200005];
int ans=0;
int F(int L,int R)
{
    //printf("%d %d\n",L,R);
    vector < int > t;
    int x;
    if(l[(L+R)/2]==-1)
    {
        ans++;
        assert(ans<=10000);
        t=ask((L+R)/2);
        l[(L+R)/2]=t[0];
        r[(L+R)/2]=t[1];
    }
    if(l[R]==-1)
    {
        ans++;
        assert(ans<=10000);
        t=ask(R);
        l[R]=t[0];
        r[R]=t[1];
    }
    if(l[L]==-1)
    {
        ans++;
        assert(ans<=10000);
        t=ask(L);
        l[L]=t[0];
        r[L]=t[1];
    }
    if(L==R)
    {

        if(l[L]||r[L]) return -1;
        return L;
    }
    else if(L+1==R)
    {

        if(l[L]||r[L])
        {
            if(l[R]||r[R]) return -1;
            return R;
        }
        return L;
    }
    else
    {
        if(l[R]==l[(L+R)/2-1]) return F(L,(L+R)/2);
        else if(r[L]==r[(L+R)/2]) return F((L+R)/2+1,R);
        else
        {
            x=F((L+R)/2+1,R);
            if(x!=-1) return x;
            return F(L,(L+R)/2);
        }
    }
}
int find_best(int n)
{
    vector < int > t;
    int i,j,all=0;
    for(i=0;i<n;i++) l[i]=r[i]=-1;

    ans++;
    assert(ans<=10000);
    t=ask(0);
    l[0]=t[0];
    r[0]=t[1];

    ans++;
    assert(ans<=10000);
    t=ask(n-1);
    l[n-1]=t[0];
    r[n-1]=t[1];
    return F(0,n-1);
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:71:11: warning: unused variable 'j' [-Wunused-variable]
     int i,j,all=0;
           ^
prize.cpp:71:13: warning: unused variable 'all' [-Wunused-variable]
     int i,j,all=0;
             ^~~

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