oj.uz

답안 #508653

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
508653 2022-01-13T13:47:02 Z Abrar_Al_Samit 비밀 (JOI14_secret) C++17
0 / 100
 483 ms 4316 KB 
#include "secret.h"
#include <bits/stdc++.h>
const int MX = 1001;
int tab[10][MX];
int mask[MX];
int n, a[MX];
void prepare(int l, int r, int level) {
  if(l==r) return;
  int m = (l+r)/2;
  tab[level][m] = a[m];
  tab[level][m+1] = a[m+1];
  for(int i=m-1; i>=l; --i) {
    tab[level][i] = Secret(a[i], tab[level][i+1]);
  }
  for(int i=m+2; i<=r; ++i) {
    tab[level][i] = Secret(a[i], tab[level][i-1]);
  }
  for(int i=m+1; i<=r; ++i) {
    mask[i] ^= 1<<level;
  }
  prepare(l, m, level+1);
  prepare(m+1, r, level+1);
}
void Init(int N, int A[]) {
  n = N;
  for(int i=0; i<n; ++i) {
    a[i] = A[i];
  }
  prepare(0, n-1, 0);
}

int Query(int L, int R) {
  if(L==R) return a[L];
  int level = __builtin_ctz(mask[L]^mask[R]);
  return Secret(tab[level][L], tab[level][R]);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 115 ms 2412 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271.
2 Incorrect 118 ms 2288 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 117 ms 2392 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 462 ms 4196 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536.
5 Incorrect 427 ms 4296 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 445 ms 4196 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050.
7 Incorrect 483 ms 4312 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570.
8 Incorrect 442 ms 4316 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264.
9 Incorrect 447 ms 4276 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135.
10 Incorrect 459 ms 4300 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726.