Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2) D. Something with XOR Queries

地址：http://codeforces.com/contest/872/problem/D

题目：

D. Something with XOR Queries

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

This is an interactive problem.

Jury has hidden a permutation p of integers from 0 to n - 1. You know only the length n. Remind that in permutation all integers are distinct.

Let b be the inverse permutation for p, i.e. pbi = i for all i. The only thing you can do is to ask xor of elements pi and bj, printing two indices i and j (not necessarily distinct). As a result of the query with indices i and j you'll get the value , where  denotes the xoroperation. You can find the description of xor operation in notes.

Note that some permutations can remain indistinguishable from the hidden one, even if you make all possible n2 queries. You have to compute the number of permutations indistinguishable from the hidden one, and print one of such permutations, making no more than 2nqueries.

The hidden permutation does not depend on your queries.

Input

The first line contains single integer n (1 ≤ n ≤ 5000) — the length of the hidden permutation. You should read this integer first.

Output

When your program is ready to print the answer, print three lines.

In the first line print "!".

In the second line print single integer answers_cnt — the number of permutations indistinguishable from the hidden one, including the hidden one.

In the third line print n integers p0, p1, ..., pn - 1 (0 ≤ pi < n, all pi should be distinct) — one of the permutations indistinguishable from the hidden one.

Your program should terminate after printing the answer.

Interaction

To ask about xor of two elements, print a string "? i j", where i and j — are integers from 0 to n - 1 — the index of the permutation element and the index of the inverse permutation element you want to know the xor-sum for. After that print a line break and make flushoperation.

After printing the query your program should read single integer — the value of .

For a permutation of length n your program should make no more than 2n queries about xor-sum. Note that printing answer doesn't count as a query. Note that you can't ask more than 2n questions. If you ask more than 2n questions or at least one incorrect question, your solution will get "Wrong answer".

If at some moment your program reads -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 2n 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 line break):

• 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:

n

p0 p1 ... pn - 1

Contestant programs will not be able to see this input.

思路：

　　2n次？

　　不就是让你询问(i,0)和(0,i)吗，i从1到n。

　　然后枚举第一个数就好了.O(n^2)

　　ps:一场涨了212，简直不要太爽

 #include <bits/stdc++.h>

 using namespace std;

 #define MP make_pair
 #define PB push_back
 typedef long long LL;
 typedef pair<int,int> PII;
 const double eps=1e-;
 const double pi=acos(-1.0);
 const int K=1e6+;
 const int mod=1e9+;

 int n,a[K],b[K],cnt,ans[K],sa[K],sb[K];

 int main(void)
 {
     ans[]=-;
     scanf("%d",&n);
     for(int i=;i<n;i++)
     {
         printf("? %d %d\n",i,);
         fflush(stdout);
         scanf("%d",a+i);
     }
     for(int i=;i<n;i++)
     {
         printf("? %d %d\n",,i);
         fflush(stdout);
         scanf("%d",b+i);
     }
     for(int i=;i<n;i++)
     {
         int ff=;
         for(int j=;j<n;j++)
             sa[j]=i^a[j];
         for(int j=;j<n;j++)
             sb[j]=sa[]^b[j];
         for(int j=;j<n&&ff;j++)
         if(sa[sb[j]]!=j)
             ff=;
         cnt+=ff;
         if(ans[]==-&&ff)
         {
             for(int j=;j<n;j++)
                 ans[j]=sa[j];
         }
     }
     printf("!\n%d\n",cnt);
     for(int i=;i<n;i++)
         printf("%d ",ans[i]);
     fflush(stdout);
     return ;
 }