#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
int n,B[1006],ans[1006][1006];
void init(int s,int e)
{
int m=(s+e)>>1;
ans[m][m]=B[m];
if(s==e) return;
ans[m+1][m+1]=B[m+1];
for(int i=m-1;i>=s;i--) ans[i][m]=Secret(ans[i+1][m],B[i]);
for(int i=m+2;i<=e;i++) ans[m+1][i]=Secret(ans[m+1][i-1],B[i]);
init(s,m),init(m+1,e);
}
void Init(int N,int A[])
{
n=N;
for(int i=0;i<N;i++) B[i]=A[i];
init(0,n-1);
}
int solve(int l,int r,int s,int e)
{
int m=(s+e)>>1;
if(l<=m && m+1<=r) return Secret(ans[l][m],ans[m+1][r]);
if(!(m+1<=r)) solve(l,r,s,m);
else solve(l,r,m+1,e);
}
int Query(int l,int r)
{
return solve(l,r,0,n-1);
}
Compilation message
secret.cpp: In function 'int solve(int, int, int, int)':
secret.cpp:27:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
155 ms |
4444 KB |
Wrong Answer: Query(113, 206) - expected : 536899947, actual : 538256673. |
2 |
Incorrect |
156 ms |
4580 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560. |
3 |
Incorrect |
154 ms |
4580 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500. |
4 |
Incorrect |
565 ms |
8520 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568. |
5 |
Incorrect |
565 ms |
8520 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316. |
6 |
Execution timed out |
20022 ms |
8520 KB |
Time limit exceeded |
7 |
Incorrect |
617 ms |
8520 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873. |
8 |
Incorrect |
573 ms |
8520 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792. |
9 |
Incorrect |
570 ms |
8552 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577. |
10 |
Incorrect |
566 ms |
8552 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787. |