#include<bits/stdc++.h>
using namespace std;
#include"secret.h"
#define N 1005
int n,dp[N][N];
void sol(int l,int r,int type,int *a){
if(l==r)return void(dp[l][r]=a[l]);
int mid=(l+r)/2;
sol(l,mid,type,a);
sol(mid+1,r,type,a);
if(type==1)for(int i=l;i<=mid;i++)dp[i][r]=Secret(dp[i][mid],dp[mid+1][r]);
else for(int i=mid+1;i<=r;i++)dp[l][i]=Secret(dp[l][mid],dp[mid+1][i]);
}
void Init(int nn, int *a){
n=nn;
for(int i=0;i<n;i++)for(int j=0;j<n;j++)dp[i][j]=-1;
sol(0,(n-1)/2,1,a);
if(n>1)sol((n-1)/2+1,n-1,2,a);
}
int Query(int ll, int rr){
int l=0,r=n-1;
if(ll==rr)return dp[ll][rr];
if(ll<=(n-1)/2&&rr>(n-1)/2)return Secret(dp[ll][(n-1)/2],dp[(n-1)/2+1][rr]);
while(l<=r){
int mid=(l+r)/2;
if(ll<=mid&&mid<rr)return Secret(dp[ll][mid],dp[mid+1][rr]);
if(rr<=mid)r=mid;
else l=mid+1;
}
}
Compilation message
secret.cpp: In function 'int Query(int, int)':
secret.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
34 | }
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
113 ms |
4300 KB |
Wrong Answer [1] |
2 |
Incorrect |
117 ms |
4392 KB |
Wrong Answer [1] |
3 |
Incorrect |
114 ms |
4296 KB |
Wrong Answer [1] |
4 |
Incorrect |
426 ms |
8140 KB |
Wrong Answer [1] |
5 |
Incorrect |
450 ms |
8228 KB |
Wrong Answer [1] |
6 |
Incorrect |
434 ms |
8268 KB |
Wrong Answer [1] |
7 |
Correct |
437 ms |
8136 KB |
Output is correct - number of calls to Secret by Init = 4488, maximum number of calls to Secret by Query = 1 |
8 |
Correct |
446 ms |
8240 KB |
Output is correct - number of calls to Secret by Init = 4488, maximum number of calls to Secret by Query = 1 |
9 |
Correct |
447 ms |
8156 KB |
Output is correct - number of calls to Secret by Init = 4488, maximum number of calls to Secret by Query = 1 |
10 |
Correct |
454 ms |
8104 KB |
Output is correct - number of calls to Secret by Init = 4488, maximum number of calls to Secret by Query = 1 |