1512C. Nastia and a Hidden Permutation

先确认出1的位置…n/2次
用每个值与1做 1 号运算…,n-1次
不会超过3*n/2次
如果数列有奇数个元素，此时如果1在最后一个位置就会被忽略掉 所以如果p没被赋值1就在最后一个位置上

//cyc
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mst(a) memset(a,0,sizeof a)

using namespace std;
typedef pair<int,int> pii;
const int maxn=1e4+5;
int ans[maxn];

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int _;
    cin>>_;
    while(_--){//2 5 3 4 1
        int now,prev;
        int n;
        cin>>n;
        for(int i=1;i<=n;i++){
            ans[i]=0;
        }
        int p=-1;
        for(int i=1;i<n;i+=2){
            cout<<"? "<<2<<" "<<i<<" "<<i+1<<" "<<1<<endl;
            cin>>now;
           if(now==1){
                p=i;
                break;

           }
           if(now==2){
                cout<<"? "<<2<<" "<<i+1<<" "<<i<<" "<<1<<endl;
                cin>>now;
                if(now==1){
                    p=i+1;break;
                }
           }
        }
        if(p==-1)p=n;
        ans[p]=1;
        for(int i=1;i<=n;i++){
            if(i==p)continue;
                cout<<"? "<<1<<" "<<p<<" "<<i<<" "<<n-1<<endl;
                cin>>now;
                ans[i]=now;
        }

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