Submission #292733

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
2927332020-09-07 12:37:31KastandaThe Big Prize (IOI17_prize)C++11
20 / 100
67 ms19576 KiB
// M
#include<bits/stdc++.h>
#include "prize.h"
using namespace std;
const int N = 400005;
int n, GRes, MX;
vector < int > A[N];
inline void Ask(int i)
{
if (!A[i].size())
A[i] = ask(i);
}
void Solve(int l, int r, int k, int le = 0, int ri = 0)
{
//printf("%d :: %d :: %d\n", l, r, k);
if (r <= l || k == 0)
return ;
if (GRes != -1)
return ;
if (r - l == 1)
{
Ask(l);
if (A[l][0] + A[l][1] == 0)
GRes = l;
return ;
}
int md1 = (l + r) >> 1;
int md2 = md1;
int cc = 0;
while (md2 < r)
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...