# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104231 | RockyB | The Big Prize (IOI17_prize) | C++17 | 53 ms | 2048 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 pii pair<int,int>
#define MAXN 200010
#define SQRT 500
#define fi first
#define se second
using namespace std;
int max_type, N, R, key;
pii dp[MAXN];
vector<int> ask1(int idx) {
if(dp[idx] != make_pair(0, 0)) {
vector<int> rez(2);
rez[0] = dp[idx].fi;
rez[1] = dp[idx].se;
return rez;
}
vector<int> rez = ask(idx);
dp[idx] = {rez[0], rez[1]};
return rez;
}
pii nadji_sled(int l, int r) {
int rez = N;
while(l <= r) {
int mid = (l+r)/2;
vector<int> r1 = ask1(mid);
if(r1[0]+r1[1] > max_type) {
rez = mid;
r = mid-1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |