hdu 5014 Number Sequence(贪心)

Number Sequence

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 3041    Accepted Submission(s): 1210
Special Judge

Problem Description

There is a special number sequence which has n+1 integers. For each number in sequence, we have two rules:

● a _i ∈ [0,n] 
● a _i ≠ a _j( i ≠ j )

For sequence a and sequence b, the integrating degree t is defined as follows(“⊕” denotes exclusive or):

t = (a ₀ ⊕ b ₀) + (a ₁ ⊕ b ₁) +···+ (a _n ⊕ b _n)

(sequence B should also satisfy the rules described above)

Now give you a number n and the sequence a. You should calculate the maximum integrating degree t and print the sequence b.

 

Input

There are multiple test cases. Please process till EOF. 

For each case, the first line contains an integer n(1 ≤ n ≤ 10 ⁵), The second line contains a ₀,a ₁,a ₂,...,a _n.

 

Output

For each case, output two lines.The first line contains the maximum integrating degree t. The second line contains n+1 integers b ₀,b ₁,b ₂,...,b _n. There is exactly one space between b _i and b _i+1 (0 ≤ i ≤ n - 1). Don’t ouput any spaces after b _n.

 

Sample Input

4 2 0 1 4 3

 

Sample Output

20 1 0 2 3 4

 

Source

2014 ACM/ICPC Asia Regional Xi'an Online

题意：

给一个序列长度为N+1，序列的数字是从0到N互不相等。让你构造出一个序列使得他们对应下标的数异或和最大。

思路：

我们可以发现，对于一个2^n的数，2^n-1和它匹配是可以得到最大的。

进一步发现，2^n-2和2^n+1异或也是最大的，所以我们知道了匹配方法就是找到这样以2^n为中心对称的匹配是一个最优解。

所以我们不断重复这样的对称的规则来进行匹配就能得到最终答案。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
int a[maxn];
int b[maxn];
int c[maxn];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        memset(c,0,sizeof(c));
        ll ans=0;
        for(int i=0;i<=n;i++)
            scanf("%d",&a[i]);
        int k=(int)log2(n);
        int cheng=(int)pow(2,k);
        int pos=cheng;
        int p=1;
        while(pos<=n&&pos-p>=0)
        {
            c[pos-p]=pos;
            c[pos]=pos-p;
            ans+=((pos-p)^pos)*2;
            pos++;
            p+=2;
        }
        while(pos-p>=0)
        {
            pos-=p;
            p=1;
            k=(int)log2(pos);
            cheng=pos;
            pos=(int)pow(2,k);
            while(pos<=cheng&&pos-p>=0)
            {
                c[pos-p]=pos;
                c[pos]=pos-p;
                ans+=((pos-p)^pos)*2;
                pos++;
                p+=2;
            }
        }
        for(int i=0;i<=n;i++)
        {
            b[i]=c[a[i]];
        }
        printf("%lld\n",ans);
        for(int i=0;i<=n;i++)
        {
            if(i!=n)
                printf("%d ",b[i]);
            else
                printf("%d\n",b[i]);
        }
    }
    return 0;
}