Submission #1062399

#	Time	Username	Problem	Language	Result	Execution time	Memory
1062399		Sir_Ahmed_Imran	The Big Prize (IOI17_prize)	C++17	94.41 / 100	37 ms	6152 KiB

prize

                                    ///~~~LOTA~~~///
#include <bits/stdc++.h>
#include "prize.h"
using namespace std;
#define ll long long
#define ld long double
#define append push_back
#define add insert
#define nl '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define terminator main
#define MAXN 200000
int n;
vector<int> v[MAXN];
vector<int> get(int x){
    if(x>=n || x<0)
        return {0,0};
    if(v[x].empty())
        v[x]=ask(x);
    return v[x];
}
int find_best(int N){
    n=N;
    int m,o,p,q;
    vector<int> a;
    for(int i=m=0;i<n;i+=256){
        a=get(i);
        m=max(m,a[0]+a[1]);
    }
    p=0;q=n-1;
    while(p<n && q>=0){
        a=get(p);
        if(!a[0] && !a[1])
            return p;
        o=(p+256)/256;
        o*=256;
        if(a[0]+a[1]==m  && get(o)==a) 
            p=o;
        else if(a[0]+a[1]==m){
            for(int i=128;i>0;i/=2){
                if(p+i<n && get(p+i)==a)
                    p+=i;
            }
        }
        p++;
        a=get(q);
        if(!a[0] && !a[1])
            return q;
        o=(q-1)/256;
        o*=256;
        if(a[0]+a[1]==m  && get(o)==a) 
            q=o;
        else if(a[0]+a[1]==m){
            for(int i=128;i>0;i/=2){
                if(q>=i && get(q-i)==a)
                    q-=i;
            }
        }
        q--;
    }
    return -1;
}

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