結果

問題 No.3134 二分探索木
コンテスト
ユーザー cho435
提出日時 2025-05-02 22:35:45
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 258 ms / 2,000 ms
コード長 4,991 bytes
コンパイル時間 2,413 ms
コンパイル使用メモリ 211,452 KB
実行使用メモリ 19,044 KB
最終ジャッジ日時 2025-05-02 22:35:52
合計ジャッジ時間 6,367 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <typename T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <typename T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct IOST {
	IOST() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(20);
	}
} IOST;

struct SuccinctIndexableDictionary {
	size_t length;
	size_t blocks;
	vector<unsigned> bit, sum;

	SuccinctIndexableDictionary() = default;

	SuccinctIndexableDictionary(size_t length)
		: length(length), blocks((length + 31) >> 5) {
		bit.assign(blocks, 0U);
		sum.assign(blocks, 0U);
	}

	void set(int k) {
		bit[k >> 5] |= 1U << (k & 31);
	}

	void build() {
		sum[0] = 0U;
		for (int i = 1; i < blocks; i++) {
			sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);
		}
	}

	bool operator[](int k) {
		return (bool((bit[k >> 5] >> (k & 31)) & 1));
	}

	int rank(int k) {
		return (sum[k >> 5] +
				__builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1)));
	}

	int rank(bool val, int k) {
		return (val ? rank(k) : k - rank(k));
	}
};

template <typename T, int MAXLOG>
struct WaveletMatrix {
	size_t length;
	SuccinctIndexableDictionary matrix[MAXLOG];
	int mid[MAXLOG];

	WaveletMatrix() = default;

	WaveletMatrix(vector<T> v) : length(v.size()) {
		vector<T> l(length), r(length);
		for (int level = MAXLOG - 1; level >= 0; level--) {
			matrix[level] = SuccinctIndexableDictionary(length + 1);
			int left = 0, right = 0;
			for (int i = 0; i < length; i++) {
				if (((v[i] >> level) & 1)) {
					matrix[level].set(i);
					r[right++] = v[i];
				} else {
					l[left++] = v[i];
				}
			}
			mid[level] = left;
			matrix[level].build();
			v.swap(l);
			for (int i = 0; i < right; i++) {
				v[left + i] = r[i];
			}
		}
	}

	pair<int, int> succ(bool f, int l, int r, int level) {
		return {matrix[level].rank(f, l) + mid[level] * f,
				matrix[level].rank(f, r) + mid[level] * f};
	}

	// v[k]
	T access(int k) {
		T ret = 0;
		for (int level = MAXLOG - 1; level >= 0; level--) {
			bool f = matrix[level][k];
			if (f) ret |= T(1) << level;
			k = matrix[level].rank(f, k) + mid[level] * f;
		}
		return ret;
	}

	T operator[](const int& k) {
		return access(k);
	}

	// count i s.t. (0 <= i < r) && v[i] == x
	int rank(const T& x, int r) {
		int l = 0;
		for (int level = MAXLOG - 1; level >= 0; level--) {
			tie(l, r) = succ((x >> level) & 1, l, r, level);
		}
		return r - l;
	}

	// k-th(0-indexed) smallest number in v[l,r)
	T kth_smallest(int l, int r, int k) {
		assert(0 <= k && k < r - l);
		T ret = 0;
		for (int level = MAXLOG - 1; level >= 0; level--) {
			int cnt =
				matrix[level].rank(false, r) - matrix[level].rank(false, l);
			bool f = cnt <= k;
			if (f) {
				ret |= T(1) << level;
				k -= cnt;
			}
			tie(l, r) = succ(f, l, r, level);
		}
		return ret;
	}

	// k-th(0-indexed) largest number in v[l,r)
	T kth_largest(int l, int r, int k) {
		return kth_smallest(l, r, r - l - k - 1);
	}

	// count i s.t. (l <= i < r) && (v[i] < upper)
	int range_freq(int l, int r, T upper) {
		int ret = 0;
		for (int level = MAXLOG - 1; level >= 0; level--) {
			bool f = ((upper >> level) & 1);
			if (f)
				ret +=
					matrix[level].rank(false, r) - matrix[level].rank(false, l);
			tie(l, r) = succ(f, l, r, level);
		}
		return ret;
	}

	// count i s.t. (l <= i < r) && (lower <= v[i] < upper)
	int range_freq(int l, int r, T lower, T upper) {
		return range_freq(l, r, upper) - range_freq(l, r, lower);
	}

	// max v[i] s.t. (l <= i < r) && (v[i] < upper)
	T prev_value(int l, int r, T upper) {
		int cnt = range_freq(l, r, upper);
		return cnt == 0 ? T(-1) : kth_smallest(l, r, cnt - 1);
	}

	// min v[i] s.t. (l <= i < r) && (lower <= v[i])
	T next_value(int l, int r, T lower) {
		int cnt = range_freq(l, r, lower);
		return cnt == r - l ? T(-1) : kth_smallest(l, r, cnt);
	}
};

void solve() {
	int n;
	cin >> n;
	vector<int> a(n);
	rep(i, 0, n) cin >> a[i];
	WaveletMatrix<int, 18> wm(a);
	vector<pair<int, int>> vp(n, {-1, -1});
	vector<pair<int, int>> lr(n, {0, 2e5 + 10});
	set<pair<int, int>> st;
	st.insert({a[0], 0});
	vector<int> b(n, 0);
	vector<int> c(n);
	c[0] = n;
	rep(i, 1, n) {
		auto itr = st.lower_bound({a[i], -1});
		if (itr != st.end() && vp[itr->second].first == -1) {
			vp[itr->second].first = 1;
			b[i] = b[itr->second] + 1;
			lr[i] = {lr[itr->second].first, itr->first};
		} else {
			assert(itr != st.begin());
			itr--;
			assert(vp[itr->second].second == -1);
			vp[itr->second].second = 1;
			b[i] = b[itr->second] + 1;
			lr[i] = {itr->first, lr[itr->second].second};
		}
		c[i] = wm.range_freq(i, n, lr[i].first, lr[i].second);
		st.insert({a[i], i});
	}
	rep(i, 0, n) cout << b[i] << " ";
	cout << "\n";
	rep(i, 0, n) cout << c[i] - 1 << " ";
	cout << "\n";
}

int main() {
	int t = 1;
	// cin >> t;
	rep(i, 0, t) solve();
}
0