Hamilton

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
mt19937 mt(time(0));

// --- JUDGE ---

ll judge_query_count;
vector<vector<bool>> judge_graph;

void judge_init(ll n) {
    cout << "0110\n";
    cout << "0011\n";
    cout << "0001\n";
    cout << "1000" << endl;
}

// true iff u -> v (1-indexed)
bool judge_query(ll u, ll v) {
    assert(u != v);
    judge_query_count++;
    cout << "? " << u << ' ' << v << endl;
    char ans; cin >> ans;
    return ans == '>';
}

// --- CONTESTANT ---

map<pair<ll, ll>, bool> mem;
bool ask(ll u, ll v) {
    if (u > v) return !ask(v, u);
    if (mem.count({u, v})) return mem[{u, v}];
    return mem[{u, v}] = judge_query(u+1, v+1);
}

void solve(ll n) {
    mem.clear();

    vector<ll> a(n);
    iota(all(a), 0ll);
    do {
        bool ok = true;
        for (ll i = 0; i < n; i++) {
            if (!ask(a[i], a[(i+1)%n])) ok = false;
        }
        if (!ok) continue;

        cout << "!";
        for (auto &e : a) cout << ' ' << e+1;
        cout << endl;
        return;
    } while (next_permutation(all(a)));
    assert(false);
}

// --- TESTS ---

int main() {
    ll n, t; cin >> n >> t;
    judge_init(n);
    for (ll i = 0; i < t; i++) {
        solve(n);
    }
}

Test 1

Subtask:

Verdict: WRONG ANSWER

Test 2

Subtask: 1

Verdict: ACCEPTED

Test 3

Subtask: 2, 3

Verdict: WRONG ANSWER

Test 4

Subtask: 4

Verdict: WRONG ANSWER