oj.uz

답안 #708001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
708001 2023-03-10T17:23:03 Z Dan4Life 비밀 (JOI14_secret) C++17
0 / 100
 443 ms 8280 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; ans[m][m]=a[m], ans[m+1][m+1]=a[m+1];
    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==R) return ans[m][L];
    if(m<L) return dnc2(m+1,r,L,R);
    return dnc2(l,m,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 124 ms 4400 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271.
2 Incorrect 115 ms 4312 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 114 ms 4352 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 427 ms 8204 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536.
5 Incorrect 418 ms 8280 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 443 ms 8172 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050.
7 Incorrect 426 ms 8188 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570.
8 Incorrect 441 ms 8240 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264.
9 Incorrect 422 ms 8136 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135.
10 Incorrect 435 ms 8168 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726.