oj.uz

Submission #881978

# Submission time Handle Problem Language Result Execution time Memory
881978 2023-12-02T11:13:23 Z Alan Secret (JOI14_secret) C++17
0 / 100
 771 ms 8616 KB 
#include <bits/stdc++.h>
using namespace std;

int Secret(int X, int Y);

int ans[1005][1005], N;

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

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

int solve (int l, int r, int ql, int qr) {
	int mid = (l+r)/2;
	if (qr <= mid) return solve(l, mid, ql, qr);
	if (mid+1 <= l) return solve(mid+1, r, ql, qr);
	return Secret(ans[ql][mid], ans[mid+1][qr]);
}

int Query (int L, int R) {
	if (ans[L][R] != -1) return ans[L][R];
	return solve(0, N-1, L, R);
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 102 ms 6736 KB Wrong Answer [1]
2 Incorrect 100 ms 6736 KB Wrong Answer [1]
3 Incorrect 240 ms 6732 KB Wrong Answer [1]
4 Incorrect 460 ms 8368 KB Wrong Answer [1]
5 Incorrect 379 ms 8204 KB Wrong Answer [1]
6 Incorrect 383 ms 8372 KB Wrong Answer [1]
7 Correct 771 ms 8616 KB Output is correct - number of calls to Secret by Init = 6997, maximum number of calls to Secret by Query = 1
8 Correct 415 ms 8368 KB Output is correct - number of calls to Secret by Init = 6997, maximum number of calls to Secret by Query = 1
9 Correct 390 ms 8364 KB Output is correct - number of calls to Secret by Init = 6997, maximum number of calls to Secret by Query = 1
10 Correct 389 ms 8360 KB Output is correct - number of calls to Secret by Init = 6997, maximum number of calls to Secret by Query = 1