# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
755510 | 2023-06-10T08:04:38 Z | Desh03 | XOR (IZhO12_xor) | C++17 | 2000 ms | 1868 KB |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, x, k = -1, id; cin >> n >> x; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; vector<int> pre(n + 1); for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] ^ a[i - 1]; for (int i = 0; i < n; i++) for (int j = i + 1; j <= n; j++) if ((pre[j] ^ pre[i]) >= x && j - i > k) k = j - i, id = i + 1; cout << id << ' ' << k; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 181 ms | 604 KB | Output is correct |
6 | Correct | 299 ms | 648 KB | Output is correct |
7 | Correct | 305 ms | 596 KB | Output is correct |
8 | Correct | 412 ms | 780 KB | Output is correct |
9 | Execution timed out | 2057 ms | 1868 KB | Time limit exceeded |
10 | Halted | 0 ms | 0 KB | - |