# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338363 | tengiz05 | XOR (IZhO12_xor) | C++17 | 2089 ms | 1644 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.
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
int arr[n+1];
int sum[n+1];
int ans =0;
sum[0] = 0;
for(int i=1;i<=n;i++){
cin >> arr[i];
sum[i]=arr[i]^sum[i-1];
}
int ind=0;
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
if((sum[j]^sum[i-1])>=k && ans < j-i+1){
ans = j-i+1;
ind=i;
}
}
}
cout << ind << ' ' << ans << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |