Submission #1153761

#	Time	Username	Problem	Language	Result	Execution time	Memory
1153761		KluydQ	XOR (IZhO12_xor)	C++20	0 / 100	5 ms	840 KiB

xor

#include <bits/stdc++.h>
//#include "grader.h"
 
#define respagold ios_base::sync_with_stdio(0), cin.tie(0);
//#define int long long
#define ll long long
#define int2 __int128_t
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
#define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d )
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x.size())
#define pb push_back
#define ins insert
#define lb lower_bound
#define ub upper_bound
#define pii pair <int, int>
#define mkp make_pair
 
using namespace std;
 
const int N = 3e5 + 123;
const int inf = 1e9;
const int mod = 1e9 + 7;
 
int a[N], b[N], c[N], n, m, k, z, w, x, y;

mt19937 rng( chrono::steady_clock::now().time_since_epoch().count());
 
int rand( int l, int r )
{
    uniform_int_distribution <int> uid( l, r );
    return uid( rng );
}
int t[31 * N], son[31 * N][2], timer = 1;

void add( int x, int id )
{
	int v = 1;
	t[v] = max( t[v], id ); 
	
	FORR( i, 30, 0, 1 )
	{
		int bit = (x >> i) & 1;
		
		if( !son[v][bit] ) son[v][bit] = ++ timer;
		v = son[v][bit];
		t[v] = max( t[v], id );
	}
}
int get( int x )
{
	int res = 0, v = 1;
	
	FORR( i, 30, 0, 1 )
	{
		int bx = (x >> i) & 1, bw = (w >> i) & 1;
		
		if( bx )
		{
			if( !bw ) res = max( res, t[son[v][0]] ), v = son[v][1];
			else v = son[v][0];
		}
		else
		{
			if( !bw ) res = max( res, t[son[v][1]] ), v = son[v][0];
			else v = son[v][1];
		}
	}
	return max( res, t[v] );
}
void solve()
{
	cin >> n >> w;
	k = 0, z = 0;
	
	FOR( i, 1, n, 1 ) cin >> a[i];
	
	add( 0, n + 1 );
	
	FORR( i, n, 1, 1 )
	{
		x ^= a[i];
		int j = get(x);
		
		if( j && k < j - i ) k = j - i, z = i;
		add( x, i );
	}
	cout << z << ' ' << k << '\n';
}
signed main() 
{
//	freopen("connect.in", "r", stdin);
//	freopen("connect.out", "w", stdout);
	    
    respagold
    
    int test = 1;
    
    if( !test ) cin >> test;
	
	while( test -- )
	{
		solve();
	}
}
// solved by KluydQ

• Subtask 1: 0 / 100