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 "popa.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int N, *L, *R;
int f(int l, int r)
{
if(l>r) return -1;
if(l==r) return l;
for(int i=l; i<=r; i++)
{
if(query(l, r, i, i))
{
L[i]=f(l, i-1);
R[i]=f(i+1, r);
return i;
}
}
}
int solve(int _N, int *_L, int *_R)
{
N=_N; L=_L; R=_R;
return f(0, N-1);
}
Compilation message (stderr)
popa.cpp: In function 'int f(int, int)':
popa.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
24 | }
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |