Submission #265060

#	Time	Username	Problem	Language	Result	Execution time	Memory
265060		arayi	The Big Prize (IOI17_prize)	C++17	20 / 100	84 ms	1912 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());


const int N = 2e5 + 55;
int dz[N], aj[N];
bool col[N];
int mx;
int as(int a)
{
    vector <int> fp = ask(a);
    if(fp[0] + fp[1] == 0) return 0;
    if(!col[a] && fp[0] + fp[1] < mx) return 2;
    if(fp[0] - dz[a]) return -1;
    return 1;
}

int find_best(int n) {
    for (int i = 0; i < 500; i++)
    {
       int i1 = rnd() % n;
       vector <int> fp = ask(i1);
       mx = max(mx, fp[0] + fp[1]);
    }
    while(true)
    {
        int l = 0, r = n - 1;
        while(l <= r)
        {
            int mid = (l + r)/2;
            int sm = as(mid);
            if(sm == 0) return mid;
            if(sm == 2)
            {
                for (int i = mid + 1; i < n; i++)
                    dz[i]++;
                for (int i = mid - 1; i >= 0; i--)
                    aj[i]++;
                col[mid] = true;
                break;
            }
            if(sm == 1) l = mid + 1;
            if(sm == -1) r = mid - 1;
        }
    }
}

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