Submission #100729

#	Time	Username	Problem	Language	Result	Execution time	Memory
100729		Bodo171	The Big Prize (IOI17_prize)	C++14	90 / 100	72 ms	6180 KiB

prize

#include "prize.h"
#include <fstream>
#include <vector>
#include <iostream>
#include <cmath>
using namespace std;
const int nmax=200005;
const int prdf=500;//modifici dupa asta
int lg[nmax];
int spec[nmax],norm[nmax];
int mx,nr,i,gasit;
vector<int> v[nmax];
int cate_st(int poz)
{
    if(v[poz].empty()) v[poz]=ask(poz);
    return v[poz][0];
}
int cate(int poz)
{
    if(v[poz].empty()) v[poz]=ask(poz);
    if(!(v[poz][0]+v[poz][1])) gasit=1;
    return (v[poz][0]+v[poz][1]);
}
int cate_dr(int poz)
{
    return (cate(poz)-cate_st(poz));
}
int n;
pair<int,int> vezi_al_catelea(int x)
{
    int pp=0;
    while(x<n&&cate(x)<mx)
        x++;
    if(x==n) pp=mx;
    else pp=cate_st(x);
    x--;
    pair<int,int> ret;
    ret.second=x;
    while(x>=0&&cate(x)<mx)
    {
       spec[pp]=x;norm[x]=pp;
       pp--;x--;
    }
    ret.first=x+1;
    return ret;
}
void solve(int st,int dr,int avem_st,int avem_dr)
{
    if(st>dr) return;
    if(avem_st+1>=avem_dr) return;
    if(gasit) return;
    pair<int,int> pe;
    if(cate(st)<mx)
    {
        pe=vezi_al_catelea(st);
        solve(pe.second+1,dr,norm[pe.second],avem_dr);
        return;
    }
    if(cate(dr)<mx)
    {
        pe=vezi_al_catelea(dr);
        solve(st,pe.first-1,avem_st,norm[pe.first]);
        return;
    }
    if(cate_st(st)+cate_dr(dr)==mx) return;
    int m=(st+dr)/2;
    if(cate(m)<mx)
    {
        pe=vezi_al_catelea(m);
        solve(st,pe.first-1,avem_st,norm[pe.first]);
        solve(pe.second+1,dr,norm[pe.second],avem_dr);
    }
    else
    {
        if(cate_st(st)+cate_dr(m)!=mx) solve(st,m-1,avem_st,mx-cate_dr(m)+1);
        if(cate_st(m)+cate_dr(dr)!=mx) solve(m+1,dr,cate_st(m),avem_dr);
    }
}
int find_best(int N) {
    n=N;
    for(i=0;i<min(prdf,n);i++)
    {
        v[i]=ask(i);
        if(v[i][0]+v[i][1]>mx)
            mx=v[i][0]+v[i][1];
    }
    spec[0]=-1;
    for(i=0;i<min(prdf,n);i++)
    {
        if(v[i][0]+v[i][1]!=mx)
            {
                ++nr;norm[i]=nr;spec[nr]=i;
                if(!cate(i)) return i;
            }

    }
    spec[mx+1]=n;
    solve(prdf,n-1,nr,mx+1);
    for(i=1;i<=mx;i++)
        if(cate(spec[i])==0)
           return spec[i];
	return 0;
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:99:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(i=1;i<=mx;i++)
     ^~~
prize.cpp:102:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  return 0;
  ^~~~~~

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