#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>>dp,comp;
void recur(int l, int r,vector<int>&a){
if(l >= r)return;
int m = (l+r)/2;
for(int i = m-1;i>=l;--i)dp[i][m] = Secret(a[i],dp[i+1][m]),comp[i][m] =1;
for(int i = m+2;i<=r;++i)dp[m+1][i] = Secret(dp[m+1][i-1],a[i]),comp[m+1][i] = 1;
recur(l,m-1,a);
recur(m+1,r,a);
}
void Init(int N, int A[]) {
dp = vector<vector<int>>(N, vector<int>(N,0));
comp = vector<vector<int>>(N, vector<int>(N,0));
vector<int>a;
for(int i = 0;i<N;++i)dp[i][i] = A[i],a.push_back(A[i]),comp[i][i] = 1;
recur(0,N-1,a);
}
int Query(int L, int R) {
for(int i = L;i<=R;++i){
if(comp[L][i] && comp[i+1][R]){
return Secret(dp[L][i],dp[i+1][R]);
}
}
return dp[L][R];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
122 ms |
4428 KB |
Output is correct - number of calls to Secret by Init = 3331, maximum number of calls to Secret by Query = 1 |
2 |
Correct |
125 ms |
4428 KB |
Output is correct - number of calls to Secret by Init = 3339, maximum number of calls to Secret by Query = 1 |
3 |
Correct |
124 ms |
4476 KB |
Output is correct - number of calls to Secret by Init = 3347, maximum number of calls to Secret by Query = 1 |
4 |
Correct |
424 ms |
12112 KB |
Output is correct - number of calls to Secret by Init = 7467, maximum number of calls to Secret by Query = 1 |
5 |
Correct |
431 ms |
12088 KB |
Output is correct - number of calls to Secret by Init = 7476, maximum number of calls to Secret by Query = 1 |
6 |
Runtime error |
437 ms |
24472 KB |
Execution killed with signal 11 |
7 |
Correct |
432 ms |
12236 KB |
Output is correct - number of calls to Secret by Init = 7476, maximum number of calls to Secret by Query = 1 |
8 |
Correct |
436 ms |
12236 KB |
Output is correct - number of calls to Secret by Init = 7476, maximum number of calls to Secret by Query = 1 |
9 |
Correct |
435 ms |
12108 KB |
Output is correct - number of calls to Secret by Init = 7476, maximum number of calls to Secret by Query = 1 |
10 |
Correct |
439 ms |
12188 KB |
Output is correct - number of calls to Secret by Init = 7476, maximum number of calls to Secret by Query = 1 |