# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292977 | luciocf | The Big Prize (IOI17_prize) | C++14 | 108 ms | 1920 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>
#include "prize.h"
#define ff first
#define ss second
using namespace std;
typedef pair<int, int> pii;
const int maxn = 2e5+10;
int qtd[10];
pii val[maxn];
pii get(int i)
{
vector<int> v = ask(i);
return {v[0], v[1]};
}
int find_best(int n)
{
for (int i = 0; i < n; i++)
val[i] = {-1, -1};
int ind = 0;
for (int i = 0; i < min(n, 500); i++)
{
int v = get(i).ff+get(i).ss;
if (v == 0) return i;
if (v > qtd[1])
qtd[1] = v, ind = i;
}
int ant = ind;
val[ind] = get(ind);
for (int i = 1; i <= 500; i++)
{
int ini = ant+1, fim = n-1, ans;
while (ini <= fim)
{
int mid = (ini+fim)/2;
if (val[mid].ff == -1) val[mid] = get(mid);
if (val[mid].ff+val[mid].ss != qtd[1])
{
if (val[mid].ff+val[mid].ss == 0) return mid;
ans = mid, fim = mid-1;
}
else if (val[mid].ff-val[ind].ff-(i-1) > 0) fim = mid-1;
else ini = mid+1;
}
ant = ans;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |