#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
int qry(int a, int b){
return Secret(a, b);
}
vector <vector<int>> dp;
int n;
void Init(int N, int A[]) {
n = N;
dp.resize(n);
for ( auto &u: dp ) u.resize(n);
auto dnc = [&](auto dnc, int l, int r) -> void{
if ( l > r ) return;
if ( l == r ){
dp[l][l] = A[l];
return;
}
int m = (l + r) / 2;
dp[m][m] = A[m], dp[m + 1][m + 1] = A[m + 1];
for ( int i = m - 1; i >= l; i-- ){
dp[m][i] = qry(dp[m][i + 1], A[i]);
}
for ( int i = m + 2; i <= r; i++ ){
dp[m + 1][i] = qry(dp[m + 1][i - 1], A[i]);
}
dnc(dnc, l, m - 1);
dnc(dnc, m + 1, r);
};
dnc(dnc, 0, n - 1);
}
int Query(int L, int R) {
if ( L == R ) return dp[L][R];
int a = 0, b = n - 1;
while ( true ){
int m = (a + b) / 2;
if ( L <= m && R > m ) return qry(dp[m][L], dp[m + 1][R]);
else if ( R == m ) return dp[m][L];
else if ( L == m + 1 ) return dp[m + 1][R];
else if ( m > R ) b = m - 1;
else a = m;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
79 ms |
3668 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 38994019. |
2 |
Incorrect |
79 ms |
3656 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560. |
3 |
Incorrect |
78 ms |
3848 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500. |
4 |
Incorrect |
303 ms |
8460 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568. |
5 |
Incorrect |
301 ms |
8272 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316. |
6 |
Incorrect |
299 ms |
8264 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 950174288. |
7 |
Incorrect |
308 ms |
8444 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873. |
8 |
Incorrect |
300 ms |
8264 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792. |
9 |
Incorrect |
313 ms |
8284 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577. |
10 |
Incorrect |
307 ms |
8264 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787. |