http://codeforces.com/contest/1447/problem/E
题意:给出n个互不相同的数字,对每个i(1<=i<=n)找到ai^aj最小的j(1<=j<=n, j != i)连边,求最少删除多少个数能使得这样操作出来得到的是树
思路:
从位运算的角度来看,决定数值大小的首先要看最高位
考虑一个位,如果该位为0或1的数都有,那么为0的肯定与为0的数相连,因为这样该位的异或值为0,与为1的相连则会为1,肯定优先选小的
只考虑单个位的话,同位相同的肯定会在一个连通块;除非为1或0的只有一个,这种情况只能跟另一个值的连
因此容易得到使其成为树的策略,每个位需要选一个值作为最多大部分数在这个位上的取值,比如该位选0,那么该位为1的最多就只能留一个,也就能得到最少删除的数量
建立01trie,逐渐往下推,复杂度等于枚举所有ai,得到最终答案
啊,好简单,过了过了
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
#include <assert.h>
#include <iomanip>
using namespace std;
#define pb push_back
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define ansn() printf("%d\n",ans)
#define lansn() printf("%lld\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pll pair<long long,long long>
#define mp(aa,bb) make_pair(aa,bb)
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
double pi = acos(-1.0);
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
//const ll mod = 1000000007;
const double eps=1e-12;
const int inf=0x3f3f3f3f;
//const ll infl = 100000000000000000;//1e17
const int maxn= 2e6+20;
const int maxm = 5e3+20;
//muv[i]=(p-(p/i))*muv[p%i]%p;
inline int in(int &ret) {
char c;
int sgn ;
if(c=getchar(),c==EOF)return -1;
while(c!='-'&&(c<'0'||c>'9'))c=getchar();
sgn = (c=='-')?-1:1;
ret = (c=='-')?0:(c-'0');
while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
ret *=sgn;
return 1;
}
int trie[10*maxn][2];
int sz[10*maxn];
int cnt;
int ans = inf;
void insert(vector<int>v) {
int u = 0;
rn(i,30) {
int nt = v[i-1];
if(!trie[u][nt])
trie[u][nt] = ++cnt;
u = trie[u][nt];
++sz[u];
}
}
vector<int> getbit(int x) {
vector<int>v;
r0(i,30) {
v.pb(x&1);
x>>=1;
}
return v;
}
void solve(int u,int rmcnt,int lev) {
if (lev == 31){
ans = min(ans, rmcnt);
return;
}
r0(nt,2) {
if (!trie[u][nt])
continue;
int v = trie[u][nt^1];
int newrm = max(sz[v]- 1,0);
solve(trie[u][nt], rmcnt + newrm, lev+1);
}
}
int main() {
#ifdef LOCAL
freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
#endif // LOCA
int n;
sd(n);
r1(i,n){
int x;
sd(x);
insert(getbit(x));
}
solve(0,0,1);
ansn();
return 0;
}