답안 #1018212

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018212 2024-07-09T16:31:03 Z TsotneSV 비밀 (JOI14_secret) C++14
0 / 100
312 ms 4452 KB
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1005;
const int LVL=15;

int DAQ[LVL][MAXN],n;


void go(int l,int r,int lev,int A[]) {

    if(l == r) {
        DAQ[lev][l] = A[l];
        return;
    }

    int m = (l + r)>>1; 
    DAQ[lev][m] = A[m]; DAQ[lev][m+1] = A[m+1];

    for(int i=m-1;i>=l;i--) {
        DAQ[lev][i] = Secret(A[i],DAQ[lev][i+1]);
    } 

    for(int i=m+2;i<=r;i++) {
        DAQ[lev][i] = Secret(A[i],DAQ[lev][i-1]);
    }

    go(l,m,lev+1,A); 
    go(m+1,r,lev+1,A);

}

void Init(int N, int A[]) {

    n = N;

    go(0,n-1,0,A);

}

int f(int L,int R,int l,int r,int lev) {

    if(l == r) return DAQ[lev][L];

    int m = (l + r)>>1;

    if(m >= R) return f(L,R,l,m,lev+1);
    if(m+1 <= L) return f(L,R,m+1,r,lev+1);
    return Secret(DAQ[lev][L],DAQ[lev][R]);

}

int Query(int L, int R) {
    return f(L,R,0,n-1,0);
} 
# 결과 실행 시간 메모리 Grader output
1 Incorrect 78 ms 2648 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271.
2 Incorrect 83 ms 2728 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 79 ms 2648 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 307 ms 4436 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536.
5 Incorrect 304 ms 4432 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 312 ms 4432 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050.
7 Incorrect 303 ms 4216 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570.
8 Incorrect 305 ms 4264 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264.
9 Incorrect 304 ms 4224 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135.
10 Incorrect 310 ms 4452 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726.