Submission #1291556

#TimeUsernameProblemLanguageResultExecution timeMemory
1291556ereringSecret (JOI14_secret)C++20
0 / 100
334 ms8368 KiB
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
int p[1005][1005];
int arr[1001],n;
void solve(int l,int r){
  int mid=(l+r)/2,result=arr[mid];
  p[mid][mid]=arr[mid];
  if(l>=r) return;
  for(int i=mid+1;i<=r;i++){
    result=Secret(result,arr[i]);
    p[mid][i]=result;
  }
  p[mid-1][mid]=mid;
  for(int i=mid-1;i>=l;i--){
    result=Secret(arr[i],result);
    if(i!=0) p[i-1][mid]=result;
  }
  solve(l,(l+r)/2-1);
  solve((l+r)/2+1,r);
  return;
}
void Init(int N, int A[]) {
  n=N;
  for(int i=0;i<n;i++) arr[i]=A[i];
  memset(p,-1,sizeof p);
  solve(0,n-1);
  return;
}

int Query(int L, int R){
  if(L==R||p[L][R]!=-1) return p[L][R];
  for(int i=L;i<=R;i++){
    if(p[L][i]!=-1&&p[i][R]!=-1) return Secret(p[L][i],p[i][R]);
  }
}

Compilation message (stderr)

secret.cpp: In function 'int Query(int, int)':
secret.cpp:36:1: warning: control reaches end of non-void function [-Wreturn-type]
   36 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...