oj.uz

Submission #954532

# Submission time Handle Problem Language Result Execution time Memory
954532 2024-03-28T06:13:52 Z IBory Secret (JOI14_secret) C++17
100 / 100
 398 ms 5148 KB 
#include "secret.h"
#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;

const int MAX = 1004;
map<pii, int> D;
int N, S[MAX];

void DnC1(int L, int R) {
	if (L >= R) return;
	int mid = (L + R) >> 1;

	int pv = -1;
	for (int i = mid - 1; i >= L; --i) {
		int n = -1;
		if (pv == -1) n = Secret(S[i], S[mid]);
		else n = Secret(S[i], pv);
		pv = D[{i, mid}] = n;
	}
	pv = -1;
	for (int i = mid + 2; i <= R; ++i) {
		int n = -1;
		if (pv == -1) n = Secret(S[mid + 1], S[i]);
		else n = Secret(pv, S[i]);
		pv = D[{mid + 1, i}] = n;
	}

	DnC1(L, mid);
	DnC1(mid + 1, R);
}

void Init(int _N, int A[]) {
	N = _N;
	for (int i = 0; i < N; ++i) S[i] = A[i];
	DnC1(0, N - 1);
	for (int i = 0; i < N; ++i) D[{i, i}] = A[i];
}

int DnC2(int L, int R, int s, int e) {
	if (L >= R) return -1;
	int mid = (L + R) >> 1;

	if (s <= mid && mid < e) {
		int a = D[{s, mid}], b = D[{mid + 1, e}];
		return Secret(a, b);
	}

	if (e <= mid) return DnC2(L, mid, s, e);
	else return DnC2(mid + 1, R, s, e);
}

int Query(int L, int R) {
	if (D.find(pii{L, R}) != D.end()) return D[{L, R}];
	return DnC2(0, N - 1, L, R);
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 2724 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 108 ms 2724 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 109 ms 2900 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 381 ms 4840 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 383 ms 4692 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 384 ms 4788 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 377 ms 4772 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 393 ms 5148 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 380 ms 4768 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 398 ms 4900 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1