Codeforces Round #720 (Div. 2)题解

C.Nastia and a Hidden Permutation

题目：
This is an interactive problem!

Nastia has a hidden permutation p of length n consisting of integers from 1 to $n$. You, for some reason, want to figure out the permutation. To do that, you can give her an integer $t(1\le t\le 2)$, two different indices $i$ and $j(1\le i,j\le n,i\ne j)$, and an integer $x(1\le x\le n-1)$

Depending on $t$, she will answer:
$$\begin{gathered} t=1:max(min(x,p_i),min(x+1,p_j)) \\ t=2:min(max(x,p_i),max(x+1,p_j)) \end{gathered}$$
You can ask Nastia at most ⌊3⋅n/2⌋+30 times. It is guaranteed that she will not change her permutation depending on your queries. Can you guess the permutation?

题意：
交互题：给一个1到$n$的序列，通过最多$\lfloor \frac{3\ast n}{2}\rfloor +30-n+1$次操作，最终猜出这$n$个数分别是什么。
对于每次操作需给出操作方法序号，猜测值$x$，以及猜测数下标$i，j$。
①返回$max(min(x,$