Submission #778611

#	Time	Username	Problem	Language	Result	Execution time	Memory
778611		benjaminkleyn	The Big Prize (IOI17_prize)	C++17	0 / 100	69 ms	820 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair

bool asked[200000];
int L[200000], R[200000];
int v, N;

vector<int> previous_queries;
bool Ask(int i)
{
    if (asked[i]) return L[i] + R[i] == 0;
    asked[i] = true;
    previous_queries.push_back(i);
    vector<int> res = ask(i);
    L[i] = res[0], R[i] = res[1];
    return L[i] + R[i] == 0;
}

int Find(int l, int r)
{
    while (l < r && (L[l] != L[v] || R[l] != R[v]))
    {
        l++;
        if (Ask(l))
            return l;
    }
    while (l < r && (L[r] != L[v] || R[r] != R[v]))
    {
        r--;
        if (Ask(r))
            return r;
    }
    int m = (l + r) / 2;
    if (Ask(m)) return m;
    if (l == r) return -1;

    int x = Find(l, m), y = Find(m, r);
    if (x >= 0) return x;
    if (y >= 0) return y;
    return -1;
}

int find_best(int n) 
{
    memset(asked, false, sizeof(asked));

    N = n, v = 0;
    for (int j = 0; j < n && j < 474; j++)
    {
        if (Ask(j)) return j;
        if (L[j] + R[j] > L[v] + R[v])
            v = j;
    }
    if (Ask(0)) return 0;
    if (Ask(n - 1)) return n - 1;
    return Find(0, n - 1);
}

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