Secure Password

题意翻译

### 题目描述 本题是**交互题**。 有一个固定的数组 $A$，同时通过数组 $A$ 构造出数组 $P$，具体来讲，$P_i$ 是 $A$ 中除 $A_i$ 外的所有元素的按位或。 你需要在最多 $13$ 次询问中得到最后的 $P$ 数组。 ### 输入格式 第一行有一个正整数 $n$，表示数组 $A$ 的长度。 保证 $2\le n\le10^3$，$0\le A_i\le2^{63}-1$。 ### 交互格式 你可以按照 `? c q1 q2 q3 ... qc` 的格式进行询问，之后你将得到 $A_{q_1},A_{q_2},\dots,A_{q_c}$ 的按位或。 当你想输出 $P$ 数组时，首先输出一个 `!`，之后输出 $n$ 个整数 $P_i$。

题目描述

This is an interactive problem. Ayush devised yet another scheme to set the password of his lock. The lock has $ n $ slots where each slot can hold any non-negative integer. The password $ P $ is a sequence of $ n $ integers, $ i $ -th element of which goes into the $ i $ -th slot of the lock. To set the password, Ayush comes up with an array $ A $ of $ n $ integers each in the range $ [0, 2^{63}-1] $ . He then sets the $ i $ -th element of $ P $ as the [bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) of all integers in the array except $ A_i $ . You need to guess the password. To make a query, you can choose a non-empty subset of indices of the array and ask the bitwise OR all elements of the array with index in this subset. You can ask no more than 13 queries.

输入输出格式

输入格式

The first line of input contains one integer $ n $ $ (2 \le n \le 1000) $ — the number of slots in the lock.

输出格式

To ask a query print a single line: - In the beginning print "? c " (without quotes) where $ c $ $ (1 \leq c \leq n) $ denotes the size of the subset of indices being queried, followed by $ c $ distinct space-separated integers in the range $ [1, n] $ . For each query, you will receive an integer $ x $ — the bitwise OR of values in the array among all the indices queried. If the subset of indices queried is invalid or you exceeded the number of queries then you will get $ x = -1 $ . In this case, you should terminate the program immediately. When you have guessed the password, print a single line "! " (without quotes), followed by $ n $ space-separated integers — the password sequence. Guessing the password does not count towards the number of queries asked. The interactor is not adaptive. The array $ A $ does not change with queries. After printing a query do not forget to output the end of the line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use: - fflush(stdout) or cout.flush() in C++; - System.out.flush() in Java; - flush(output) in Pascal; - stdout.flush() in Python; - see the documentation for other languages. Hacks To hack the solution, use the following test format: On the first line print a single integer $ n $ $ (2 \le n \le 1000) $ — the number of slots in the lock. The next line should contain $ n $ space-separated integers in the range $ [0, 2^{63} - 1] $ — the array $ A $ .

输入输出样例

输入样例 #1

3

1

2

4

输出样例 #1

? 1 1

? 1 2

? 1 3

! 6 5 3

说明

The array $ A $ in the example is $ \{{1, 2, 4\}} $ . The first element of the password is bitwise OR of $ A_2 $ and $ A_3 $ , the second element is bitwise OR of $ A_1 $ and $ A_3 $ and the third element is bitwise OR of $ A_1 $ and $ A_2 $ . Hence the password sequence is $ \{{6, 5, 3\}} $ .