#include <bits/stdc++.h>
#include "popa.h"
#pragma GCC optimize("O3")
using namespace std;
#define ll int
#define pb push_back
#define fr first
#define sc second
#define MAX ((ll)(1e12+100))
#define MX ((ll)(1e6+100))
#define ARRS ((ll)(2e6+100))
#define HS ((ll)(233))
#define MOD ((ll)(1e9+7))
#define EP ((double)(1e-9))
#define LG 21
#define mul(a,b) a=((a)*(b))%MOD
using namespace std;
int l[1020], r[1020];
int n, now;
void root()
{
int p = now;
int rt = now;
now ++;
while(now < n && query(p - 1, now, p - 1, p - 1))
{
if(query(rt, now, now, now))
{
l[now] = rt;
rt = now;
now ++;
} else
root();
}
r[p - 1] = rt;
}
int solve(int NN, int* L, int* R)
{
n = NN;
for(int i = 0; i < n; ++ i)
l[i] = r[i] = -1;
int rt = 0;
now = 1;
while(now < n)
{
if(query(rt, now, now, now))
{
l[now] = rt;
rt = now;
now ++;
continue;
}
root();
}
for(int i = 0; i < n; ++ i)
L[i] = l[i], R[i] = r[i];
}
Compilation message
popa.cpp: In function 'int solve(int, int*, int*)':
popa.cpp:60:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
6 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
26 ms |
632 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
11 ms |
780 KB |
too many queries |
2 |
Halted |
0 ms |
0 KB |
- |