oj.uz

답안 #578684

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578684 2022-06-17T15:14:03 Z ddy888 비밀 (JOI14_secret) C++17
0 / 100
 449 ms 4324 KB 
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define fi first
#define si second
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;  
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, arr[1010];
int t[10][1010];
int mask[1010];

void build(int l, int r, int level) {
    if (l == r) return;
    int m = (l + r) >> 1;
    t[level][m] = arr[m];
    for (int i = m - 1; i >= l; --i) t[level][i] = Secret(arr[i], t[level][i + 1]);
    t[level][m + 1] = arr[m + 1];
    for (int i = m + 2; i <= r; ++i) t[level][i] = Secret(arr[i], t[level][i - 1]);
    for (int i = m + 1; i <= r; ++i) mask[i] ^= (1 << level);
    build(l, m, level + 1);
    build(m + 1, r, level + 1);
}

void Init(int N, int A[]) {
    n = N;
    for (int i = 0; i < n; ++i) arr[i] = A[i];
    build(0, n - 1, 0);
}

int Query(int L, int R) {
    if (L == R) return arr[L];
    int bits = __builtin_ctz(mask[L] ^ mask[R]);
    return Secret(t[bits][L], t[bits][R]);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 111 ms 2380 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271.
2 Incorrect 115 ms 2372 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 115 ms 2312 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 421 ms 4252 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536.
5 Incorrect 432 ms 4280 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 424 ms 4312 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050.
7 Incorrect 427 ms 4324 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570.
8 Incorrect 425 ms 4320 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264.
9 Incorrect 431 ms 4260 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135.
10 Incorrect 449 ms 4252 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726.