Submission #2163209

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
using Int = long long;
//INSERT ABOVE HERE
signed main(){
  Int n;
  cin>>n;
  vector<Int> a(n);
  for(Int i=0;i<n;i++) cin>>a[i];
  
  Int k=0,px=0,py=0;
  for(Int m=20;m>=0;m--){
    vector<Int> b(n);
    for(Int i=0;i<n;i++) b[i]=a[i]>>m;
    Int nk=(k<<1)|1;
    bool ok=0;
    map<Int, Int> pos;
    Int x=0,idx=n+1,idy=n+1;
    for(Int i=0;i<n;i++){      
      if(!pos.count(x)) pos[x]=i;
      x^=b[i];
      if(pos.count(nk^x)){
	ok=1;
	if(pos[nk^x]<idx||(pos[nk^x]==idx&&i<idy))
	  tie(idx,idy)=make_pair(pos[nk^x],i);
      }
    }
    //cout<<nk<<":"<<ok<<endl;
    k<<=1;
    if(ok){
      k++;
      px=idx;
      py=idy;
    }
  }
  cout<<k<<" "<<px+1<<" "<<py+1<<endl;
  return 0;
}

Submission Info

Judge Result