Submission #82279

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
822792018-10-29 17:38:02SecretAgent007The Big Prize (IOI17_prize)C++17
20 / 100
64 ms5580 KiB
#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){
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...