답안 #1018228

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

const int maxn = 1000;
const int maxlvl = 15;

int n;
int DVC[maxlvl][maxn];

void create(int lvl,int l,int r,int A[]) {

    if(l == r) {
        DVC[lvl][l] = A[l];
        return;
    }

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

    DVC[lvl][m] = A[m]; 

    for(int i=m-1;i>=l;i--) DVC[lvl][i] = Secret(A[i],DVC[lvl][i+1]);
    
    DVC[lvl][m+1] = A[m+1];

    for(int i=m+2;i<=r;i++) DVC[lvl][i] = Secret(A[i],DVC[lvl][i-1]);

    create(lvl+1,l,m,A); 
    create(lvl+1,m+1,r,A);

}

int get(int lvl,int l,int r,int L,int R) {

    if(l == r) return DVC[lvl][L];

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

    if(R <= m) return get(lvl+1,l,m,L,R);
    if(L >= m+1) return get(lvl+1,m+1,r,L,R);
    return Secret(DVC[lvl][L],DVC[lvl][R]);

}

void Init(int N, int A[]) {
    n = N;
    create(0,0,n-1,A);
}

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