oj.uz

Submission #68493

# Submission time Handle Problem Language Result Execution time Memory
68493 2018-08-17T08:19:54 Z losmi247 Secret (JOI14_secret) C++14
6 / 100
 1597 ms 4696 KB 
#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
int Q,l,r;
int drvo[2000005];
int n,a[2000005];
void update(int i,int j,int poz,int val,int node){
    if(i == j){
        drvo[node] = val;
        return;
    }
    int mid = i+(j-i)/2;
    if(poz <= mid){
        update(i,mid,poz,val,2*node+1);
    }
    else{
        update(mid+1,j,poz,val,2*node+2);
    }
    drvo[node] = Secret(drvo[2*node+1],drvo[2*node+2]);
}
void build(int i,int j,int node){
    if(i == j){
        drvo[node] = a[i];
        return;
    }
    int mid = i+(j-i)/2;
    build(i,mid,2*node+1);
    build(mid+1,j,2*node+2);
    drvo[node] = Secret(drvo[2*node+1],drvo[2*node+2]);
}
int get(int i,int j,int l,int r,int node){
    if(j < l || i > r){
        return -1;
    }
    if(l <= i && r >= j){
        return drvo[node];
    }
    int mid = i+(j-i)/2;
    int p1 = get(i,mid,l,r,2*node+1),p2=get(mid+1,j,l,r,2*node+2);
    if(p1 == -1){
        return p2;
    }
    else if(p2 == -1){
        return p1;
    }
    else{
        return Secret(get(i,mid,l,r,2*node+1),get(mid+1,j,l,r,2*node+2));
    }
}
int Query(int L,int R){
    return get(0,n-1,L,R,0);
}
void Init(int N,int A[]){
    n = N;
    for(int i = 0; i < N; i++){
        //update(0,n-1,i,A[i],0);
        a[i] = A[i];
    }
    build(0,n-1,0);
    cin >> Q;
    while(Q--){
        cin >> l >> r;
        cout << Query(l,r) << endl;
    }
}

Subtask #1
6.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 474 ms 2552 KB Output isn't correct - number of calls to Secret by Init = 510, maximum number of calls to Secret by Query = 317
2 Incorrect 481 ms 2552 KB Output isn't correct - number of calls to Secret by Init = 511, maximum number of calls to Secret by Query = 381
3 Incorrect 454 ms 2552 KB Output isn't correct - number of calls to Secret by Init = 512, maximum number of calls to Secret by Query = 637
4 Incorrect 998 ms 4680 KB Output isn't correct - number of calls to Secret by Init = 998, maximum number of calls to Secret by Query = 637
5 Incorrect 1008 ms 4680 KB Output isn't correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 573
6 Partially correct 697 ms 4680 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 9
7 Incorrect 1597 ms 4680 KB Output isn't correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 765
8 Incorrect 1493 ms 4680 KB Output isn't correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 765
9 Incorrect 1413 ms 4680 KB Output isn't correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 765
10 Incorrect 1474 ms 4696 KB Output isn't correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 765