Hamilton

#include <bits/stdc++.h>
#define int long long 
//#define endl " \n"
#define vec vector 
#define all(x) x.begin(),x.end()
#pragma GCC optimize("O2,unroll-loops")
using namespace std;
bool query(int u,int v)
{
    cout<<"? "<<u<<" "<<v<<endl;
    char c;
    cin>>c;
    return c=='>';
}
stack<int> res;
void dfs(int u,int &n,vec<bool> vis,bool &enc,int c)
{
    vis[u]=1;
    if(c==n&&query(u,1))
    {
        enc=1;
        //res.push(1);
        res.push(u);
        return;
    }
    for(int v=1;v<=n;v++)
    {
        if((!vis[v])&&query(u,v))
        {
            //cout<<"going to:"<<v<<" from:"<<u<<" \n";
            dfs(v,n,vis,enc,c+1);
            if(enc)
            {
                res.push(u);
                return;
            }
        }
    }
    
}
int32_t main()
{
    /*ios::sync_with_stdio(false);
    cin.tie(nullptr);*/
    int n,t;
    cin>>n>>t;
    vec<vec<int>> g(n,vec<int>(n));
    for (int i = 0; i < n; i++)
    {
        for (int j = i+1; j < n; j++)
        {
            if(i==0&&j==n-1)g[j][i]=1;
            g[i][j]=!g[j][i];
        }//cout<<'\n';
        
    }
    //cout<<"01110\n00101\n00010\n01001\n10100\n"<<endl;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            cout<<g[i][j];
        }cout<<'\n';
        
    }
    cout<<endl;
    while(t--)
    {
        vec<bool> vis(n+1,0);
        bool enc=0;
        dfs(1,n,vis,enc,1);
        cout<<"! ";
        while(!res.empty())
        {
            cout<<res.top()<<" ";
            res.pop();
        }cout<<endl;
    }
    return 0;
}

Test 1

Subtask:

Verdict: ACCEPTED

Test 2

Subtask: 1

Verdict: ACCEPTED

Test 3

Subtask: 2, 3

Verdict: WRONG ANSWER

Test 4

Subtask: 4

Verdict: WRONG ANSWER