Hamilton

#include <iostream>
#include <numeric>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
  /*  ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(0);*/
    int n, t, s;
    char c;
    cin>>n>>t;
    vector<vector<int>> a(n, vector<int> (n, 0));
    for (int i=0; i<n; ++i)
    {
        a[i][(i+1)%n]=1;
        for (int j=0; j<i-1; ++j)
            a[i][j]=1;
    }
    for (int i=0; i<n; ++i)
    {
        for (int j=0; j<n; ++j)
            cout<<a[i][j];
        cout<<endl;
    }
    for (int i=0; i<t; ++i)
    {
        vector<vector<int>> g(n, vector<int> (n, 0));
        vector<pair<int, int>> kol;
        for (int i=0; i<n; ++i)
        {
            s=0;
            for (int j=i+1; j<n; ++j)
            {
                cout<<"? "<<i+1<<" "<<j+1<<endl;
                cin>>c;
                if (c=='>')
                {
                    s+=1;
                    g[i][j]=1;
                }
                else
                {
                    g[j][i]=1;
                }
            }
            kol.push_back({s, i});
        }
        sort(kol.rbegin(), kol.rend());
        if (g[kol[0].second][kol[1].second]==0)
            swap(kol[0], kol[1]);
        if (g[kol[n-2].second][kol[n-1].second]==0)
            swap(kol[n-2], kol[n-1]);
        cout<<"!";
        for (int i=0; i<n; ++i)
            cout<<" "<<kol[i].second+1;
        cout<<endl;
    }
    return 0;
}

Test 1

Subtask:

Verdict: WRONG ANSWER

Test 2

Subtask: 1

Verdict: WRONG ANSWER

Test 3

Subtask: 2, 3

Verdict: WRONG ANSWER

Test 4

Subtask: 4

Verdict: WRONG ANSWER