제출 #1352762

#제출 시각아이디문제언어결과실행 시간메모리
1352762vjudge1XOR (IZhO12_xor)C++20
0 / 100
258 ms704 KiB
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int n, ans, id, a[35005],x, px[35004];
int main() 
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n>>x;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        px[i]=px[i-1]^a[i];
    }
    for(int r=1;r<=n;r++)
        for(int l=1;l<=r;l++){
            if(r-l+1<ans) break;
            int val=px[r]^px[l-1];
            if(val<x) continue;
            if(ans<r-l+1){
                ans=r-l+1;
                id=l;
            } else if (ans==r-l+1) id=min(id, l);
        }
    cout<<id<<' '<<ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...