結果
問題 | No.1786 Maximum Suffix Median (Online) |
ユーザー |
|
提出日時 | 2021-12-15 01:47:16 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,429 ms / 2,000 ms |
コード長 | 15,930 bytes |
コンパイル時間 | 3,455 ms |
コンパイル使用メモリ | 267,972 KB |
最終ジャッジ日時 | 2025-01-26 22:50:09 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
/*** date : 2021-12-15 01:47:11*/#define NDEBUGusing namespace std;// intrinstic#include <immintrin.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cctype>#include <cfenv>#include <cfloat>#include <chrono>#include <cinttypes>#include <climits>#include <cmath>#include <complex>#include <cstdarg>#include <cstddef>#include <cstdint>#include <cstdio>#include <cstdlib>#include <cstring>#include <deque>#include <fstream>#include <functional>#include <initializer_list>#include <iomanip>#include <ios>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <streambuf>#include <string>#include <tuple>#include <type_traits>#include <typeinfo>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>// utilitynamespace Nyaan {using ll = long long;using i64 = long long;using u64 = unsigned long long;using i128 = __int128_t;using u128 = __uint128_t;template <typename T>using V = vector<T>;template <typename T>using VV = vector<vector<T>>;using vi = vector<int>;using vl = vector<long long>;using vd = V<double>;using vs = V<string>;using vvi = vector<vector<int>>;using vvl = vector<vector<long long>>;template <typename T, typename U>struct P : pair<T, U> {template <typename... Args>P(Args... args) : pair<T, U>(args...) {}using pair<T, U>::first;using pair<T, U>::second;T &x() { return first; }const T &x() const { return first; }U &y() { return second; }const U &y() const { return second; }P &operator+=(const P &r) {first += r.first;second += r.second;return *this;}P &operator-=(const P &r) {first -= r.first;second -= r.second;return *this;}P &operator*=(const P &r) {first *= r.first;second *= r.second;return *this;}P operator+(const P &r) const { return P(*this) += r; }P operator-(const P &r) const { return P(*this) -= r; }P operator*(const P &r) const { return P(*this) *= r; }P operator*(int r) const { return {first * r, second * r}; }P operator-() const { return P{-first, -second}; }};using pl = P<ll, ll>;using pi = P<int, int>;using vp = V<pl>;constexpr int inf = 1001001001;constexpr long long infLL = 4004004004004004004LL;template <typename T>int sz(const T &t) {return t.size();}template <typename T, typename U>inline bool amin(T &x, U y) {return (y < x) ? (x = y, true) : false;}template <typename T, typename U>inline bool amax(T &x, U y) {return (x < y) ? (x = y, true) : false;}template <typename T>inline T Max(const vector<T> &v) {return *max_element(begin(v), end(v));}template <typename T>inline T Min(const vector<T> &v) {return *min_element(begin(v), end(v));}template <typename T>inline long long Sum(const vector<T> &v) {return accumulate(begin(v), end(v), 0LL);}template <typename T>int lb(const vector<T> &v, const T &a) {return lower_bound(begin(v), end(v), a) - begin(v);}template <typename T>int ub(const vector<T> &v, const T &a) {return upper_bound(begin(v), end(v), a) - begin(v);}constexpr long long TEN(int n) {long long ret = 1, x = 10;for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);return ret;}template <typename T, typename U>pair<T, U> mkp(const T &t, const U &u) {return make_pair(t, u);}template <typename T>vector<T> mkrui(const vector<T> &v, bool rev = false) {vector<T> ret(v.size() + 1);if (rev) {for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];} else {for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];}return ret;};template <typename T>vector<T> mkuni(const vector<T> &v) {vector<T> ret(v);sort(ret.begin(), ret.end());ret.erase(unique(ret.begin(), ret.end()), ret.end());return ret;}template <typename F>vector<int> mkord(int N, F f) {vector<int> ord(N);iota(begin(ord), end(ord), 0);sort(begin(ord), end(ord), f);return ord;}template <typename T>vector<int> mkinv(vector<T> &v) {int max_val = *max_element(begin(v), end(v));vector<int> inv(max_val + 1, -1);for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;return inv;}} // namespace Nyaan// bit operationnamespace Nyaan {__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {return _mm_popcnt_u64(a);}inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }template <typename T>inline int gbit(const T &a, int i) {return (a >> i) & 1;}template <typename T>inline void sbit(T &a, int i, bool b) {if (gbit(a, i) != b) a ^= T(1) << i;}constexpr long long PW(int n) { return 1LL << n; }constexpr long long MSK(int n) { return (1LL << n) - 1; }} // namespace Nyaan// inoutnamespace Nyaan {template <typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << p.first << " " << p.second;return os;}template <typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p) {is >> p.first >> p.second;return is;}template <typename T>ostream &operator<<(ostream &os, const vector<T> &v) {int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v) is >> x;return is;}void in() {}template <typename T, class... U>void in(T &t, U &... u) {cin >> t;in(u...);}void out() { cout << "\n"; }template <typename T, class... U, char sep = ' '>void out(const T &t, const U &... u) {cout << t;if (sizeof...(u)) cout << sep;out(u...);}void outr() {}template <typename T, class... U, char sep = ' '>void outr(const T &t, const U &... u) {cout << t;outr(u...);}struct IoSetupNya {IoSetupNya() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);cerr << fixed << setprecision(7);}} iosetupnya;} // namespace Nyaan// debugnamespace DebugImpl {template <typename U, typename = void>struct is_specialize : false_type {};template <typename U>struct is_specialize<U, typename conditional<false, typename U::iterator, void>::type>: true_type {};template <typename U>struct is_specialize<U, typename conditional<false, decltype(U::first), void>::type>: true_type {};template <typename U>struct is_specialize<U, enable_if_t<is_integral<U>::value, void>> : true_type {};void dump(const char& t) { cerr << t; }void dump(const string& t) { cerr << t; }void dump(const bool& t) { cerr << (t ? "true" : "false"); }template <typename U,enable_if_t<!is_specialize<U>::value, nullptr_t> = nullptr>void dump(const U& t) {cerr << t;}template <typename T>void dump(const T& t, enable_if_t<is_integral<T>::value>* = nullptr) {string res;if (t == Nyaan::inf) res = "inf";if constexpr (is_signed<T>::value) {if (t == -Nyaan::inf) res = "-inf";}if constexpr (sizeof(T) == 8) {if (t == Nyaan::infLL) res = "inf";if constexpr (is_signed<T>::value) {if (t == -Nyaan::infLL) res = "-inf";}}if (res.empty()) res = to_string(t);cerr << res;}template <typename T, typename U>void dump(const pair<T, U>&);template <typename T>void dump(const pair<T*, int>&);template <typename T>void dump(const T& t,enable_if_t<!is_void<typename T::iterator>::value>* = nullptr) {cerr << "[ ";for (auto it = t.begin(); it != t.end();) {dump(*it);cerr << (++it == t.end() ? "" : ", ");}cerr << " ]";}template <typename T, typename U>void dump(const pair<T, U>& t) {cerr << "( ";dump(t.first);cerr << ", ";dump(t.second);cerr << " )";}template <typename T>void dump(const pair<T*, int>& t) {cerr << "[ ";for (int i = 0; i < t.second; i++) {dump(t.first[i]);cerr << (i == t.second - 1 ? "" : ", ");}cerr << " ]";}void trace() { cerr << endl; }template <typename Head, typename... Tail>void trace(Head&& head, Tail&&... tail) {cerr << " ";dump(head);if (sizeof...(tail) != 0) cerr << ",";trace(forward<Tail>(tail)...);}} // namespace DebugImpl#ifdef NyaanDebug#define trc(...) \do { \cerr << "## " << #__VA_ARGS__ << " = "; \DebugImpl::trace(__VA_ARGS__); \} while (0)#else#define trc(...) (void(0))#endif// macro#define each(x, v) for (auto&& x : v)#define each2(x, y, v) for (auto&& [x, y] : v)#define all(v) (v).begin(), (v).end()#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)#define reg(i, a, b) for (long long i = (a); i < (b); i++)#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)#define fi first#define se second#define ini(...) \int __VA_ARGS__; \in(__VA_ARGS__)#define inl(...) \long long __VA_ARGS__; \in(__VA_ARGS__)#define ins(...) \string __VA_ARGS__; \in(__VA_ARGS__)#define in2(s, t) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i]); \}#define in3(s, t, u) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i], u[i]); \}#define in4(s, t, u, v) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i], u[i], v[i]); \}#define die(...) \do { \Nyaan::out(__VA_ARGS__); \return; \} while (0)namespace Nyaan {void solve();}int main() { Nyaan::solve(); }//#define protected publictemplate <typename Node>struct RBSTBase {using Ptr = Node *;template <typename... Args>inline Ptr my_new(Args... args) {return new Node(args...);}inline void my_del(Ptr t) { delete t; }inline Ptr make_tree() const { return nullptr; }// for avoiding memory leak, activate below/*using Ptr = shared_ptr<Node>;template <typename... Args>inline Ptr my_new(Args... args) {return make_shared<Node>(args...);}inline void my_del(Ptr t) {}Ptr make_tree() {return Ptr();}*/int size(Ptr t) const { return count(t); }Ptr merge(Ptr l, Ptr r) {if (!l || !r) return l ? l : r;if (int((rng() * (l->cnt + r->cnt)) >> 32) < l->cnt) {push(l);l->r = merge(l->r, r);return update(l);} else {push(r);r->l = merge(l, r->l);return update(r);}}pair<Ptr, Ptr> split(Ptr t, int k) {if (!t) return {nullptr, nullptr};push(t);if (k <= count(t->l)) {auto s = split(t->l, k);t->l = s.second;return {s.first, update(t)};} else {auto s = split(t->r, k - count(t->l) - 1);t->r = s.first;return {update(t), s.second};}}Ptr build(int l, int r, const vector<decltype(Node::key)> &v) {if (l + 1 == r) return my_new(v[l]);int m = (l + r) >> 1;Ptr pm = my_new(v[m]);if (l < m) pm->l = build(l, m, v);if (m + 1 < r) pm->r = build(m + 1, r, v);return update(pm);}Ptr build(const vector<decltype(Node::key)> &v) {return build(0, (int)v.size(), v);}template <typename... Args>void insert(Ptr &t, int k, const Args &... args) {auto x = split(t, k);t = merge(merge(x.first, my_new(args...)), x.second);}void erase(Ptr &t, int k) {auto x = split(t, k);auto y = split(x.second, 1);my_del(y.first);t = merge(x.first, y.second);}protected:static uint64_t rng() {static uint64_t x_ = 88172645463325252ULL;return x_ ^= x_ << 7, x_ ^= x_ >> 9, x_ & 0xFFFFFFFFull;}inline int count(const Ptr t) const { return t ? t->cnt : 0; }virtual void push(Ptr) = 0;virtual Ptr update(Ptr) = 0;};/*** @brief 乱択平衡二分木(基底クラス)*/template <typename T, typename E>struct LazyReversibleRBSTNode {typename RBSTBase<LazyReversibleRBSTNode>::Ptr l, r;T key, sum;E lazy;int cnt;bool rev;LazyReversibleRBSTNode(const T &t = T(), const E &e = E()): l(), r(), key(t), sum(t), lazy(e), cnt(1), rev(false) {}};template <typename T, typename E, T (*f)(T, T), T (*g)(T, E), E (*h)(E, E),T (*ts)(T)>struct LazyReversibleRBST : RBSTBase<LazyReversibleRBSTNode<T, E>> {using Node = LazyReversibleRBSTNode<T, E>;using base = RBSTBase<LazyReversibleRBSTNode<T, E>>;using base::merge;using base::split;using typename base::Ptr;LazyReversibleRBST() = default;void toggle(Ptr t) {swap(t->l, t->r);t->sum = ts(t->sum);t->rev ^= true;}T fold(Ptr &t, int a, int b) {auto x = split(t, a);auto y = split(x.second, b - a);auto ret = sum(y.first);t = merge(x.first, merge(y.first, y.second));return ret;}void reverse(Ptr &t, int a, int b) {auto x = split(t, a);auto y = split(x.second, b - a);toggle(y.first);t = merge(x.first, merge(y.first, y.second));}void apply(Ptr &t, int a, int b, const E &e) {auto x = split(t, a);auto y = split(x.second, b - a);propagate(y.first, e);t = merge(x.first, merge(y.first, y.second));}protected:inline T sum(const Ptr t) const { return t ? t->sum : T(); }Ptr update(Ptr t) override {push(t);t->cnt = 1;t->sum = t->key;if (t->l) t->cnt += t->l->cnt, t->sum = f(t->l->sum, t->sum);if (t->r) t->cnt += t->r->cnt, t->sum = f(t->sum, t->r->sum);return t;}void push(Ptr t) override {if (t->rev) {if (t->l) toggle(t->l);if (t->r) toggle(t->r);t->rev = false;}if (t->lazy != E()) {if (t->l) propagate(t->l, t->lazy);if (t->r) propagate(t->r, t->lazy);t->lazy = E();}}void propagate(Ptr t, const E &x) {t->lazy = h(t->lazy, x);t->key = g(t->key, x);t->sum = g(t->sum, x);}};/*** @brief 遅延伝搬反転可能乱択平衡二分木* @docs docs/rbst/lazy-reversible-rbst.md*/using namespace Nyaan;namespace HELP {pi f(pi a, pi b) { return max(a, b); }pi g(pi a, int b) { return pi{a.fi + b, a.se}; }int h(int a, int b) { return a + b; }pi ts(pi a) { return a; }using BBST = LazyReversibleRBST<pi, int, f, g, h, ts>;} // namespace HELPvoid Nyaan::solve() {inl(N);int pre = 0;HELP::BBST tree;typename HELP::BBST::Node* root = tree.build(V<pi>{{-inf, inf * 2}});rep(i, N) {inl(A);A ^= pre;auto lwb = [&](auto rc, decltype(root) r, int x) -> int {if (r->key.second >= x) {return r->l ? rc(rc, r->l, x) : 0;}int res = (r->l ? r->l->cnt : 0) + 1;return res + (r->r ? rc(rc, r->r, x) : 0);};int u = lwb(lwb, root, A);trc(i, u);int mn = u == i ? -inf : tree.fold(root, u, i).first;int sc = max(0, mn + 1);if (0 != u) tree.apply(root, 0, u, 1);if (u != i) tree.apply(root, u, i, -1);tree.insert(root, u, pi{sc, A});int ans = A;auto dfs = [&](auto rc, decltype(root) r) -> void {tree.push(r);if (r->key.first >= 0) amax(ans, r->key.second);if (r->r and r->r->sum.first >= 0) {rc(rc, r->r);} else {if (r->l and r->l->sum.first >= 0) {rc(rc, r->l);}}};dfs(dfs, root);out(ans);pre = ans;}}