Submission #125933

#	Time	Username	Problem	Language	Result	Execution time	Memory
125933		AlexLuchianov	비밀 (JOI14_secret)	C++14	0 / 100	990 ms	524292 KiB

secret

#include <secret.h>

int const nmax = 1000;

//int Secret(int X, int Y)

int dp[1 + nmax][1 + nmax];
int v[1 + nmax];

void compute(int from, int to){
  int mid = (from + to) / 2;
  compute(from, mid);
  compute(mid + 1, to);
  for(int i = mid - 1; from <= i; i--){
    if(dp[i][mid] == -1)
      dp[i][mid] = Secret(v[i], dp[i + 1][mid]);
  }
  for(int i = mid + 2; i <= to; i++)
    if(dp[mid + 1][i] == -1)
      dp[mid + 1][i] = Secret(dp[mid + 1][i - 1], v[i]);
}
int n;

void Init(int N, int A[]){
  n = N;
  for(int i = 0; i < n; i++)
    v[i] = A[i];

  for(int i = 0;i < N; i++)
    for(int j = i; j < N; j++)
      dp[i][j] = -1;
  for(int i = 0; i < n; i++)
    dp[i][i] = v[i];
  compute(0, N - 1);
}

int ask(int from, int to, int x, int y){
  int mid = (from + to)/ 2;
  if(x <= mid && mid + 1 <= y)
    return Secret(dp[x][mid], dp[mid + 1][y]);
  else {
    if(y <= mid)
      return ask(from, mid, x, y);
    else
      return ask(mid + 1, to, x, y);
  }
}

int Query(int L, int R) {
  return ask(0, n - 1, L, R);
}

• Subtask 1: 0 / 100