oj.uz

답안 #701826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
701826 2023-02-22T07:13:28 Z RandomLB 비밀 (JOI14_secret) C++17
100 / 100
 434 ms 8408 KB 
#include "secret.h"
#include <algorithm>
#include <bits/stdc++.h>
#include <queue>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
#define pb push_back
#define siz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define ms(x, a) memset(x, a, sizeof(x))
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values){
	cout << vars << " = ";
	string delim = "";
	(...,(cout << delim << values, delim = ", "));
	cout << endl;
}
const int INF = 0x3f3f3f3f;
//=================================
const int MAX = 1005;
int arr[MAX], res[MAX][MAX], n;

int secret(int a, int b){ return a+b/2*2; }

void solve(int l, int r){
	if (l == r) return;
	int m = l+(r-l)/2;
	res[m][m] = arr[m], res[m+1][m+1] = arr[m+1];
	for (int i = m-1; i >= l; i--) res[i][m] = Secret(arr[i], res[i+1][m]);
	for (int i = m+2; i <= r; i++) res[m+1][i] = Secret(res[m+1][i-1], arr[i]);
	solve(l, m); solve(m+1, r);
}

int solve(int l, int r, int tl, int tr){
	int m = l+(r-l)/2;
	if (tl <= m && m < tr) return Secret(res[tl][m], res[m+1][tr]);
	return (tr <= m? solve(l, m, tl, tr) : solve(m+1, r, tl, tr));
}

void Init(int N, int v[]){
	n = N;
	for (int i = 0; i < n; i++) arr[i] = v[i];
	solve(0, n-1);
}

int Query(int l, int r){
	if (l == r) return arr[l];
	return solve(0, n-1, l, r);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 4532 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 120 ms 4400 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 120 ms 4428 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 429 ms 8268 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 425 ms 8252 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 431 ms 8324 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 424 ms 8304 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 425 ms 8352 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 427 ms 8284 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 434 ms 8408 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1