http://acm.hdu.edu.cn/showproblem.php?pid=5014
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
0 ⊕ b
0) + (a
1 ⊕ b
1) +···+ (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.
● 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):
(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 5), The second line contains a 0,a 1,a 2,...,a n.
For each case, the first line contains an integer n(1 ≤ n ≤ 10 5), The second line contains a 0,a 1,a 2,...,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
0,b
1,b
2,...,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
#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
typedef __int64 LL;
const int N=100055;
int a[N],b[N],vis[N];
int n;
int get(int x)
{
int num=0;
while(x)
{
x>>=1;
num++;
}
return num;
}
int main()
{
while(~scanf("%d",&n))
{
for(int i=0;i<=n;i++)
scanf("%d",&a[i]);
memset(vis,-1,sizeof(vis));
for(int i=n;i>=0;i--)
{
if(vis[i]!=-1)
continue;
int x=get(i);
int tmp=((1<<x)-1)^i;
b[i]=tmp;
b[tmp]=i;
//printf("%d\n",b[i]);
vis[tmp]=1;
vis[i]=1;
}
LL sum=0;
for(int i=0;i<=n;i++)
sum+=(LL)(i^b[i]);
printf("%I64d\n",sum);
for(int i=0;i<=n;i++)
printf(i!=n?"%d ":"%d\n",b[a[i]]);
}
return 0;
}