#include <bits/stdc++.h>
#include "secret.h"
const int N = 1e3 + 10;
int n, a[N], pre[N][N];
//int Secret( int a, int b ) { return a + b; }
void solve( int l, int r ) {
if( l == r ) return ;
int mid = ( l + r ) / 2;
for( int i = mid - 1 ; i >= l ; i-- ) pre[i][mid] = Secret( a[i], pre[i+1][mid] );
for( int i = mid + 2 ; i <= r ; i++ ) pre[mid+1][i] = Secret( a[i], pre[mid+1][i-1] );
solve( l, mid ), solve( mid+1, r );
}
void Init( int N, int A[] ) {
n = N;
memset( pre, -1, sizeof pre );
for( int i = 0 ; i < n ; i++ ) pre[i][i] = a[i] = A[i];
solve( 0, n-1 );
}
int Query( int l, int r ) {
if( pre[l][r] != -1 ) return pre[l][r];
for( int i = l ; i < r ; i++ ) if( pre[l][i] != -1 && pre[i+1][r] != -1 ) return Secret( pre[l][i], pre[i+1][r] );
}
/*int main()
{
int n, x[N], q;
scanf("%d",&n);
for( int i = 0 ; i < n ; i++ ) scanf("%d",&x[i]);
Init( n, x );
scanf("%d",&q);
while( q-- ) {
int a, b;
scanf("%d %d",&a,&b);
printf("%d\n",Query( a, b ) );
}
}*/
Compilation message
secret.cpp: In function 'int Query(int, int)':
secret.cpp:29:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
139 ms |
6392 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 554110774. |
2 |
Incorrect |
140 ms |
6396 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376. |
3 |
Incorrect |
137 ms |
6392 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820. |
4 |
Incorrect |
504 ms |
8312 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536. |
5 |
Incorrect |
501 ms |
8568 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838. |
6 |
Incorrect |
505 ms |
8312 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050. |
7 |
Incorrect |
509 ms |
8404 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570. |
8 |
Incorrect |
503 ms |
8316 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264. |
9 |
Incorrect |
502 ms |
8312 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135. |
10 |
Incorrect |
503 ms |
8384 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726. |