#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 tab[11][mxn+10],lg;
void Init(int N,int A[]){
for(int i=0;i<N;i++)tab[0][i]=A[i];
for(int i=1;i<=lg;i++){
for(int j=0;j+(1<<(i-1))<N;j++){
tab[i][j]=Secret(tab[i-1][j],tab[i-1][j+(1<<(i-1))]);
}
}
}
int Query(int L,int R){
lg=log2(R-L+1);
return Secret(tab[lg][L],tab[lg][R-(1<<lg)+1]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
99 ms |
2404 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 536870912. |
2 |
Incorrect |
99 ms |
2336 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 0. |
3 |
Incorrect |
99 ms |
2380 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 536870912. |
4 |
Incorrect |
370 ms |
4300 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 536870912. |
5 |
Incorrect |
368 ms |
4320 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 536870912. |
6 |
Incorrect |
374 ms |
4304 KB |
Wrong Answer: Query(915, 915) - expected : 282904741, actual : 31281100. |
7 |
Incorrect |
381 ms |
4264 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 0. |
8 |
Incorrect |
369 ms |
4264 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 536870912. |
9 |
Incorrect |
371 ms |
4336 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 0. |
10 |
Incorrect |
369 ms |
4336 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 0. |