# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
92898 | 2019-01-05T13:45:41 Z | Pajaraja | popa (BOI18_popa) | C++17 | 2 ms | 504 KB |
#include <bits/stdc++.h> #include "popa.h" #define MAXN 1007 using namespace std; int ls[MAXN],rs[MAXN],dm[MAXN]; int rek(int lt,int rt) { if(lt>rt) return -1; int l; for(int i=lt;i<=rt;i++) {if(dm[i]<=lt) l=i; break;} ls[l]=rek(lt,l-1); rs[l]=rek(l+1,rt); return l; } int solve(int N,int* Left,int* Right) { stack<int> st; st.push(-1); for(int i=0;i<N;i++) { while(st.size()>1 && !query(st.top(),st.top(),st.top(),i)) st.pop(); dm[i]=st.top()+1; } int a=rek(0,N-1); for(int i=0;i<N;i++) Left[i]=ls[i]; for(int i=0;i<N;i++) Right[i]=rs[i]; return a; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 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 | 2 ms | 496 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 488 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |