Submission #287620

#TimeUsernameProblemLanguageResultExecution timeMemory
287620luciocfpopa (BOI18_popa)C++14
0 / 100
65 ms512 KiB
#include <bits/stdc++.h> #include "popa.h" using namespace std; const int maxn = 1e3+10; int n; int L[maxn], R[maxn]; bool mark[maxn]; int f(int l, int r) { if (l > r) return -1; for (int i = 0; i < n; i++) { if (!mark[i] && query(l, r, i, i)) { mark[i] = 1; L[i] = f(l, i-1); R[i] = f(i+1, r); return i; } } } void solve(int N, int *Left, int *Right) { n = N; f(0, n-1); for (int i = 0; i < n; i++) Left[i] = L[i], Right[i] = R[i]; }

Compilation message (stderr)

popa.cpp: In function 'int f(int, int)':
popa.cpp:29:1: warning: control reaches end of non-void function [-Wreturn-type]
   29 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...