Submission #891398

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
891398	2023-12-22T21:10:42 Z	Mher777	XOR (IZhO12_xor)	C++17	0 / 100	0 ms	348 KB

xor

/* ----------------------------- Mher777 ----------------------------- */
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <fstream>
#include <cassert>
using namespace std;

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef float fl;
typedef double db;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()

/* -------------------- Constants -------------------- */

const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18 + 5);
const ll MOD = ll(1e14 + 7);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

int isPrime(ll a) {
    if (a == 1) return 0;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return 0;
    }
    return 1;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/*-------------------- Solution -------------------- */

const int N = 250005, M = N * 33;
int a[N], pref[N];
pii trie[M][2];
int timer = 1, index = 1;
bitset<31> bit;

void add(int v = 1, int ind = 30) {
    if (!trie[v][bit[ind]].ff) trie[v][bit[ind]] = { ++timer,index };
    if (ind == 0) return;
    add(trie[v][bit[ind]].ff, ind - 1);
}

int find() {
    int ans = MAX, v = 1;
    for (int i = 30; i >= 0; --i) {
        if (bit[i] == 1) {
            if (!trie[v][bit[i]].ff) break;
            if (i == 0) ans = min(ans, trie[v][bit[i]].ss);
            v = trie[v][bit[i]].ff;
        }
        else {
            if (trie[v][!bit[i]].ff) {
                ans = min(ans, trie[v][!bit[i]].ss);
            }
            if (!trie[v][bit[i]].ff) break;
            if (i == 0) ans = min(ans, trie[v][bit[i]].ss);
            v = trie[v][bit[i]].ff;
        }
    }
    return ans;
}

void slv() {
    int n, k;
    cin >> n >> k;
    bit = 0;
    add();
    int st = MAX, len = -1;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        pref[i] = pref[i - 1] ^ a[i];
        bit = pref[i];
        ++index;
        add();
        bit = k;
        int ansx = find();
        if (ansx == MAX) continue;
        int lenx = i - ansx + 1;
        if (lenx > len) {
            st = ansx;
            len = lenx;
        }
        else if (len == lenx && ansx < st) {
            st = ansx;
        }
    }
    cout << st << " " << len;
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

xor.cpp: In function 'll range_sum(ll, ll)':
xor.cpp:92:21: warning: unused variable 'cnt' [-Wunused-variable]
   92 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
xor.cpp: In function 'll bin_to_dec(std::string)':
xor.cpp:115:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	348 KB	Output isn't correct
2	Halted	0 ms	0 KB	-