Submission #64472

#TimeUsernameProblemLanguageResultExecution timeMemory
64472TadijaSebezpopa (BOI18_popa)C++11
100 / 100
104 ms664 KiB
#include "popa.h" #include <stdio.h> const int N=1050; int S[N],c; int solve(int n, int* l, int* r) { int i; int root=-1;c=0; for(i=0;i<n;i++) { l[i]=r[i]=-1; while(c && query(S[c],i,i,i)) { r[S[c]]=l[i]; l[i]=S[c]; c--; } if(!c) root=i; else r[S[c]]=i; S[++c]=i; } return root; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...