HDU 5014 Number Sequence

贪心

可证明从大往小找异或的最大值，每个数必然有一个最搭配对

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>
#define CLR(x,y) memset(x,y,sizeof(x))
#define mp(x,y) make_pair(x,y)
#define eps 1e-9
#define INF 0x3f3f3f3f

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef complex<ld> point;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;

template<class T>
inline bool read(T &n)
{
    T x = 0, tmp = 1; char c = getchar();
    while((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();
    if(c == EOF) return false;
    if(c == '-') c = getchar(), tmp = -1;
    while(c >= '0' && c <= '9') x *= 10, x += (c - '0'),c = getchar();
    n = x*tmp;
    return true;
}
template <class T>
inline void write(T n)
{
    if(n < 0)
    {
        putchar('-');
        n = -n;
    }
    int len = 0,data[20];
    while(n)
    {
        data[len++] = n%10;
        n /= 10;
    }
    if(!len) data[len++] = 0;
    while(len--) putchar(data[len]+48);
}
//-----------------------------------

const int MAXN=100010;

int a[MAXN],ans[MAXN];
int n;
int temp[18];

void find(int x,int num)
{
	if(!x)
		return;
	find(x/2,num+1);
	temp[num]=!(x&1);
}

int main()
{
    while(read(n))
    {
		for(int i=0;i<=n;i++)
			read(a[i]);
		CLR(ans,-1);
		ll sum=0;
        for(int i=n;i>=0;i--)
       	{
       		if(ans[i]!=-1)
       			continue;
       		CLR(temp,0);
       		int tt=0;
    	  	find(i,0);
    	  	for(int j=0;j<18;j++)
    	  		tt|=(temp[j]<<j);
   	  		ans[i]=tt;
   	  		ans[tt]=i;
   	  		sum+=(ll)tt^(ll)i;
       	}
       	printf("%I64d\n",sum*2LL);
       	for(int i=0;i<=n;i++)
       		printf("%d%c",ans[a[i]],i==n?'\n':' ');
    }
    return 0;
}