# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64469 | 2018-08-04T15:34:34 Z | TadijaSebez | popa (BOI18_popa) | C++11 | 25 ms | 432 KB |
#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; 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; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 376 KB | invalid argument |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 25 ms | 380 KB | invalid argument |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 12 ms | 432 KB | invalid argument |
2 | Halted | 0 ms | 0 KB | - |