Submission #751602

#	Time	Username	Problem	Language	Result	Execution time	Memory
751602		Markomafko972	Secret (JOI14_secret)	C++14	0 / 100	431 ms	8364 KiB

secret

#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
 
int n;
int a[1005];
int val[1005][1005];
vector<int> v[1005];
int kol = 0;
 
// 4: 0 1 2 3 
 
void rek(int l, int r) {
	if (l > r) return;
	if (l == r) {
		val[l][l] = a[l];
		return;
	}
	if (l+1 == r) {
		val[l][r] = Secret(val[l][l], val[r][r]);
		return;
	}
	
	int mid = (l+r)/2;
	val[mid][mid] = a[mid];
	for (int j = mid-1; j >= l; j--) {
		if (kol == 8000) assert(0);
		val[j][mid] = Secret(val[j+1][mid], a[j]);
		kol++;
	}
	val[mid+1][mid+1] = a[mid+1];
	for (int j = mid+2; j <= r; j++) {
		if (kol == 8000) assert(0);
		val[mid+1][j] = Secret(val[mid+1][j-1], a[j]);
		kol++;
	}
 
	rek(l, mid);
	rek(mid+1, r);
}
 
void Init(int N, int A[]) {
	n = N;
	memset(val, -1, sizeof val);
	for (int i = 0; i < n; i++) {
		a[i] = A[i];
		val[i][i] = a[i];
	}
	rek(0, n-1);
}
 
int Query(int l, int r) {
	if (l == r) return a[l];
	for (int i = l; i < r; i++) {
		if (val[l][i] != -1 && val[i+1][r] != -1) return Secret(val[l][i], val[i+1][r]);
	}
	return -1;
}

• Subtask 1: 0 / 100