CF835E.The penguin's game

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Pay attention: this problem is interactive.

Penguin Xoriy came up with a new game recently. He has nn icicles numbered from 11 to nn . Each icicle has a temperature — an integer from 11 to 10910^{9} . Exactly two of these icicles are special: their temperature is yy , while a temperature of all the others is xyx≠y . You have to find those special icicles. You can choose a non-empty subset of icicles and ask the penguin what is the bitwise exclusive OR (XOR) of the temperatures of the icicles in this subset. Note that you can't ask more than 19 questions.

You are to find the special icicles.

输入格式

The first line contains three integers nn , xx , yy ( 2<=n<=10002<=n<=1000 , 1<=x,y<=1091<=x,y<=10^{9} , xyx≠y ) — the number of icicles, the temperature of non-special icicles and the temperature of the special icicles.

输出格式

To give your answer to the penguin you have to print character "!" (without quotes), then print two integers p1p_{1} , p2p_{2} ( p_{1}<p_{2} ) — the indexes of the special icicles in ascending order. Note that "!" and p1p_{1} should be separated by a space; the indexes should be separated by a space too. After you gave the answer your program should terminate immediately.

Interaction

To ask a question print character "?" (without quotes), an integer cc ( 1<=c<=n1<=c<=n ), and cc distinct integers p1p_{1} , p2p_{2} , ..., pcp_{c} ( 1<=pi<=n1<=p_{i}<=n ) — the indexes of icicles that you want to know about. Note that "?" and cc should be separated by a space; the indexes should be separated by a space too.

After you asked the question, read a single integer — the answer.

Note that you can't ask more than 19 questions. If you ask more than 19 questions or at least one incorrect question, your solution will get "Wrong answer".

If at some moment your program reads 1-1 as an answer, it should immediately exit (for example, by calling exit(0)). You will get "Wrong answer" in this case, it means that you asked more than 19 questions, or asked an invalid question. If you ignore this, you can get other verdicts since your program will continue to read from a closed stream.

Your solution will get "Idleness Limit Exceeded", if you don't print anything or forget to flush the output, including for the final answer .

To flush you can use (just after printing):

  • fflush(stdout) in C++;
  • System.out.flush() in Java;
  • stdout.flush() in Python;
  • flush(output) in Pascal;
  • For other languages see the documentation.

Hacking

For hacking use the following format:

nn xx yy p1p_{1} p2p_{2}

Here 1<=p_{1}<p_{2}<=n are the indexes of the special icicles.

Contestant programs will not be able to see this input.

输入输出样例

  • 输入#1

    4 2 1
    2
    1
    1

    输出#1

    ? 3 1 2 3
    ? 1 1
    ? 1 3
    ! 1 3

说明/提示

The answer for the first question is .

The answer for the second and the third questions is 1, therefore, special icicles are indexes 1 and 3.

You can read more about bitwise XOR operation here: https://en.wikipedia.org/wiki/Bitwise_operation#XOR.

首页