oj.uz

답안 #949753

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949753 2024-03-19T15:50:44 Z Trisanu_Das 비밀 (JOI14_secret) C++17
0 / 100
 381 ms 8532 KB 
#include <bits/stdc++.h>
#include "secret.h"
 
int memo[1000][1000], n;
 
void build(int l, int r, int A[]){
  int m = (l + r) / 2;
  memo[m][m] = A[m];
  memo[m + 1][m + 1] = A[m + 1];
  for(int i = m + 2; i <= r; i++) memo[m + 1][i] = Secret(memo[m + 1][i - 1], A[i]);
  for(int i = m - 1; i >= l; i--) memo[m][i] = Secret(memo[m][i + 1], A[i]);
  if(l < m) build(l, m, A);
  if(m + 1 < r) build(m + 1, r, A);
}
 
void Init(int N, int A[]){
  n = N;
  build(0, n - 1, A);
}
 
int Query(int L, int R){
  int l = 0, r = n - 1;
  while(l < r){
    int m = (l + r) / 2;
    if(L <= m && m < R) return Secret(memo[m][L], memo[m + 1][R]);
    else if(m == R) return memo[m][L];
    else if(m < L) l = m + 1;
    else r = m;
  }
  return memo[l][l];
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 102 ms 6736 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015.
2 Incorrect 100 ms 6740 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 101 ms 6660 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 374 ms 8276 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 374 ms 8372 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 379 ms 8276 KB Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445.
7 Incorrect 381 ms 8532 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 374 ms 8276 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 378 ms 8360 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 373 ms 8380 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.