oj.uz

Submission #293247

# Submission time Handle Problem Language Result Execution time Memory
293247 2020-09-07T19:52:22 Z infinite_iq Secret (JOI14_secret) C++14
100 / 100
 518 ms 8312 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 100
#define mp make_pair
#define mid (l+r)/2
#define le node * 2 
#define ri node * 2 + 1 
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
//#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
#define all(x) x.begin(), x.end()
#define gc getchar_unlocked
typedef long long ll;
typedef short int si;
typedef double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef pair<double,ll>pdi;
const ll inf=2e18;
const ll mod=1e9+7;
const ld Pi=acos(-1) ;
#include "secret.h"
int n ;
int a [1009] , Ans [1009][1009]  ;
void build ( int l , int r ) {
        Ans [mid][mid] = a [mid] ;
        Ans [mid+1][mid+1] = a [mid+1] ;
        for ( int i = mid - 1 ; i >= l ; i -- ) {
                Ans [mid][i] = Secret ( a [i] , Ans [mid][i+1] ) ;
        }
        for ( int i = mid + 2 ; i <= r ; i ++ ) {
                Ans [mid+1][i] = Secret ( Ans [mid+1][i-1] , a [i] ) ;
        }
        if ( l < mid )
                build ( l , mid ) ;
        if ( mid + 1 < r )
                build ( mid + 1 , r ) ;
}
void Init ( int N , int A[] ) {
        n = N ;
        for ( int i = 0 ; i < n ; i ++ ) a [i] = A [i] ;
        build ( 0 , n-1 ) ;
}
int Query ( int L , int R ) {
        int l = 0 , r = n -1 ;
        while ( r != l ) {
                if ( mid == R ) {
                        return Ans [mid][L] ;
                }
                if ( L <= mid && mid < R ) {
                        return Secret ( Ans [mid][L] , Ans [mid+1][R] ) ;
                }
                if ( mid + 1 <= L ) l = mid + 1 ;
                else r = mid ;
        }
        return Ans [l][r] ;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 143 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 143 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 144 ms 4484 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 516 ms 8312 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 510 ms 8280 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 513 ms 8312 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 510 ms 8312 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 512 ms 8312 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 512 ms 8236 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 518 ms 8236 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1