# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
790674 | ymm | The Big Prize (IOI17_prize) | C++17 | 40 ms | 1976 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 <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
typedef long long ll;
typedef std::pair<int,int> pii;
using namespace std;
jmp_buf jb;
int ans;
const int N = 200'010;
pii table[N];
int n;
pii query(int i) {
if (table[i] != pii{})
return table[i];
auto tmp = ask(i);
if (tmp[0] + tmp[1] == 0) {
ans = i;
longjmp(jb, 1);
}
return (table[i] = {tmp[0], tmp[1]});
}
void solve(int l, int r, int cl, int cr, int tot)
{
if (cl + cr == tot)
return;
int m = (l+r)/2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |