oj.uz

답안 #707996

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707996 2023-03-10T17:18:15 Z Dan4Life 비밀 (JOI14_secret) C++17
0 / 100
 446 ms 8228 KB 
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;

const int mxN = 1010;
int n, a[mxN], ans[mxN][mxN];

void dnc(int l, int r){
    if(l==r) return;
    int m = (l+r)/2;
    for(int i = m-1; i>=l; i--) ans[m][i] = Secret(a[i],ans[m][i+1]);
    for(int i = m+2; i<=r; i++) ans[m+1][i] = Secret(a[i],ans[m+1][i-1]);
    dnc(l,m), dnc(m+1,r);
}

int dnc2(int l, int r, int L, int R){
    if(l==r) return a[L];
    int m = (l+r)/2;
    if(L<=m and m<R)
        return Secret(ans[m][l],ans[m+1][r]);
    if(m<L) return dnc2(l,m,L,R);
    return dnc2(m+1,r,L,R);
}

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

int Query(int L, int R) {
    if(L==R) return a[L];
    return dnc2(0,n-1,L,R);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 119 ms 4428 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 175308899.
2 Incorrect 116 ms 4332 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 803340416.
3 Incorrect 113 ms 4296 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 481484820.
4 Incorrect 445 ms 8156 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 934575774.
5 Incorrect 446 ms 8212 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 918843649.
6 Incorrect 433 ms 8228 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 439006153.
7 Incorrect 424 ms 8184 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 772448272.
8 Incorrect 431 ms 8148 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 608462024.
9 Incorrect 439 ms 8196 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 807026306.
10 Incorrect 439 ms 8216 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 538182796.