| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 577390 | Theo830 | The Big Prize (IOI17_prize) | C++17 | 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;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define ull unsigned int
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
#include "prize.h"
ll maxi = 0;
ll solve(ll l,ll r,ll L,ll R){
if(l > r){
return -1;
}
ll mid = (l+r)/2;
vector<int>res = ask(mid);
if(res[0] == 0 && res[1] == 0){
return mid;
}
if(l == r){
return -1;
}
ll ans;
ll pos = mid;
while(pos < r && (res[0] + res[1]) < maxi){
pos++;
ask(pos);
}
if(res[0] + res[1] < maxi){
pos = mid - 1;
while(pos > l && (res[0] + res[1]) < maxi){
pos--;
ask(pos);
}
}
if(res[0] + res[1] == maxi){
if(res[0] - L > res[1] - R){
ans = solve(l,mid,L,R + res[1]);
if(ans == -1){
ans = solve(mid+1,r,L + res[0],R);
}
}
else{
ans = solve(mid+1,r,L + res[0],R);
if(ans == -1){
ans = solve(l,mid,L,R + res[1]);
}
}
}
return ans;
}
int find_best(int n){
srand(time(0));
ll k = 20;
while(k--){
ask(rand() % n);
maxi = max(maxi,res[0] + res[1]);
}
return solve(0,n-1,0,0);
}