제출 #900403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
900403		Nelt	XOR (IZhO12_xor)	C++17	100 / 100	965 ms	17908 KiB

xor

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma,popcnt")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID                   \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    ll n, x;
    cin >> n >> x;
    ll a[n + 1];
    a[0] = 0;
    for (ll i = 1; i <= n; i++)
        cin >> a[i], a[i] ^= a[i - 1];
    ll cur = 0;
    pp(ll, ll) best = mpr(0, 0);
    mm(ll, ll) mp;
    for (ll bit = 29; bit >= 0; bit--)
    {
        mp.clear();
        if (!(x >> bit & 1))
        {
            cur ^= (1ll << bit);
            mp[0] = 0;
            for (ll i = 1; i <= n; i++)
            {
                if (mp.count(((a[i] >> bit) ^ (cur >> bit))))
                    best = max(mpr(i - mp[(a[i] >> bit) ^ (cur >> bit)], -i), best);
                if (!mp.count(a[i] >> bit))
                    mp[a[i] >> bit] = i;
            }
            cur ^= (1ll << bit);
        }
        else
            cur |= (1ll << bit);
    }
    mp.clear();
    mp[0] = 0;
    for (ll i = 1; i <= n; i++)
    {
        if (mp.count(a[i] ^ x))
            best = max(best, mpr(i - mp[a[i] ^ x], -i));
        if (!mp.count(a[i]))
            mp[a[i]] = i;
    }
    cout << -best.S - best.F + 1 << " " << best.F << endl;
}
/*

*/
int main()
{
    ANDROID
    // precomp();
    ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

• Subtask 1: 100 / 100