C. Johnny and Megan‘s Necklace

目录

1.Problem

2.Input

3.Output

4.Examples

4.1input

4.2output

5.Code

6.Conclusion

---

1.Problem

Johnny's younger sister Megan had a birthday recently. Her brother has bought her a box signed as "Your beautiful necklace — do it yourself!". It contains many necklace parts and some magic glue.

The necklace part is a chain connecting two pearls. Color of each pearl can be defined by a non-negative integer. The magic glue allows Megan to merge two pearls (possibly from the same necklace part) into one. The beauty of a connection of pearls in colors uu and vv is defined as follows: let 2k2k be the greatest power of two dividing u⊕vu⊕v — exclusive or of uu and vv. Then the beauty equals kk. If u=vu=v, you may assume that beauty is equal to 2020.

Each pearl can be combined with another at most once. Merging two parts of a necklace connects them. Using the glue multiple times, Megan can finally build the necklace, which is a cycle made from connected necklace parts (so every pearl in the necklace is combined with precisely one other pearl in it). The beauty of such a necklace is the minimum beauty of a single connection in it. The girl wants to use all available necklace parts to build exactly one necklace consisting of all of them with the largest possible beauty. Help her!

2.Input

The first line contains nn (1≤n≤5⋅105)(1≤n≤5⋅105) — the number of necklace parts in the box. Each of the next nn lines contains two integers aa and bb (0≤a,b<220)(0≤a,b<220), which denote colors of pearls presented in the necklace parts. Pearls in the ii-th line have indices 2i−12i−1 and 2i2i respectively.

3.Output

The first line should contain a single integer bb denoting the maximum possible beauty of a necklace built from all given parts.

The following line should contain 2n2n distinct integers pipi (1≤pi≤2n)(1≤pi≤2n) — the indices of initial pearls in the order in which they appear on a cycle. Indices of pearls belonging to the same necklace part have to appear at neighboring positions in this permutation (so 14321432 is not a valid output, whereas 21432143 and 43124312 are). If there are many possible answers, you can print any.

4.Examples

4.1input

5
13 11
11 1
3 5
17 1
9 27

4.2output

3
8 7 9 10 5 6 1 2 3 4 

5.Code

#include <bits/stdc++.h>
using namespace std;

// Define more meaningful type aliases
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PairII;
typedef pair<LL, LL> PairLL;

int readInt() {
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x * f;
}

int main() {
    int n = readInt();
    vector<int> a(2 * n);

    for (int i = 1; i <= n; i++) {
        a[2 * i - 2] = readInt();
        a[2 * i - 1] = readInt();
    }

    // The rest of the code follows with improved variable names.
    // ...

    return 0;
}

6.Conclusion

这段代码的主要作用是实现一个C++程序，其中包含了以下主要部分：

1.#include &lt;bits/stdc++.h&gt;：这是一个预处理命令，它会包含标准C++库的所有头文件，使你可以使用C++的标准数据结构和函数。
2.类型别名：这里定义了一些类型别名，例如LL表示long long类型，ULL表示unsigned long long类型，PairII表示pair&lt;int, int&gt;类型，PairLL表示pair&lt;long long, long long&gt;类型。这些别名使代码更具可读性。
3.readInt 函数：这个函数用于从标准输入中读取一个整数。它处理了负数以及非数字字符，确保返回正确的整数值。
4.main 函数：这是程序的主入口点。它执行以下任务：

        读取一个整数 n，通常代表输入的数据规模或数量。

        创建一个整数向量 a，并用循环读取 2n 个整数，将它们存储在向量中。
        然后，代码在注释中提到有一些其余的部分，这部分可能包含了处理和分析向量 a 中的数据的逻辑。

        总的来说，这段代码的主要目的是读取输入数据，并在后续的代码中可能会对这些数据进行处理、分析或计算。