# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
82279 | SecretAgent007 | The Big Prize (IOI17_prize) | C++17 | 64 ms | 5580 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"
using namespace std;
vector<int> tab[200009];
vector<int> query(int a){
if(!tab[a].empty()){
return tab[a];
}
return tab[a] = ask(a);
}
int sumQuery(int a){
return query(a)[0]+query(a)[1];
}
int ans = -1, maxi = 0;
void solve(int l, int r, int nb, int ln){
if(nb == 0) return;
if(l > r) return ;
int a = r-l+1;
int cnt = 0;
int start = l;
int mem = ln;
for(int i = l; i <= r; i+=max(1,(nb/a)*a-1)){
int curr = i;
if(curr > r) break;
if(sumQuery(curr) == 0){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |