Submission #617799

#	Time	Username	Problem	Language	Result	Execution time	Memory
617799		AbdelmagedNour	The Big Prize (IOI17_prize)	C++17	93 / 100	66 ms	5248 KiB

prize

#include<bits/stdc++.h>
using namespace std;
#include "prize.h"
int MAX,res=-1;
vector<vector<int>>v;
void divide(int l,int r){
    if(l>r||res!=-1)return;
    if(l==r){
        if(v[l].size()==0)v[l]=ask(l);
        if(v[l][0]+v[l][1]==0)res=l;
        return;
    }
    int md=(l+r)>>1;
    if(v[md].size()==0)v[md]=ask(md);
    if(v[md][0]+v[md][1]==0)res=md;
    if(v[md]!=v[l-1]&&v[md][0])divide(l,md-1);
    if(v[md]!=v[r+1]&&v[md][1])divide(md+1,r);
}
int find_best(int n){
    v.clear();
    v.resize(n);
    MAX=0;
    res=-1;
    for(int i=0;i<min(n,500);i++){
        vector<int>x=ask(i);
        v[i]=x;
        if(x[0]+x[1]==0)return i;
        MAX=max(MAX,x[0]+x[1]);
    }
    if(v[n-1].size()==0)v[n-1]=ask(n-1);
    if(v[n-1][0]+v[n-1][1]==0)return n-1;
    divide(1,n-2);
	return res;
}

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