| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 42243 | yusufake | The Big Prize (IOI17_prize) | C++98 | 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<bits/stdc++.h>
using namespace std;
#define _ int v, int tl, int tr, int l, int r
#define tm (tl + tr >> 1)
#define sol v+v,tl,tm,l,r
#define sag v+v+1,tm+1,tr,l,r
#define mp make_pair
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef pair < int , int > pp;
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
int ans=-1;
void f(int l, int r, vector < int > x, vector < int > y){
int m = l+r >> 1;
if(ans != -1) return;
if(x[0] + x[1] == 0) { ans = l; return; }
if(y[0] + y[1] == 0) { ans = r; return; }
if(x[0] + x[1] == y[0] + y[1] && x[1] == y[1]) return;
if(l >= r-1) return;
vector < int > a = ask(m);
f(l,m,x,a); f(m,r,a,y);
}
int find_best(int n){
vector < int > x = ask(0);
vector < int > y = ask(n-1);
f(0,n-1,x,y);
return ans;
}
