Submission #699549

#	Time	Username	Problem	Language	Result	Execution time	Memory
699549		MasterTaster	The Big Prize (IOI17_prize)	C++14	100 / 100	59 ms	11684 KiB

prize

#include "prize.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <set>

#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define pb push_back
#define MAXN 200010

using namespace std;

int n, l[MAXN], r[MAXN], maxx, ret=-1, sq=480;
vector<int> all;
set<int> s[MAXN];

/*bool check(int i, int k)
{
    vector<int> p=ask(i);
    int le=p[0], ri=p[1];
    if ((le+ri)<maxx) return true;
    if (le>k) return true;
    return false;
}*/

bool vis[MAXN];
void askk(int i)
{
    if (i==-1) return;
    if (i==n) { l[i]=maxx; return; }
    if (!vis[i]) { vector<int> p=ask(i); l[i]=p[0]; r[i]=p[1]; vis[i]=true; }
}
void ch()
{
    askk(all[all.size()-1]);
    if ((l[all[all.size()-1]]+r[all[all.size()-1]])==0) ret=all[all.size()-1];
}

void solve(int left, int right)
{
    //cout<<left<<" "<<right<<endl;
    if (ret!=-1) return;
    int mid=left+(right-left)/2;


    if (left>right) return;
    if (left==right) { askk(mid); s[l[mid]+r[mid]].insert(mid); if ((l[mid]+r[mid])==0) { ret=mid; return; } }
    if (left==(right-1))
    {
        askk(mid);
        s[l[mid]+r[mid]].insert(mid);
        if ((l[mid]+r[mid])==0) { ret=mid; return; }
        mid++;
        askk(mid);
        s[l[mid]+r[mid]].insert(mid);
        if ((l[mid]+r[mid])==0) { ret=mid; return; }
        return;
    }

    askk(mid); if ((l[mid]+r[mid])==0) { ret=mid; return; }
    int cnt=l[mid]+r[mid];
    s[cnt].insert(mid);
    auto it=s[cnt].find(mid);
    //cout<<s[cnt].size()<<endl;
    if (s[cnt].begin()==it || l[*prev(it)]!=l[mid]) { /*cout<<"ee"<<endl;*/ solve(left, mid-1); if (ret!=-1) return; }
    if ((--s[cnt].end())==it || l[*next(it)]!=l[mid]) { /*cout<<"eee"<<endl;*/ solve(mid+1, right); if (ret!=-1) return; }

    /*askk(left-1); askk(right+1);
    int pom;
    if (left==0) pom=0;
    else pom=l[left-1];
    if (l[mid]-pom) solve(left, mid-1);
    if (l[right+1]-l[mid]) solve(mid+1, right);*/
}

int find_best(int N) {
    n=N;
    sq=min(sq, n-1);//2*sqrt(n);
    /*for (int i=0; i<=sq; i++)
    {
        askk(i);
        if (l[i]+r[i]==0) return i;
        maxx=max(maxx, l[i]+r[i]);
    }*/

    int left=0, right=n-1;
    solve(left, right);

    /*int ret=0;
    for (int i=0; i<all.size(); i++) { askk(all[i]); if ((l[all[i]]+r[all[i]])==0) ret=all[i]; }*/
    //cout<<ret<<endl;
    return ret;
}
///1, 2, 5, 26, 677
/*
8
3 2 3 1 3 3 2 3
*/

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