제출 #370551

#제출 시각아이디문제언어결과실행 시간메모리
370551arnold518popa (BOI18_popa)C++14
0 / 100
52 ms392 KiB
#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 qquery(int l1, int r1, int l2, int r2) { return query(l1-1, r1-1, l2-1, r2-1); } int f(int l, int r) { if(l==r) return l; if(l>r) return -1; for(int i=l; i<=r; i++) { if(qquery(l, r, i, i)) { L[i-1]=f(l, i-1)-1; R[i-1]=f(i+1, r)-1; return i; } } } int solve(int _N, int *_L, int *_R) { N=_N; L=_L; R=_R; return f(1, N)-1; }

컴파일 시 표준 에러 (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...