oj.uz

Submission #874590

# Submission time Handle Problem Language Result Execution time Memory
874590 2023-11-17T10:57:11 Z sleepntsheep XOR (IZhO12_xor) C++17
0 / 100
 9 ms 3164 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, zz;
int a[N+1];
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 (y <= 0) return A[v];
    if (!v) return -1;
    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 = max(z, query(C[v][b^1], x, y - (1 << j), j-1));
        }
    }
    return z;
}

signed main(void)
{
    scanf("%lld%lld", &n, &x);
    for (int i = 1; i <= n; ++i) scanf("%lld", a+i), insert(1, a[i] ^= a[i-1], 31, i);
    for (int b, i = 0; i < n; ++i) if ((b = query(1, a[i], x, 31) - i) > z)
        z = b, zz = i + 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:52:39: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |     for (int i = 1; i <= n; ++i) scanf("%lld", a+i), insert(1, a[i] ^= a[i-1], 31, i);
      |                                  ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2484 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Incorrect 9 ms 3164 KB Output isn't correct
6 Halted 0 ms 0 KB -