#include <bits/stdc++.h>
using namespace std ;
#include "secret.h"
int arr[100001] , arr1[1001][1001];
#define MAX_VALUE 1000000000
void Init(int N, int A[])
{
for(int i = 0 ; i < N ; ++i)
arr[i] = A[i] ;
for(int i = 0 ; i < N ; ++i)
{
arr1[i][i] = arr[i] ;
for(int j = i+1 ; j <= N ; ++j)
arr1[i][j] = Secret(arr1[i][j-1] , arr[j]);
}
}
int Query(int l, int r)
{
return arr1[l][r] ;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
307 ms |
4472 KB |
Output isn't correct - number of calls to Secret by Init = 130816, maximum number of calls to Secret by Query = 0 |
2 |
Incorrect |
307 ms |
4580 KB |
Output isn't correct - number of calls to Secret by Init = 131328, maximum number of calls to Secret by Query = 0 |
3 |
Incorrect |
308 ms |
4580 KB |
Output isn't correct - number of calls to Secret by Init = 131841, maximum number of calls to Secret by Query = 0 |
4 |
Incorrect |
1178 ms |
8588 KB |
Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0 |
5 |
Incorrect |
1157 ms |
8632 KB |
Output isn't correct - number of calls to Secret by Init = 500500, maximum number of calls to Secret by Query = 0 |
6 |
Incorrect |
1161 ms |
8632 KB |
Output isn't correct - number of calls to Secret by Init = 500500, maximum number of calls to Secret by Query = 0 |
7 |
Incorrect |
1160 ms |
8632 KB |
Output isn't correct - number of calls to Secret by Init = 500500, maximum number of calls to Secret by Query = 0 |
8 |
Incorrect |
1152 ms |
8632 KB |
Output isn't correct - number of calls to Secret by Init = 500500, maximum number of calls to Secret by Query = 0 |
9 |
Incorrect |
1182 ms |
8632 KB |
Output isn't correct - number of calls to Secret by Init = 500500, maximum number of calls to Secret by Query = 0 |
10 |
Incorrect |
1168 ms |
8632 KB |
Output isn't correct - number of calls to Secret by Init = 500500, maximum number of calls to Secret by Query = 0 |