#include<bits/stdc++.h>
#include "secret.h"
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define pb push_back
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
const int mxn=1e3;
int ans[11][mxn+10];
int v[mxn+10],in[mxn+10];
void solve(int l,int r,int lev){
if(l==r)return;
int m=(r+l)/2;
ans[lev][m]=v[m];
for(int i=m-1;i>=l;i--)ans[lev][i]=Secret(v[i],ans[lev][i+1]);
ans[lev][m+1]=v[m+1];
for(int i=m+2;i<=r;i++)ans[lev][i]=Secret(v[i],ans[lev][i-1]);
for(int i=m+1;i<=r;i++)in[i]^=(1ll<<lev);
solve(l,m,lev+1);
solve(m+1,r,lev+1);
}
void Init(int N,int A[]){
for(int i=0;i<N;i++)v[i]=A[i];
solve(0,N-1,0);
}
int Query(int L,int R){
if(L==R)return v[L];
int b=__builtin_ctz(in[L]^in[R]);
return Secret(ans[b][L],ans[b][R]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
104 ms |
2364 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271. |
2 |
Incorrect |
102 ms |
2300 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376. |
3 |
Incorrect |
101 ms |
2372 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820. |
4 |
Incorrect |
379 ms |
4208 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536. |
5 |
Incorrect |
385 ms |
4256 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838. |
6 |
Incorrect |
404 ms |
4292 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050. |
7 |
Incorrect |
392 ms |
4324 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570. |
8 |
Incorrect |
394 ms |
4300 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264. |
9 |
Incorrect |
384 ms |
4272 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135. |
10 |
Incorrect |
382 ms |
4320 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726. |