oj.uz

Submission #917959

# Submission time Handle Problem Language Result Execution time Memory
917959 2024-01-29T07:58:04 Z Mher777 XOR (IZhO12_xor) C++17
100 / 100
 76 ms 24756 KB 
#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>
using namespace std;

/* -------------------- 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()

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

const int MAX = int(2e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1e9 + 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) {
    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) {
    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 = 8000005;
int trie[N][2], mn[N];
int n, x, num, id, sz = 1, answ = n;

void add(int cur = 1, int ind = 29) {
    if (ind == -1) return;
    int dir = 0;
    if ((1 << ind) & num) dir = 1;
    if (!trie[cur][dir]) {
        trie[cur][dir] = ++sz;
        mn[trie[cur][dir]] = id;
    }
    add(trie[cur][dir], ind - 1);
}

void find_ans(int cur = 1, int ind = 29) {
    if (ind == -1) {
        answ = min(answ, mn[cur]);
        return;
    }
    int dir = 0, dirx = 0;
    if ((1 << ind) & x) dirx = 1;
    if ((1 << ind) & num) dir = 1;
    if (dirx == 1) {
        if (trie[cur][!dir]) {
            find_ans(trie[cur][!dir], ind - 1);
        }
        else {
            return;
        }
    }
    else {
        if (trie[cur][!dir]) answ = min(answ, mn[trie[cur][!dir]]);
        if (trie[cur][dir]) find_ans(trie[cur][dir], ind - 1);
    }
}

void slv() {
    cin >> n >> x;
    int pref = 0, len = 0, beg = 0;
    add();
    for (int i = 1; i <= n; ++i) {
        cin >> num;
        pref ^= num;
        num = pref;
        answ = n;
        find_ans();
        if (i - answ > len) {
            len = i - answ;
            beg = answ + 1;
        }
        ++id;
        add();
    }
    cout << beg << " " << 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:91:21: warning: unused variable 'cnt' [-Wunused-variable]
   91 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
xor.cpp: In function 'll bin_to_dec(std::string)':
xor.cpp:114:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 4 ms 1032 KB Output is correct
6 Correct 6 ms 3164 KB Output is correct
7 Correct 6 ms 3164 KB Output is correct
8 Correct 6 ms 3164 KB Output is correct
9 Correct 25 ms 11896 KB Output is correct
10 Correct 24 ms 12124 KB Output is correct
11 Correct 23 ms 11992 KB Output is correct
12 Correct 23 ms 12124 KB Output is correct
13 Correct 37 ms 12148 KB Output is correct
14 Correct 25 ms 12120 KB Output is correct
15 Correct 24 ms 12328 KB Output is correct
16 Correct 23 ms 12120 KB Output is correct
17 Correct 71 ms 24756 KB Output is correct
18 Correct 69 ms 24668 KB Output is correct
19 Correct 76 ms 24712 KB Output is correct
20 Correct 64 ms 24660 KB Output is correct