oj.uz

Submission #53183

# Submission time Handle Problem Language Result Execution time Memory
53183 2018-06-29T00:24:08 Z okaybody10 Secret (JOI14_secret) C++
100 / 100
 681 ms 8636 KB 
#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
int n,B[1006],ans[1006][1006];
void _fill(int s, int e){
    int m=(s+e)/2;
    if(s==e){
        ans[m][m]=B[m];
        return;
    }
    ans[m][m]=B[m];
    for(int x=m-1; x>=s; x--){
        ans[x][m]=Secret(B[x], ans[x+1][m]);
    }
    ans[m+1][m+1]=B[m+1];
    for(int y=m+2; y<=e; y++)
        ans[m+1][y]=Secret(ans[m+1][y-1], B[y]);
    _fill(s,m);
    _fill(m+1,e);
}
 
void Init(int N, int A[]) {
    n=N;
    for(int i=0; i<n; i++) B[i]=A[i];
    _fill(0,n-1);
}
int solve(int l, int r, int s, int e){
    int m=(s+e)/2;
    if(l<=m && m+1<=r){
        return Secret(ans[l][m], ans[m+1][r]);
    }
    if(r<=m) return solve(l,r,s,m);
    else return solve(l,r,m+1,e);
}
 
int Query(int l, int r) {
    if(l==r) return B[l];
    return solve(l,r,0,n-1);
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 4472 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 173 ms 4472 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 204 ms 4596 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 604 ms 8548 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 650 ms 8548 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 681 ms 8548 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 639 ms 8636 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 582 ms 8636 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 582 ms 8636 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 603 ms 8636 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1