Submission #497539

#TimeUsernameProblemLanguageResultExecution timeMemory
497539thekccXOR (IZhO12_xor)C++14
0 / 100
2076 ms1100 KiB
#include <bits/stdc++.h>
using namespace std;

const int N = 500001;

int pre[N],a[N];
int bi,bk,n,x;

int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> n;
	cin >> x;
	pre[0]=0;
	for(int i=1; i<=n; i++){
        cin >> a[i];
        pre[i]=pre[i-1]^a[i];
	}
	bi=-1;
	bk=-1;
    for(int k=n; k>=1; k--){
        for(int i=0; i<=n-k; i++){
            if(x<=(pre[k+i]^pre[i])) {
                bi=i; bk=k;
                break;
            }
        }
        if(bi!=-1) break;
	}
	cout << bi+1 << " " << bk<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...