Submission #525176

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
525176	2022-02-11T02:50:34 Z	armashka	XOR (IZhO12_xor)	C++17	0 / 100	1 ms	324 KB

xor

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
    
const int N = 1e6 + 10;
const int M = 1e3 + 5;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double Pi = acos(-1); 

ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }                                   
bool even(ll n) { return (n % 2 == 0); }

ll n, x, a[N], pr[N], sf[N];

const void solve(/*Armashka*/) {
    cin >> n >> x;
    for (int i = 1; i <= n; ++ i) cin >> a[i];
    for (int i = 1; i <= n; ++ i) pr[i] = pr[i - 1] ^ a[i];
    // cout << "\n";
    for (int i = n; i >= 1; -- i) sf[i] = max(sf[i + 1], pr[i]);
    ll len = 0, pos = 0;
    for (int i = 1; i <= n; ++ i) {
        int l = i, r = n, j = -1;
        while (l <= r) {
            int mid = (l + r) / 2; 
            if (sf[mid] >= (x ^ pr[i - 1])) l = mid + 1, j = mid;
            else r = mid - 1;   
        }
        if (j == -1) continue;
        int res = (j - i + 1);
        if (res > len) {
            len = res;
            pos = i;
        }
    }
    cout << pos << " " << len << "\n";
}
 
signed main() {
    srand(time(NULL));
    fast;
    // file("");
    int tt = 1;
    // cin >> tt;
    while (tt --) {                                                             
        solve();
    }                            
}
// Uaqyt, otedi, ketedi, mulde bilinbei, ulger
// Kunder seni kutpeidi, susyz ospeidi gulder

Compilation message

xor.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1

0 / 100.0

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