# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
508588 | sidon | XOR (IZhO12_xor) | C++17 | 277 ms | 42464 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;
int N, X, pref, ind, k, curr, u, j;
int C[2][1<<22], t[1<<22];
#define minim(l, r) if(l && r-l > k) k = r-l, ind = l
void go(bool c) {
u = C[c][u] ? : C[c][u] = ++curr;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> N >> X;
for(int i = 1; i <= N + 1; i++) {
for(u = 0, j = 1<<30; j/=2; ) {
if(!(X & j))
minim(t[C[!(pref & j)][u]], i);
go((pref & j) ^ (X & j));
}
minim(t[u], i);
for(u = 0, j = 1<<30; j/=2; ) {
go(pref & j);
t[u] = t[u] ? : i;
}
cin >> u;
pref ^= u;
}
if(!X) ind = 1, k = N;
cout << ind << ' ' << k;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |