# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
831031 | LIF | The Big Prize (IOI17_prize) | C++14 | 61 ms | 1916 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>
using namespace std;
int ll[300005];
int rr[300005];
int maxn = -1;
vector<int> ans;
int last = -1;
void find(int l,int r,int nowsize)
{
if(l == r)
{
ans.push_back(l);
return;
}
bool flag = true;
while(l <= r)
{
if(ll[l] == -1)
{
vector<int> temp = ask(l);
ll[l] = temp[0];rr[l] = temp[1];
if(ll[l] + rr[l] == maxn)break;
else
{
//if(ll[l] + rr[l] == 0)last = l;
ans.push_back(l);
l++;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |