Anu-Has-a-Function

CodeForces Round # 618 div2 C题

Anu Has a Function

题干

Anu has created her own function $f:f(x,y)=(x|y)-y$ where || | denotes the bitwise OR operation. For example,$f(11,6)=(11|6)-6=15-6=9$ . It can be proved that for any nonnegative numbers $x$ and $y$ value of $f(x,y)$ is also nonnegative.

She would like to research more about this function and has created multiple problems for herself. But she isn’t able to solve all of them and needs your help. Here is one of these problems.

A value of an array $a_1,a_2,\dots ,a_n$ is defined as $f(f(\dots f(f(a_1,a_2),a_3),\dots a_{n-1}),a_n)$(see notes). You are given an array with not necessarily distinct elements. How should you reorder its elements so that the value of the array is maximal possible?

Input

The first line contains a single integer $n(1\le n\le 10^5)$.

The second line contains $n$ integers $a_1,a_2,\dots ,a_n(0\le a_i\le 10^9)$. Elements of the array are not guaranteed to be different.

Output

Output $n$ integers, the reordering of the array with maximum value. If there are multiple answers, print any.

解题思路

直觉上，我们可以判断出在二进制层面$f(x,y)$运算的过程中不会出现某一个二进制位被借位的情况(因为一般情况下的减法有可能出现这种情况)

//这里是按照传统的二进制减法来理解，当然计算机实现减法是用补码啦

我们采用一种类似于数学归纳法的方式证明这个结论

将$x,y$的最低位记作$x_0,y_0$，若$x_0|y_0=0$则$x_0=y_0=0,f(x_0,y_0)=0$，若$x_0|y_0=1\text{且}{x}_0=y_0$，则减法也不会发生借位

若$x_0|y_0=1且x_0=1,y_0=0$显然不会借位，若$x_0|y_0=1且x_0=0,y_0=1$也是没有发生借位。

我们发现针对最低位不会发生借位，不难归纳出对于每一位也是这样的。那么这个函数可以写为按位运算的形式

$f(x,y)=x\bar{y}$其中$\bar{y}$表示对y按位取反

那么$f(f(\dots f(f(a_1,a_2),a_3),\dots a_{n-1}),a_n)=a_1\overline{a_2}\overline{a_3}\dots \overline{a_n}=a_{1}and(a_{2}or{a}_{3}or\dots a_n)$

由或运算的分配律知整个式子的结果就是由$a_1$的选取决定的

那么我们怎么选取$a_1$呢？当然是暴力出奇迹啦！，每一个$a_i$都计算一下就好了，这里要注意使用一下前缀和、后缀和的思想保存$[a_1,a_i]$区间和$[a_j,a_n]$相或的结果。

#include <iostream>
#include <algorithm>
using namespace std;
const int maxn=1e5+5;
int a[maxn],qzh[maxn],hzh[maxn];
int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        qzh[i]=qzh[i-1]|a[i];
    }
    for(int i=n;i>=1;i--){
        hzh[i]=hzh[i+1]|a[i];
    }
    int ans=-1,t,maxi=0;
    for(int i=1;i<=n;i++){
        t=a[i]&~(qzh[i-1]|hzh[i+1]);
        if(t>ans){
            ans=t;
            maxi=i;
        }
    }
    cout<<a[maxi]<<" ";
    for(int i=1;i<=n;i++){
        if(i!=maxi)cout<<a[i]<<" ";
    }
}