제출 #198299

#제출 시각아이디문제언어결과실행 시간메모리
198299forelaxpopa (BOI18_popa)C++14
0 / 100
24 ms400 KiB
#include<bits/stdc++.h> #include "popa.h" using namespace std; int solve(int n,int* lf,int* rg){ int cr[n]; int pt=0; for(int i = 0 ; i < n ; i ++){ lf[i]=-1;rg[i]=-1; while(pt&&!query(cr[pt-1],cr[pt-1],cr[pt-1],i)){ lf[i]=cr[pt-1]; pt--; } if(pt){ rg[pt-1]=i; } cr[pt++]=i; } return cr[0]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...