oj.uz

답안 #553674

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553674 2022-04-26T13:59:41 Z QwertyPi 비밀 (JOI14_secret) C++14
100 / 100
 491 ms 5340 KB 
#include "secret.h"
#include <bits/stdc++.h>
#define MAXN 1001

using namespace std;

int N;
int A[MAXN];
vector<int> pf[MAXN * 4], sf[MAXN * 4];
map<pair<int, int>, int> memo;
void build(int v = 0, int l = 0, int r = N - 1){
	pf[v].resize(r - l + 1);
	sf[v].resize(r - l + 1);
	pf[v][0] = A[l];
	if(l != 0 || r != N - 1){
		for(int i = 1; i <= r - l; i++){
			pf[v][i] = memo.find({l, l + i}) != memo.end() ? memo[{l, l + i}] : Secret(pf[v][i - 1], A[l + i]);
		}
		sf[v][r - l] = A[r];
		for(int i = r - l - 1; i > 0; i--){
			sf[v][i] = memo.find({l + i, r}) != memo.end() ? memo[{l + i, r}] : Secret(A[l + i], sf[v][i + 1]);
		}
		for(int i = 0; i <= r - l; i++){
			memo[{l, l + i}] = pf[v][i];
			memo[{l + i, r}] = sf[v][i];
		}
	}
	if(l != r){
		int m = (l + r) / 2;
		build(v * 2 + 1, l, m);
		build(v * 2 + 2, m + 1, r); 
	}
}

int qry(int l, int r, int v = 0, int tl = 0, int tr = N - 1){
	int tm = (tl + tr) / 2; 
	if(l == r) return A[l];
	if(l <= tm && tm < r){
		return Secret(l == tl ? pf[v * 2 + 1][tm - tl] : sf[v * 2 + 1][l - tl], pf[v * 2 + 2][r - (tm + 1)]);
	}
	if(r <= tm){
		return qry(l, r, v * 2 + 1, tl, tm);
	}else{
		return qry(l, r, v * 2 + 2, tm + 1, tr);
	}
}

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

int Query(int L, int R) {
  return qry(L, R);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 2900 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 128 ms 3020 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 144 ms 2892 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 449 ms 5276 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 475 ms 5188 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 445 ms 5340 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 477 ms 5244 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 443 ms 5224 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 491 ms 5172 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 438 ms 5188 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1