#include <bits/stdc++.h>
using namespace std ;
#include "secret.h"
int arr[1001] ;
void Init(int N, int A[])
{
for(int i = 0 ; i < N ; ++i)
arr[i] = A[i] ;
}
int Query(int l, int r)
{
int x = arr[l] ;
for(int i = l+1 ; i <= r ; ++i)
x = x + min(2 * arr[i] / 2 , 1000000000);
return x ;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
158 ms |
2552 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : -596854895. |
2 |
Incorrect |
160 ms |
2656 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 901752200. |
3 |
Incorrect |
172 ms |
2744 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : -534577784. |
4 |
Incorrect |
648 ms |
4880 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : -2076262450. |
5 |
Incorrect |
573 ms |
4880 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 1875953161. |
6 |
Incorrect |
614 ms |
5056 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 1898949771. |
7 |
Incorrect |
608 ms |
5192 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : -1328130574. |
8 |
Incorrect |
610 ms |
5300 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : -1026341846. |
9 |
Incorrect |
602 ms |
5400 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 1457463153. |
10 |
Incorrect |
613 ms |
5620 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 1725737184. |