제출 #208535

#제출 시각아이디문제언어결과실행 시간메모리
208535dolphingarlicpopa (BOI18_popa)C++14
100 / 100
97 ms500 KiB
#include "popa.h" int P[1000];int solve(int N,int* L,int* R) {int r=-1;for(int i=0;i<N;i++){L[i]=R[i]=P[i]=-1;int p=i-1;while(p!=-1&&query(i,i,p,i)){R[p]=L[i];P[L[i]]=p;L[i]=p;int pp=P[p];P[p]=i;p=pp;}if(p==-1){L[i]=r;if(r!=-1)P[r]=i;r=i;}else{R[p]=i;P[i]=p;}}return r;}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...