#include <bits/stdc++.h>
using namespace std;
int Secret(int l, int r);
vector<vector<int>>dvc;
vector<int>arr;
void dc(int l, int r, int lvl){
if(l==r){
dvc[lvl][l]=arr[l];
return;
}
int mid=(l+r)/2;
dvc[lvl][mid]=arr[mid];
dvc[lvl][mid+1]=arr[mid+1];
for(int i=mid-1;i>=l;i--){
dvc[lvl][i]=Secret(dvc[lvl][i+1],arr[i]);
}
for(int i=mid+2;i<=r;i++){
dvc[lvl][i]=Secret(dvc[lvl][i-1],arr[i]);
}
dc(l,mid,lvl+1);
dc(mid+1,r,lvl+1);
}
void Init(int n, int a[]){
arr.resize(n);
for(int i=0;i<n;i++){
arr[i]=a[i];
}
dvc.resize(21,vector<int>(n));
dc(0,n-1,0);
}
int retorno(int a,int b,int l,int r, int lvl){
int mid=(a+b)/2;
if(a==b){
return dvc[lvl][l];
}
if(r<(mid+1)){
return retorno(l,mid,l,r,lvl+1);
}
else if(l>mid){
return retorno(mid+1,r,l,r,lvl+1);
}
return Secret(dvc[lvl][l],dvc[lvl][r]);
}
int Query(int l,int r){
return retorno(0,arr.size()-1,l,r,0);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
78 ms |
2652 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 844367448. |
2 |
Incorrect |
78 ms |
2384 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560. |
3 |
Incorrect |
73 ms |
2388 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500. |
4 |
Incorrect |
307 ms |
4436 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568. |
5 |
Incorrect |
276 ms |
4436 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316. |
6 |
Incorrect |
292 ms |
4592 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 580039240. |
7 |
Incorrect |
289 ms |
4352 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873. |
8 |
Incorrect |
280 ms |
4460 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792. |
9 |
Incorrect |
302 ms |
4440 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577. |
10 |
Incorrect |
282 ms |
4452 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787. |