| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 293213 | XmtosX | Secret (JOI14_secret) | C++17 | 591 ms | 4600 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 "secret.h"
using namespace std;
#define LL pos*2+1
#define RR pos*2+2
const int NN=1e3+3;
int seg[NN*4],a[NN],n,l,r;
void build (int st,int en,int pos)
{
    if (st==en)
    {
        seg[pos]=a[st];
        return;
    }
    int mid= (st+en)/2;
    build(st,mid,LL);
    build(mid+1,en,RR);
    seg[pos]=Secret(seg[LL],seg[RR]);
}
int query(int st,int en,int pos)
{
    if (st>=l&&en<=r)
        return seg[pos];
    int mid=(st+en)/2;
    int p1=-1,p2=-1;
    if (!(st>r||mid<l))
        p1=query(st,mid,LL);
    if (!(mid+1>r||en<l))
        p2=query(mid+1,en,RR);
    if (p1==-1)
        return p2;
    if (p2==-1)
        return p1;
    return Secret(p1,p2);
}
void Init(int N, int A[])
{
    n=N;
    for (int i=0;i<n;i++)
        a[i]=A[i];
    build(0,n-1,0);
}
int Query(int L, int R)
{
    l=L;
    r=R;
    int ans=query(0,n-1,0);
    return ans;
}
/*
8
1 4 7 2 5 8 3 6
4
0 3
1 7
5 5
2 4
*/
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
