oj.uz

Submission #525180

# Submission time Handle Problem Language Result Execution time Memory
525180 2022-02-11T02:55:34 Z armashka XOR (IZhO12_xor) C++17
0 / 100
 2000 ms 2632 KB 
#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];
    ll len = -1, pos = -1;
    for (int i = 1; i <= n; ++ i) {
        for (int j = i; j <= n; ++ j) {
            if ((pr[j] ^ pr[i - 1]) >= x && j - i + 1 > len) {
                len = j - i + 1;
                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 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 173 ms 708 KB Output is correct
6 Correct 308 ms 940 KB Output is correct
7 Correct 303 ms 972 KB Output is correct
8 Correct 381 ms 1032 KB Output is correct
9 Execution timed out 2090 ms 2632 KB Time limit exceeded
10 Halted 0 ms 0 KB -