oj.uz

Submission #293249

# Submission time Handle Problem Language Result Execution time Memory
293249 2020-09-07T19:53:51 Z infinite_iq Secret (JOI14_secret) C++14
0 / 100
 512 ms 8440 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 ( a [i] , Ans [mid+1][i-1] ) ;
        }
        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
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 134 ms 4468 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271.
2 Incorrect 138 ms 4392 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 137 ms 4492 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 497 ms 8440 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536.
5 Incorrect 496 ms 8440 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 507 ms 8312 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050.
7 Incorrect 508 ms 8312 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570.
8 Incorrect 505 ms 8312 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264.
9 Incorrect 512 ms 8312 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135.
10 Incorrect 506 ms 8312 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726.