Submission #98587

#TimeUsernameProblemLanguageResultExecution timeMemory
98587someone_aapopa (BOI18_popa)C++17
0 / 100
29 ms452 KiB
#include <bits/stdc++.h> #include "popa.h" #define ll long long #define pb push_back #define mp make_pair using namespace std; const int maxn = 110; /*int query(int a, int b, int c, int d) { cout<<a<<" "<<b<<" "<<c<<" "<<d<<endl; int answer; cin>>answer; return answer; }*/ int parent[maxn]; int li[maxn], ri[maxn]; int solvef(int l, int r) { if(l > r) return -1; if(l == r) return l; for(int i=l;i<=r;i++) { if(query(l, i, i, r)) { // valid cut point li[i] = solvef(l, i-1); ri[i] = solvef(i+1, r); return i; } } } // solve function int solve(int n, int *l , int *r) { for(int i=0;i<n;i++) { li[i] = ri[i] = -1; parent[i] = i; } int x = solvef(0, n-1); return x; } /*int main() { int a[6], b[6]; cout<<solve(6, a, b); return 0; }*/

Compilation message (stderr)

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