| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 637117 | Blobo2_Blobo2 | Secret (JOI14_secret) | C++17 | 443 ms | 4432 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 "secret.h"
using namespace std;
int seg[4000],n,arr[1000],cnt=0;
void update(int idx=0,int l=0,int r = n-1){
if(l == r){
seg[idx] = arr[l];
return;
}
int mid = (l+r)>>1;
update(idx>>1,mid+1,r);
update(idx>>1|1,l,mid);
seg[idx] = Secret(seg[idx>>1], seg[idx>>1|1]);
}
int query(int L,int R,int idx=0,int l=0,int r=n-1){
if(l >= L && r <= R)return seg[idx];
if(r < L || l > R)return -1;
int mid = (l+r)>>1;
int first = query(L,R,idx>>1,mid+1,r);
int second = query(L,R,idx>>1|1,l,mid);
if(first != -1 && second != -1){
cnt++;
return Secret(first,second);
}
else if(first != -1)
return first;
else if(second != -1)
return second;
else return -1;
}
void Init(int N,int A[]){
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||