제출 #1116328

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1116328		Mher777	XOR (IZhO12_xor)	C++17	100 / 100	146 ms	26700 KiB

xor

#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 <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(time(nullptr));

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

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
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()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

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

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
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) {
    if (a == 0 || b == 0) return(max(a, 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) {
    if (a > b) return 0ll;
    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;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

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

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 = 30 * 250000 + 5, M = 250005;
int t[N][2], last[N], a[M], pref[M];
int m = 1, n, x;

void add(int num, int index, int node = 1, int cur_bit = 29) {
    if (cur_bit == -1) {
        last[node] = min(index, last[node]);
        return;
    }
    int direction = 0;
    if ((1 << cur_bit) & num) direction = 1;
    if (!t[node][direction]) {
        t[node][direction] = ++m;
        last[m] = MAX;
    }
    add(num, index, t[node][direction], cur_bit - 1);
    last[node] = min(last[node], last[t[node][direction]]);
}

int find(int num, int node = 1, int cur_bit = 29) {
    if (cur_bit == -1) return last[node];
    if (node == 0) return MAX;
    int bit_x = 0, bit_num = 0;
    if ((1 << cur_bit) & x) {
        bit_x = 1;
    }
    if ((1 << cur_bit) & num) {
        bit_num = 1;
    }
    if (bit_x == 0) {
        return min(last[t[node][bit_num ^ 1]], find(num, t[node][bit_num], cur_bit - 1));
    }
    else {
        return find(num, t[node][bit_num ^ 1], cur_bit - 1);
    }
}

void slv() {
    cin >> n >> x;
    last[0] = last[1] = MAX;
    add(0, 0);
    int ans_ind = 0, ans_len = 0;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        pref[i] = (pref[i - 1] ^ a[i]);
        int ind = find(pref[i]);
        if ((i - ind) > ans_len) {
            ans_len = i - ind;
            ans_ind = ind + 1;
        }
        add(pref[i], i);
    }
    if (x == 0) {
        cout << 1 << " " << n;
        return;
    }
    cout << ans_ind << " " << ans_len;
}

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

void precalc() {
    return;
}

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

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 100 / 100