Submission #573963

# Submission time Handle Problem Language Result Execution time Memory
573963 2022-06-07T13:48:45 Z Vanilla Secret (JOI14_secret) C++17
0 / 100
450 ms 12304 KB
#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
const int maxn = 1005;
long long pref [maxn][maxn];

void build (int l, int r) {
	if (l >= r) return;
	int mid = (l + r) / 2;
	for (int i = mid - 1; i >= l; i--){
		pref[i][mid] = Secret(pref[i + 1][mid], pref[i][i]);
	}
	for (int i = mid + 2; i <= r; i++){
		pref[mid + 1][i] = Secret(pref[mid + 1][i-1], pref[i][i]);
	}
	build (l, mid);
	build (mid + 1, r);

}

void Init(int N, int A[]) {
	for (int i = 0; i < N; i++){
		for (int j = 0; j < N; j++) {
			pref[i][j] = -1;
		}
		pref[i][i] = A[i];
	}
	build(0, N - 1);
}

int Query(int L, int R) {
	if (pref[L][R] != -1) return pref[L][R];
	for (int i = L; i < R; i++){
		if (pref[L][i] != -1 && pref[i + 1][R] != -1)
			return Secret(pref[L][i], pref[i + 1][R]);
	}
	assert(0);
}
# Verdict Execution time Memory Grader output
1 Incorrect 117 ms 6412 KB Wrong Answer: Query(113, 206) - expected : 536899947, actual : 538256673.
2 Incorrect 123 ms 6440 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 127 ms 6456 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 429 ms 12132 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 434 ms 12184 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 450 ms 12196 KB Wrong Answer: Query(653, 654) - expected : 227441904, actual : 93182529.
7 Incorrect 437 ms 12180 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 435 ms 12236 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 437 ms 12136 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 433 ms 12304 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.