oj.uz

답안 #480570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
480570 2021-10-17T06:07:34 Z erke 비밀 (JOI14_secret) C++14
0 / 100
 514 ms 4444 KB 
#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
 
const int MAX_N = 1005;
 
int n, a[MAX_N], dat[MAX_N][15], mask[MAX_N];
 
void divi(int l, int r, int lev) {
  if (l == r) return;
  int m = (l + r) / 2;
  dat[m][lev] = a[m];
  for (int i = m - 1; i >= l; i--) {
    dat[i][lev] = Secret(a[i], dat[i + 1][lev]);
  }
  dat[m + 1][lev] = a[m + 1];
  for (int i = m + 2; i <= r; i++) {
    dat[i][lev] = Secret(a[i], dat[i - 1][lev]);
  }
  for (int i = m + 1; i <= r; i++) {
    mask[i] ^= (1 << lev);
  }
  divi(l, m, lev + 1);
  divi(m + 1, r, lev + 1);
}
 
void Init(int N, int A[]) {
  n = N;
  for (int i = 0; i < N; i++) {
    a[i] = A[i];
  }
  divi(0, n - 1, 0);
}
 
int Query(int L, int R) {
  if (L == R) return a[L];
  int bits = __builtin_ctz(mask[L] ^ mask[R]);
  return Secret(dat[L][bits], dat[R][bits]);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 132 ms 2372 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271.
2 Incorrect 134 ms 2388 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 137 ms 2360 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 509 ms 4444 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536.
5 Incorrect 500 ms 4332 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 506 ms 4368 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050.
7 Incorrect 514 ms 4268 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570.
8 Incorrect 510 ms 4332 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264.
9 Incorrect 507 ms 4280 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135.
10 Incorrect 511 ms 4244 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726.