CF——Nastia and a Hidden Permutation

惭愧的说cf题刷的太少了
这是第一道cf上的交互题打卡
全程想了两个晚上，只想到了用1,2和n-1,n去猜
也猜到了要两个两个组合 因此是要3/2n次 Q
但是万万没有想到是利用max来算

但是真的双手称赞这道题（不知道为啥
就是觉得很妙的说！

题目大意
一个数组a，长度为n，数组的值是属于1-n的排列，但是顺序不确定
通过提问，来求出这个数组
每次提问，可以给出
1 i j x 返回给的值=max(min(a[i],x),min(a[j],x+1))
2 i j x 返回给的值=min(max(a[i],x),max(a[j],x+1))

最多只能提问at most ⌊3n/2⌋+30 times.
需要你在提问次数限制内给出数组a

题目链接

#include<bits/stdc++.h>
using namespace std;
int a[10005];
int main()
{
    int T;
    cin>>T;
    for(int t=0; t<T; t++)
    {
        int n;
        cin>>n;
        for(int i=1;i<=n;i++)a[i]=0;
        for(int i=1; i<=n; i++)
        {
            if(i==n&&a[i]==0)i--;
            else if(i==n&&a[i]!=0)break;
            //将n中的两个两个凑成一对
            cout<<"?"<<" "<<1<<" "<<i<<" "<<i+1<<" "<<n-1<<endl;
            cout.flush();
            int mx;
            cin>>mx;
            //1.求出a[i]和a[i+1]中的max
            //mx=max(min(n-1,a[i]),min(n,a[i+1]));
            //min(n,a[i+1])肯定是a[i+1]
            //min(n-1,a[i])只有当a[i]=n的时候不是a[i];
            //所以当a[i]!=n: mx=max(a[i],a[i+1]);
            //当a[i]==n: mx=max(n-1,a[i+1]); 而因为a[i]=n, 所以a[i+1]一定不是n
            //           mx=max(n-1,a[i+1])=n-1;
            if(mx==n-1)
            {
                cout<<"?"<<" "<<1<<" "<<i+1<<" "<<i<<" "<<n-1<<endl;
                cout.flush();
                int tmp;
                cin>>tmp;
                if(tmp==n)
                {
                    a[i]=n;
                    cout<<"?"<<" "<<2<<" "<<i+1<<" "<<i<<" "<<1<<endl;
                    cout.flush();
                    cin>>a[i+1];
                    i++;
                    continue;
                }
            }
            if(mx==n)
            {
                a[i+1]=n;
                cout<<"?"<<" "<<2<<" "<<i<<" "<<i+1<<" "<<1<<endl;
                cout.flush();
                cin>>a[i];
            }
            else
            {
                cout<<"? "<<1<<" "<<i<<" "<<i+1<<" "<<mx-1<<endl;
                //2.确定a[i]和a[j]中哪个是mx
                //tmp=max(min(mx-1,a[i]),min(mx,a[i+1]));
                //如果a[i]是mx, tmp=max(mx-1,a[i+1])=mx-1!=mx;
                //如果a[i+1]是mx,tmp=max(min(mx-1,a[i]),mx)=mx;
                cout.flush();
                int tmp;
                cin>>tmp;
                if(tmp==mx)
                {
                    a[i+1]=mx;
                    cout<<"?"<<" "<<2<<" "<<i<<" "<<i+1<<" "<<1<<endl;
                    //3.通过mx和其中一个数求出另一个数
                    //a[i+1]=mx=max(a[i],a[i+1]);
                    //a[i]=min(max(1,a[i]),max(2,a[i+1]));
                    //a[i]=min(a[i],a[i+1]);
                    cout.flush();
                    cin>>a[i];
                }
                else if(tmp=mx-1)
                {
                    a[i]=mx;
                    //a[i+1]<a[i];
                    //a[i+1]>=1;a[i]>=2;
                    //a[i]=mx=max(a[i],a[i+1]);
                    //a[i+1]=min(max(1,a[i+1]),max(2,a[i]));
                    //a[i]=min(a[i+1],a[i]);
                    cout<<"?"<<" "<<2<<" "<<i+1<<" "<<i<<" "<<1<<endl;
                    cout.flush();
                    cin>>a[i+1];
                }
            }
            i++;

        }
        cout<<"! ";
        for(int i=1; i<=n; i++)
            cout<<a[i]<<" ";
        cout<<endl;
        cout.flush();

    }
    return 0;
}