Submission #13326

#TimeUsernameProblemLanguageResultExecution timeMemory
13326dohyun0324XOR (IZhO12_xor)C++98
85 / 100
2000 ms100420 KiB
#include<stdio.h> #include<map> #include<string.h> using namespace std; map<int,int>ch; int ans,p,len,n,x,a[250010],b[250010],sum[250010],dap[250010],t; int main() { int i,j; scanf("%d %d",&n,&x); for(i=1;i<=n;i++) scanf("%d",&a[i]); for(i=30;i>=0;i--){ if(x&(1<<i)){ t+=(1<<i); for(j=1;j<=n;j++){ if((1<<i)&a[j]) b[j]+=(1<<i); sum[j]=sum[j-1]^b[j]; } } else{ t+=(1<<i); for(j=1;j<=n;j++){ if((1<<i)&a[j]) b[j]+=(1<<i); sum[j]=sum[j-1]^b[j]; ch[sum[j]]=j; } for(j=1;j<=n;j++) dap[j]=max(dap[j],ch[sum[j-1]^t]); for(j=1;j<=n;j++) ch[sum[j]]=0; t-=(1<<i); } } for(j=1;j<=n;j++) ch[sum[j]]=j; for(j=1;j<=n;j++) dap[j]=max(dap[j],ch[sum[j-1]^t]); for(i=1;i<=n;i++){ if(ans<dap[i]-i+1) ans=dap[i]-i+1, p=i; } printf("%d %d",p,ans); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...