oj.uz

답안 #707995

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707995 2023-03-10T17:16:55 Z Dan4Life 비밀 (JOI14_secret) C++17
0 / 100
 465 ms 8344 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[m][i] = Secret(ans[i][i],ans[m][i+1]);
    for(int i = m+2; 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[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++)
        ans[i][i]=A[i];
    dnc(0,N-1); n=N;
}

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

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 112 ms 4348 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 847844452.
2 Incorrect 116 ms 4296 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 323725504.
3 Incorrect 114 ms 4332 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 562194486.
4 Incorrect 425 ms 8168 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 615503535.
5 Incorrect 437 ms 8344 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 423036959.
6 Incorrect 426 ms 8192 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 422971424.
7 Incorrect 465 ms 8144 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 567873577.
8 Incorrect 430 ms 8196 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 24295808.
9 Incorrect 457 ms 8240 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 564004199.
10 Incorrect 424 ms 8232 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 873276609.