oj.uz

답안 #900403

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
900403 2024-01-08T08:48:01 Z Nelt XOR (IZhO12_xor) C++17
100 / 100
 965 ms 17908 KB 
#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.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 7 ms 1464 KB Output is correct
6 Correct 16 ms 1884 KB Output is correct
7 Correct 9 ms 1856 KB Output is correct
8 Correct 10 ms 1884 KB Output is correct
9 Correct 170 ms 7404 KB Output is correct
10 Correct 174 ms 7444 KB Output is correct
11 Correct 149 ms 7384 KB Output is correct
12 Correct 142 ms 7400 KB Output is correct
13 Correct 122 ms 7432 KB Output is correct
14 Correct 171 ms 7252 KB Output is correct
15 Correct 242 ms 7412 KB Output is correct
16 Correct 112 ms 7252 KB Output is correct
17 Correct 806 ms 17908 KB Output is correct
18 Correct 682 ms 17756 KB Output is correct
19 Correct 965 ms 17836 KB Output is correct
20 Correct 529 ms 17852 KB Output is correct