oj.uz

답안 #740276

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
740276 2023-05-12T09:17:35 Z BidoTeima 비밀 (JOI14_secret) C++17
0 / 100
 472 ms 8276 KB 
#include "secret.h"
#include <bits/stdc++.h>
const int N = 1e3;
int val[N][N];
int a[N];
void rec(int l, int r){
    if(l == r){
        val[l][l] = a[l];
        return;
    }
    int mid = (l + r) >> 1;
    // (l, mid), (l + 1, mid), ..., (mid, mid)
    int pre = a[l];
    for(int i = l; i <= mid; i++){
        if(i > l)pre = Secret(pre, a[i]);
        val[l][i] = pre;
    }
    pre = a[mid + 1];
    for(int i = mid + 1; i <= r; i++){
        if(i > mid + 1)pre = Secret(pre, a[i]);
        val[mid + 1][i] = pre;
    }
}
void Init(int n, int A[]) {
    for(int i = 0; i < n; i++){
        a[i] = A[i];
    }
    memset(val, -1, sizeof(val));
    rec(0, n - 1);
}

int Query(int L, int R) {
    if(L == R)
        return val[L][L];
    for(int i = L; i <= R; i++){
        if(val[L][i] != -1)
            return Secret(val[L][i], val[i + 1][R]);
    }
    return -1;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 117 ms 6376 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : -1.
2 Incorrect 119 ms 6288 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : -1.
3 Incorrect 114 ms 6260 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : -1.
4 Incorrect 427 ms 8232 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : -1.
5 Incorrect 431 ms 8276 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : -1.
6 Incorrect 431 ms 8220 KB Wrong Answer: Query(915, 915) - expected : 282904741, actual : -1.
7 Incorrect 472 ms 8252 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : -1.
8 Incorrect 429 ms 8208 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : -1.
9 Incorrect 420 ms 8240 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : -1.
10 Incorrect 450 ms 8156 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : -1.