oj.uz

답안 #707992

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

const int mxN = 1010;
int n, 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[i][m] = Secret(ans[i][i],ans[i+1][m]);
    for(int i = m+1; i<=r; i++) ans[m+1][i] = Secret(ans[i][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 ans[l][r];
    int m = (l+r)/2;
    if(L<=m and m<=R)
        return Secret(ans[l][m],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++)
        ans[i][i]=A[i];
    dnc(1,N); n=N;
}

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

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 122 ms 4400 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 536870912.
2 Incorrect 114 ms 4292 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 790771752.
3 Incorrect 115 ms 4396 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 674539834.
4 Incorrect 428 ms 8252 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 536870912.
5 Incorrect 431 ms 8204 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 125942547.
6 Incorrect 419 ms 8236 KB Wrong Answer: Query(915, 915) - expected : 282904741, actual : 278446241.
7 Incorrect 431 ms 8288 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 24158321.
8 Incorrect 423 ms 8228 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 497025432.
9 Incorrect 429 ms 8148 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 425210575.
10 Incorrect 428 ms 8316 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 609126925.