# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
651903 | ak2006 | XOR (IZhO12_xor) | C++17 | 2089 ms | 1860 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;
using vi = vector<int>;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,x;
cin>>n>>x;
vi a(n + 1),p(n + 1);
for (int i = 1;i<=n;i++)cin>>a[i],p[i] = p[i - 1] ^ a[i];
int ans = 0,ansi = n;
for (int i = 0;i<=n - 1;i++){
for (int k = 0;k<=n - i;k++){
if ((p[i + k] ^ p[i]) >= x){
if (k > ans){
ans = k;
ansi = i;
}
else if (k == ans)
ansi = min(ansi,i);
}
}
}
cout<<ansi + 1<<" "<<ans<<"\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |