제출 #1126823

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1126823		thieunguyenhuy	비밀 (JOI14_secret)	C++20	100 / 100	372 ms	4388 KiB

secret

#ifndef hwe
	#include "secret.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T1, class T2> T1 random(T1 l, T2 r) {
    return uniform_int_distribution<T1>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e3 + 5, LG = 11;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

int n;
int a[N], dat[LG][N];

#ifdef hwe
int Secret(int x, int y) {
	return max(x, y);
}
#endif

void dnc(int l, int r, int depth) {
	// cerr << l << ' ' << r << '\n';
	if (l == r) return;

	int mid = (l + r) >> 1;
	dat[depth][mid] = a[mid], dat[depth][mid + 1] = a[mid + 1];

	for (int i = mid - 1; i >= l; --i)
		dat[depth][i] = Secret(a[i], dat[depth][i + 1]);
	for (int i = mid + 2; i <= r; ++i)
		dat[depth][i] = Secret(dat[depth][i - 1], a[i]);

	dnc(l, mid, depth + 1), dnc(mid + 1, r, depth + 1);
}

void Init(int _n, int A[]) {
	n = _n; for (int i = 0; i < n; ++i) a[i] = A[i];
	dnc(0, n - 1, 0);
}

int Query(int l, int r) {
	if (l == r) return a[l];
	int L = 0, R = n - 1, depth = 0;
	while (true) {
		int mid = (L + R) >> 1;
		if (l <= mid && r > mid) break;
		if (r <= mid) R = mid, ++depth;
		else L = mid + 1, ++depth;
	}
	return Secret(dat[depth][l], dat[depth][r]);
}

#ifdef hwe
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    int n; cin >> n;
    vector<int> A(n);
    for (auto &x : A) cin >> x;

    Init(n, A);

	for (int i = 1; i <= 1; ++i) {
		int l, r; cin >> l >> r;
		cout << Query(l, r) << '\n';
	}

    cerr << '\n'; return 0;
}
#endif

• Subtask 1: 100 / 100