| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 571476 |
2022-06-02T09:52:21 Z |
vbee |
XOR (IZhO12_xor) |
C++14 |
|
0 ms |
212 KB |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define fi first
#define se second
#define TASK "c"
#define ll long long
#define pll pair<ll, ll>
#define vll vector<ll>
#define vpll vector<pll>
#define pb push_back
#define MASK(i) (1 << (i))
#define BIT(x, i) ((x >> (i)) & 1)
using namespace std;
const int oo = 1e9 + 7;
const ll loo = (ll)1e18 + 7;
const int N = 3e5 + 7;
int n, x, a[N], prexor[N], preans[N];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen(TASK".inp", "r", stdin);
// freopen(TASK".out", "w", stdout);
cin >> n >> x;
for (int i = 1; i <= n; i++){
cin >> a[i];
prexor[i] = prexor[i - 1] ^ a[i];
}
for (int i = 0; i <= n; i++) preans[i] = prexor[i] ^ x;
for (int k = n; k >= 1; k--){
for (int i = 1; i <= n - k + 1; i++){
if ((prexor[i + k - 1] - preans[i - 1]) >= 0) {
return cout << i << " " << k, 0;
}
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
