# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089902 | 2024-09-17T11:35:49 Z | lucri | popa (BOI18_popa) | C++17 | 1 ms | 596 KB |
#include<bits/stdc++.h> #include "popa.h" int solve(int N, int* Left, int* Right) { int n=N; int t[1010]; /*for(int i=0;i<n;++i) { t[i]=0; Left[i]=Right[i]=-1; } for(int i=0;i+1<n;++i) { if(query(i,i,i,i+1)==true) { t[i+1]=i; Right[i]=i+1; } else { int x=i; while(t[x]) x=t[x]; t[x]=i+1; Left[i+1]=x; } }*/ for(int i=0;i<n;++i) if(t[i]==0) return i; return -1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 0 ms | 344 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 344 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 596 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |