| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 198299 | forelax | popa (BOI18_popa) | C++14 | 24 ms | 400 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
