oj.uz

답안 #866279

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866279 2023-10-25T18:08:20 Z Tudy006 비밀 (JOI14_secret) C++14
0 / 100
 391 ms 8600 KB 
#include <bits/stdc++.h>
#include "secret.h"

using namespace std;

const int NMAX = 1000;

int answer[NMAX][NMAX];
int N;

//static int secret_count;
//
//int Secret(int X, int Y) {
//  ++secret_count;
//  if (!(0 <= X && X <= MAX_VALUE)) {
//    fprintf(stderr, "Wrong Answer [1]\n");
//    exit(0);
//  }
//  if (!(0 <= Y && Y <= MAX_VALUE)) {
//    fprintf(stderr, "Wrong Answer [1]\n");
//    exit(0);
//  }
//  return (X + 2 * (Y / 2) < MAX_VALUE) ? (X + 2 * (Y / 2)) : MAX_VALUE;
//}
void divide_init( int l, int r, int* v ) {
    if ( l == r ) {
        answer[l][r] = v[l];
        return;
    }
    int mij = ( l + r ) / 2;
    answer[mij][mij] = v[mij];
    answer[mij + 1][mij + 1] = v[mij + 1];
    if ( r - l <= 1 ) return;

    for ( int i = mij - 1; i >= l; i -- ) {
        answer[i][mij] = Secret( v[i], answer[i + 1][mij] );
    }
    for ( int i = mij + 2; i <= r; i ++ ) {
        answer[mij + 1][i] = Secret( answer[mij + 1][i - 1], v[i] );
    }
    divide_init( l, mij, v );
    divide_init( mij + 1, r, v );
}

int divide_query( int st, int dr, int l, int r ) {
    int mij = ( st + dr ) / 2;
    if ( l <= mij && mij <= r ) {
        if ( mij == l || mij == r ) return answer[l][r];
        return Secret( answer[l][mij], answer[mij + 1][r] );
    }
    if ( mij < l ) return divide_query( mij + 1, dr, l, r );
    return divide_query( st, mij, l, r );
}
void Init(int n, int v[] ) {
    N = n;
    divide_init( 0, n - 1, v );
}
int Query( int l, int r ) {
    return divide_query( 0, N - 1, l, r );
}
//int main() {
//
//    return 0;
//}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 104 ms 6824 KB Wrong Answer: Query(255, 409) - expected : 307522235, actual : 0.
2 Incorrect 102 ms 6828 KB Wrong Answer: Query(127, 153) - expected : 342921603, actual : 0.
3 Incorrect 101 ms 6660 KB Wrong Answer: Query(128, 153) - expected : 959658850, actual : 0.
4 Incorrect 378 ms 8372 KB Wrong Answer: Query(374, 396) - expected : 402362963, actual : 0.
5 Incorrect 376 ms 8272 KB Wrong Answer: Query(703, 706) - expected : 857111674, actual : 0.
6 Incorrect 391 ms 8368 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 0.
7 Correct 379 ms 8364 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 386 ms 8364 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 384 ms 8356 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 386 ms 8600 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1