# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338340 | beksultan04 | XOR (IZhO12_xor) | C++14 | 1 ms | 364 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;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+11,INF=1e9+7;
int n,q[N];
main(){
int i,j,x,k=0,pos=0;
scan2(n,x)
for (i=1;i<=n;++i){
scan1(q[i])
}
for (i=1;i<=n;++i){
int xr=0;
for (j=i;j<=n;++j){
xr ^= q[j];
if (xr > x && j-i+1 > k){
k = j-i+1;
pos=i;
}
}
}
cout <<pos<<" "<<k;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |