Submission #486756

#	Time	Username	Problem	Language	Result	Execution time	Memory
486756		MilosMilutinovic	XOR (IZhO12_xor)	C++14	0 / 100	1 ms	204 KiB

xor

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

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) (x).begin(),(x).end()
#define inv(n) power((n), mod - 2)
#define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
#define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
#define bff(i,a,b) for (int (i) = (b)-1; (i) >= (a); (i)--)
#define bfff(i,a,b) for (int (i) = (b); (i) >= (a); (i)--)
#define sum_overflow(a,b) __builtin_add_overflow_p ((a), (b), (__typeof__ ((a) + (b))) 0)
#define mul_overflow(a,b) __builtin_mul_overflow_p ((a), (b), (__typeof__ ((a) + (b))) 0)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
const int mod = 998244353;
//const int mod = 1000000007;

using namespace __gnu_pbds;
template <class T> using oset = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
template <class T> using omset = tree<T, null_type,less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;







//Note to self: Check for overflow

//trie gas

int n,a[250005];
li xr[250005];

int main()
{
    FAST;

    int n,x; cin>>n>>x;
    fff(i,1,n) cin>>a[i];
    fff(i,1,n) xr[i]=xr[i-1]^a[i];
    int ans=0,pos=0;
    fff(i,1,n)
    {
        fff(j,i,n)
        {
            if (xr[j]^xr[i-1]>=x)
            {
                int len=j-i+1;
                if (len>ans) ans=len,pos=i;
                else if (len==ans&&i<pos) pos=i;
            }
        }
    }
    cout<<pos<<" "<<ans<<"\n";
}

//Note to self: Check for overflow

Compilation message (stderr)

xor.cpp: In function 'int main()':
xor.cpp:16:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
xor.cpp:56:5: note: in expansion of macro 'fff'
   56 |     fff(i,1,n) cin>>a[i];
      |     ^~~
xor.cpp:16:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
xor.cpp:57:5: note: in expansion of macro 'fff'
   57 |     fff(i,1,n) xr[i]=xr[i-1]^a[i];
      |     ^~~
xor.cpp:16:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
xor.cpp:59:5: note: in expansion of macro 'fff'
   59 |     fff(i,1,n)
      |     ^~~
xor.cpp:16:29: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   16 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
xor.cpp:61:9: note: in expansion of macro 'fff'
   61 |         fff(j,i,n)
      |         ^~~
xor.cpp:63:30: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
   63 |             if (xr[j]^xr[i-1]>=x)
      |                       ~~~~~~~^~~

• Subtask 1: 0 / 100