結果

問題 No.1786 Maximum Suffix Median (Online)
ユーザー heno239heno239
提出日時 2021-12-17 09:22:38
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,289 ms / 2,000 ms
コード長 5,433 bytes
コンパイル時間 1,897 ms
コンパイル使用メモリ 147,724 KB
実行使用メモリ 432,596 KB
最終ジャッジ日時 2023-10-12 10:40:02
合計ジャッジ時間 27,087 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
11,524 KB
testcase_01 AC 9 ms
11,356 KB
testcase_02 AC 9 ms
11,548 KB
testcase_03 AC 9 ms
11,652 KB
testcase_04 AC 10 ms
11,768 KB
testcase_05 AC 10 ms
11,892 KB
testcase_06 AC 9 ms
11,716 KB
testcase_07 AC 9 ms
11,464 KB
testcase_08 AC 1,188 ms
390,492 KB
testcase_09 AC 797 ms
284,632 KB
testcase_10 AC 864 ms
308,080 KB
testcase_11 AC 705 ms
258,060 KB
testcase_12 AC 1,198 ms
409,396 KB
testcase_13 AC 772 ms
400,576 KB
testcase_14 AC 595 ms
314,132 KB
testcase_15 AC 664 ms
349,664 KB
testcase_16 AC 685 ms
360,396 KB
testcase_17 AC 582 ms
307,972 KB
testcase_18 AC 1,274 ms
432,024 KB
testcase_19 AC 1,271 ms
432,320 KB
testcase_20 AC 1,264 ms
431,900 KB
testcase_21 AC 1,289 ms
432,156 KB
testcase_22 AC 1,252 ms
432,596 KB
testcase_23 AC 762 ms
358,940 KB
testcase_24 AC 567 ms
270,468 KB
testcase_25 AC 879 ms
410,852 KB
testcase_26 AC 713 ms
359,188 KB
testcase_27 AC 657 ms
331,016 KB
testcase_28 AC 762 ms
381,072 KB
testcase_29 AC 10 ms
11,584 KB
testcase_30 AC 9 ms
11,576 KB
testcase_31 AC 260 ms
32,372 KB
testcase_32 AC 286 ms
32,280 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-4;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };



struct Node {
	Node* ch[2];
	int l, r;
	int val, lazy;
	Node(int _l,int _r) {
		ch[0] = ch[1] = NULL;
		l = _l, r = _r;
		val = 0;
		lazy = -mod;
	}
};
int h(int a, int b) {
	if (a > mod / 2)return a;
	if (b == -mod)return a;
	return a + b;
}
void eval(Node* nd) {
	if (nd->lazy == -mod)return;
	if (nd->lazy>mod/2) {
		nd->val = nd->lazy-mod;
	}
	else {
		nd->val += nd->lazy;
	}
	if (nd->l + 1 < nd->r) {
		if (nd->ch[0] == NULL)nd->ch[0] = new Node(nd->l, (nd->l + nd->r) / 2);
		if (nd->ch[1] == NULL)nd->ch[1] = new Node((nd->l + nd->r) / 2, nd->r);
		rep(j, 2)nd->ch[j]->lazy = h(nd->lazy, nd->ch[j]->lazy);
	}
	nd->lazy = -mod;
}
void add(Node* nd,int val,int a,int b) {
	if (nd->r <= a || b <= nd->l)return;
	eval(nd);
	if (a <= nd->l && nd->r <= b) {
		nd->lazy = h(val, nd->lazy); eval(nd);
	}
	else {
		if (nd->ch[0] == NULL)nd->ch[0] = new Node(nd->l, (nd->l + nd->r) / 2);
		if (nd->ch[1] == NULL)nd->ch[1] = new Node((nd->l + nd->r) / 2, nd->r);
		rep(j, 2)add(nd->ch[j], val, a, b);
		nd->val = min(nd->ch[0]->val, nd->ch[1]->val);
	}
}
int find0(Node* nd) {
	eval(nd);
	if (nd->val > 0)return (1 << 30);
	rep(_, 30) {
		eval(nd->ch[0]);
		eval(nd->ch[1]);
		if (nd->ch[0]->val <= 0)nd = nd->ch[0];
		else nd = nd->ch[1];
	}
	return nd->l;
}
void solve() {
	int n; cin >> n;
	vector<int> b(n);
	rep(i, n)cin >> b[i]; vector<int> a(n);
	Node* nd = new Node(0, (1 << 30));
	a[0] = b[0];
	vector<int> ans(n);
	ans[0] = a[0];
	add(nd, 1, 0, a[0] + 1);
	add(nd, -1, a[0] + 1, (1 << 30));
	for (int i = 1; i < n; i++) {
		a[i] = ans[i - 1] ^ b[i];
		add(nd, 1, 0, a[i] + 1);
		add(nd, -1, a[i] + 1, (1 << 30));
		int loc = find0(nd);
		if (loc <= a[i])add(nd, mod + 1, loc, a[i] + 1);
		ans[i] = max(loc - 1, a[i]);
	}
	rep(i, n)cout << ans[i] << "\n";
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(8);
	//init_f();
	//init();
	//while(true)
	//expr();
	//init();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0