Submission #37185737

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define for0(i, n) for(int i=0;i<n;i++)
#define for1(i, n) for(int i=1;i<=n;i++)
#define forr0(i, n) for(int i=n-1;i>=0;i--)
#define forr1(i, n) for(int i=n;i>0;i--)
#define forc(i, m, n) for(int i=m; i<n;i++)

#define ll long long
#define fs first
#define se second 
#define push push_back 
#define pop pop_back 

const ll mod1 = 1000000007, mod2 = 998244353;
int a[200000];

ll solve(int l, int r, int p){
  int it = (lower_bound(a+l, a+r+1, 1<<p)-a);
  if (it == r+1 || it == l){
    if (p == 0) return 0;
    return solve(l, r, p-1);
  }
  if (p == 0) return 1;
  return (1<<p)+ min(solve(l, it-1, p-1), solve(it, r, p-1));

}




int main(){
  #ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	#endif

  int n;
  cin>>n;
  for0(i, n) cin>>a[i];
  sort(a, a+n);
  cout<<solve(0, n-1, 32)<<endl;
  return 0;
}

Submission Info

Judge Result