Submission #338348

#	Time	Username	Problem	Language	Result	Execution time	Memory
338348		amunduzbaev	XOR (IZhO12_xor)	C++14	0 / 100	0 ms	364 KiB

xor

/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
const int N = 305;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll n, m, k, ans, in;

void solve(){
	fastios 
	cin>>n>>k;
	vii a(n);
	for(int i=0;i<n;i++) cin>>a[i];
	int l = 0, r = 0, xx = 0;
	while(l<n){
		if(l == r-1) xx ^= a[r], r++;
		while((a[r] ^ xx) >= k && r < n) xx^=a[r], r++;
		if((ll) r-l > ans) ans = (ll)r - l, in = l+1;
		xx ^= a[l];
		l++;
	}
	cout<<in<<" "<<ans<<endl;
	return;
}

int main(){
	fastios
	int t = 1;
	if(t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

• Subtask 1: 0 / 100