| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 347667 | beksultan04 | 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 "prize.h"
#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin()Ñ,s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 3e5+12,INF=1e9+7;
int find_best(int n) {
int mx=0,i=0;n--;
while(1){
vector <int> a = ask(i);
if (!(a[0]+a[1]))ret i;
mx = max(a[0]+a[1],mx);
if (mx != a[0]+a[1])continue;
int l = i,r = n;
while (r >= l){
int m = l+r>>1;
vector <int> b = ask(m);
if (!(b[0]+b[1]))ret m;
if (!b[1]){
n = m;
}
if (!b[0] || a == b){
l = m+1;
i = m;
}
else {
r = m-1;
}
}
l = i,r = n;
while (r >= l){
int m = l+r>>1;
vector <int> b = ask(m);
if (!(b[0]+b[1]))ret m;
if (!b[1]){
n = m;
}
if (!b[0] || a == b){
r = m-1;
n = m-1;
}
else {
l = m+1;
}
}
i++;
}
}