제출 #873871

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
873871		noiaint	XOR (IZhO12_xor)	C++17	100 / 100	128 ms	58452 KiB

xor

#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 31; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
// void add(int &a, int b) {
//     a += b;
//     if (a >= mod) a -= mod;
//     if (a < 0) a += mod;
// }

int n, k;
int prexor;
int p, ans;

struct node {
	node *child[2];
	int pos;
	node() {
		child[0] = child[1] = nullptr;
		pos = oo;
	}
} *root = new node();

void add(int x, int pos) {
	node *p = root;
	for (int i = lg; i >= 0; --i) {
		int c = getbit(x, i);
		if (!p->child[c]) p->child[c] = new node();
		p = p->child[c];
		if (p->pos == oo) p->pos = pos;
	}
}
int get(int x) {
	node *p = root;
	int ans = oo;
	for (int i = lg; i >= 0; --i) {
		int c = getbit(x, i);
		int cur = getbit(k, i);
		if (cur == 0) {
			if (p->child[c ^ 1]) mini(ans, p->child[c ^ 1]->pos);
			if (!p->child[c]) return ans;
			p = p->child[c];
		} else {
			if (!p->child[c ^ 1]) return ans;
			p = p->child[c ^ 1];
		}
	}
	mini(ans, p->pos);
	return ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> n >> k;
    add(0, 0);
    for (int i = 1; i <= n; ++i) {
    	int x;
    	cin >> x;
    	prexor ^= x;
    	int j = get(prexor);
    	if (maxi(ans, i - j)) p = j + 1;
    	add(prexor, i);
    }

    cout << p << ' ' << ans;

    return 0;
}

/*

*/

• Subtask 1: 100 / 100