Submission #101972

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)n;++i)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ALL(a) a.begin(),a.end()
#define SZ(a) (int)((a).size())
#define F first
#define S second
typedef pair<int,int> PI;


int a[200000];
vector<int> app[1<<20];

int main(int argc, char *argv[])
{
  int n;
  cin >> n;
  int ans=0;
  rep(i,n){
    cin >> a[i];
    ans |= a[i]>>19;
  }
  
  for(int i=2;i<=20;++i){
    int xs=0;
    rep(j,(1<<i)) app[j].clear();
    app[xs].pb(0);
    for(int j=0;j<n;++j){
      xs ^= a[j];
      app[xs>>(20-i)].pb(j+1);
    }
    ans <<= 1;
    rep(j,(1<<i)) if(SZ(app[(ans|1)^j]) && SZ(app[j])){
      ans |= 1;
      break;
    }
  }
  
  cout << ans << ' ';
  if(ans==0){
    cout << "1 1" << endl;
    return 0;
  }
  PI ansp(n+1,n+1);
  rep(j,(1<<20))
    if(SZ(app[ans^j]) && SZ(app[j])){
      int s=min(app[ans^j][0],app[j][0]);
      int t=max(app[ans^j][0],app[j][0]);
      ansp=min(ansp,mp(s,t));
    }
  cout << ansp.F+1 << ' ' << ansp.S << endl;
}

Submission Info

Judge Result