| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 874603 |
2023-11-17T11:19:13 Z |
sleepntsheep |
XOR (IZhO12_xor) |
C++17 |
|
0 ms |
2392 KB |
#include <assert.h>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#define int long long
#define N 250000
#define M 9000000
int n, x, z = -1, zz;
int a[N+2];
int A[M], C[M][2], alloc = 1;
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
void insert(int v, int x, int j, int i)
{
int b = (x >> j) & 1;
A[v] = max(A[v], i);
if (j)
{
if (!C[v][b]) C[v][b] = ++alloc;
insert(C[v][b], x, j-1, i);
A[v] = max(A[v], A[C[v][b]]);
}
}
int query(int v, int x, long long y, int j)
{
if (!v) return -1;
if (y <= 0) return A[v];
int b = (x >> j) & 1, z = -1;
if (j)
{
if ((1u << j) >= y)
{
z = max(A[C[v][b^1]], query(C[v][b], x, y, j-1));
}
else
{
z = query(C[v][b^1], x, y - (1ll << j), j-1);
}
}
return z;
}
signed main(void)
{
scanf("%lld%lld", &n, &x);
for (int i = n; i >= 1; --i)
{
scanf("%lld", a+i);
a[i] ^= a[i+1];
int b = query(1, a[i], x, 31) - i;
if (b >= z) z = b, zz = i + 1;
insert(1, a[i], 31, i);
}
int b = query(1, 0, x, 31);
if (b >= z) z = b, zz = 1;
assert(z != -1);
printf("%lld %lld", zz, z);
return 0;
}
Compilation message
xor.cpp: In function 'int main()':
xor.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
51 | scanf("%lld%lld", &n, &x);
| ~~~~~^~~~~~~~~~~~~~~~~~~~
xor.cpp:54:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
54 | scanf("%lld", a+i);
| ~~~~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
