| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 297056 | Trickster | The Big Prize (IOI17_prize) | C++14 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <algorithm>
#include <string.h>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
#define N 200010
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mod 1000000007
#define pii pair <int, int>
#define sz(a) int(a.size())
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
ll bigmod(ll a,ll e) {if(e==0)return 1;ll x=bigmod(a*a%mod,e>>1);return e&1?x*a%mod:x;}
pii p[N];
queue <pii> Q;
int find_best(int n)
{
    for(int i = 0; i < n; i++) p[i] = {-1, -1};
    Q.push({0, n-1});
    while(!Q.empty()) {
        int l = Q.front().ff, r = Q.front().ss;
        Q.pop();
        if(p[l].ff == -1 && p[l].ss == -1) p[l] = ask(l);
        if(p[r].ff == -1 && p[r].ss == -1) p[r] = ask(r);
        if(p[l].ff == 0 && p[l].ss == 0) return l;
        if(p[r].ff == 0 && p[r].ss == 0) return r;
        if(p[l].ss == p[r].ss || p[r].ff == p[l].ff) continue;            
        int md = (l+r)/2;
        Q.push({l, md});
        Q.push({md, r});
    }
}
