oj.uz

Submission #217600

# Submission time Handle Problem Language Result Execution time Memory
217600 2020-03-30T10:33:10 Z DodgeBallMan Secret (JOI14_secret) C++14
0 / 100
 515 ms 4472 KB 
#include <bits/stdc++.h>
#include "secret.h"

const int N = 1e3 + 10;

int n, a[N], prer[10][N], prel[10][N];

//int Secret( int a, int b ) { return a + b; }

void solve( int l = 1, int r = n, int cnt = 1 ) {
    if( cnt > 8 || l == r ) return ;
    int mid = l + r >> 1;
    prer[cnt][mid+1] = a[mid+1];
    prel[cnt][mid] = a[mid];
    for( int i = mid - 1 ; i >= l ; i-- ) prel[cnt][i] = Secret( prel[cnt][i+1], a[i] );
    for( int i = mid + 2 ; i <= r ; i++ ) prer[cnt][i] = Secret( prer[cnt][i-1], a[i] );
    solve( l, mid, cnt+1 ), solve( mid+1, r, cnt+1 );
}


void Init( int N, int A[] ) {
    n = N;
    for( int i = 1 ; i <= n ; i++ ) a[i] = A[i-1];
    solve();
}

int cal( int ll, int rr, int l = 1, int r = n, int cnt = 1 ) {
    if( rr == ll ) return a[ll];
    if( rr == ll + 1 ) return Secret( a[ll], a[rr] );
    int mid = l + r >> 1;
    if( ll <= mid && mid <= rr ) return Secret( prel[cnt][ll], prer[cnt][rr] );
    else if( rr <= mid ) return cal( ll, rr, l, mid, cnt + 1 );
    else return cal( ll, rr, mid + 1, r, cnt + 1 );
}

int Query( int L, int R ) { return cal( L+1, R+1 ); }

/*int main()
{
    int n, x[N], q;
    scanf("%d",&n);
    for( int i = 0 ; i < n ; i++ ) scanf("%d",&x[i]);
    Init( n, x );
    for( int i = 1 ; i <= 8 ; i++ ) {
        for( int j = 1 ; j <= n ; j++ ) printf("%d ",prel[i][j]);

    }
    scanf("%d",&q);
    while( q-- ) {
        int a, b;
        scanf("%d %d",&a,&b);
        printf("%d\n",Query( a, b ) );
    }
}*/

Compilation message

secret.cpp: In function 'void solve(int, int, int)':
secret.cpp:12:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid = l + r >> 1;
               ~~^~~
secret.cpp: In function 'int cal(int, int, int, int, int)':
secret.cpp:30:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid = l + r >> 1;
               ~~^~~

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 136 ms 2424 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015.
2 Incorrect 139 ms 2424 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 142 ms 2552 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 496 ms 4344 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 515 ms 4384 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 496 ms 4344 KB Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445.
7 Incorrect 512 ms 4344 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 507 ms 4472 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 502 ms 4344 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 513 ms 4472 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.