#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
const int MM = 1e3+5;
int n,a[MM],pre[11][MM],mask[MM];
void rec(int l, int r, int d){
if(l == r) return;
int mid = (l+r)/2;
pre[d][mid] = a[mid];
for(int i = mid-1; i >= l; i--) Secret(pre[d][i+1],a[i]);
pre[d][mid+1] = a[mid+1];
for(int i = mid+2; i <= r; i++) Secret(pre[d][i-1],a[i]);
for(int i = mid+1; i <= r; i++) mask[i] ^= (1<<d);
rec(l,mid,d+1); rec(mid+1,r,d+1);
}
void Init(int N, int A[]){
n = N;
for(int i = 0; i < n; i++) a[i] = A[i];
rec(0,n-1,0);
}
int Query(int L, int R){
if(L == R) return a[L];
int d = __builtin_ctz(mask[L]^mask[R]);
return Secret(pre[d][L],pre[d][R]);
}
/*
int main(){
cin.tie(0)->sync_with_stdio(0);
}*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
141 ms |
2368 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 536870912. |
2 |
Incorrect |
149 ms |
2412 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 0. |
3 |
Incorrect |
139 ms |
2500 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 536870912. |
4 |
Incorrect |
518 ms |
4296 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 536870912. |
5 |
Incorrect |
504 ms |
4324 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 536870912. |
6 |
Incorrect |
522 ms |
4372 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 942318537. |
7 |
Incorrect |
528 ms |
4300 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 0. |
8 |
Incorrect |
508 ms |
4356 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 536870912. |
9 |
Incorrect |
521 ms |
4312 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 0. |
10 |
Incorrect |
522 ms |
4396 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 0. |