# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
497529 | thekcc | XOR (IZhO12_xor) | C++14 | 2100 ms | 1844 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 i=0; i<n; i++){
for(int j=i+1; j<=n; j++){
if(x<=(pre[j]^pre[i])) {
if(j-i>bk){
bi=i; bk=j-i;
}
}
}
}
cout << bi+1 << " " << bk<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |