제출 #1237135

#제출 시각아이디문제언어결과실행 시간메모리
1237135antromancap비밀 (JOI14_secret)C++20
0 / 100
333 ms8320 KiB
#include "secret.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 1001;
int n, dp[N][N];

void divi(int l, int r) {
	if (l >= r) return;
	int m = (l + r) >> 1;
	for (int i = m - 1; i >= l; i--) dp[i][m] = Secret(dp[i + 1][m], dp[i][i]);
	for (int i = m + 2; i <= r; i++) dp[m + 1][i] = Secret(dp[m + 1][i - 1], dp[i][i]);
	divi(l, m);
	divi(m + 1, r);
}

void Init(int N, int A[]) {
	::n = N;
	memset(dp, -1, sizeof dp);
	for (int i = 0; i < n; i++) dp[i][i] = A[i];
	divi(0, n);
}

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

컴파일 시 표준 에러 (stderr) 메시지

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