牛客网暑期ACM多校训练营（第七场）A-Minimum Cost Perfect Matching

链接：https://www.nowcoder.com/acm/contest/145/A
来源：牛客网
 

题目描述

You have a complete bipartite graph where each part contains exactly n nodes, numbered from 0 to n - 1 inclusive.

The weight of the edge connecting two vertices with numbers x and y is (bitwise AND).

Your task is to find a minimum cost perfect matching of the graph, i.e. each vertex on the left side matches with exactly one vertex on the right side and vice versa. The cost of a matching is the sum of cost of the edges in the matching.

denotes the bitwise AND operator. If you're not familiar with it, see {https://en.wikipedia.org/wiki/Bitwise_operation#AND}.

 

输入描述:

The input contains a single integer n (1 ≤ n ≤ 5 * 105).

输出描述:

Output n space-separated integers, where the i-th integer denotes pi (0 ≤ pi ≤ n - 1, the number of the vertex in the right part that is matched with the vertex numbered i in the left part. All pi should be distinct.

Your answer is correct if and only if it is a perfect matching of the graph with minimal cost. If there are multiple solutions, you may output any of them.

示例1

输入

3

输出

0 2 1

说明

For n = 3, p0 = 0, p1 = 2, p2 = 1 works. You can check that the total cost of this matching is 0, which is obviously minimal.

题意：给定一个n，将0到n-1,安排位置，使得数字和安排后的所在位相与，和最小

思路：纸上推了一波，都写成二进制，你会发现正好可以插空配对，比如8（1000），7（111），与为0，然后规律就是，你直接把自己按位取反，就是恰当的位置

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>

using namespace std;

#define inf 0x3f3f3f3f

const int maxn=5e5+7;

int data[maxn];

int main()
{
    int n;
    scanf("%d",&n);
    for (int i = n-1; i >= 0 ; --i)
    {
        for (int j = 19; j >= 1 ; --j)
        {
            int flag= ( 1 << j ) - 1;
            if ((flag ^ i) < n && data[flag ^ i] == 0)
            {
                data[flag^i]=i;
                break;
            }
        }
    }
    for (int i = 0; i < n ; ++i)
    {
        printf("%d",data[i]);
        if(i==n-1) printf("\n");
        else printf(" ");
    }
    return 0;
}