1918E - ace5 and Task Order - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;
const int c=2005;
int n, ans[c];

int kerd(int a) {
    cout.flush() << "? " << a << "\n";
    char c;
    cin >> c;
    if (c=='<') return -1;
    if (c=='=') return 0;
    if (c=='>') return 1;
}
void calc(vector<int> sz, int l, int r) {
    int si=sz.size();
    if (si==0) {
        return;
    }
    int pos=rand()%si;
    while (kerd(sz[pos])) {

    }
    vector<int> kis, nagy;
    for (int i=0; i<si; i++) {
        if (i!=pos) {
            if (kerd(sz[i])==1) {
                nagy.push_back(sz[i]);
            } else {
                kis.push_back(sz[i]);
            }
            kerd(sz[pos]);
        }
    }
    int koz=l+kis.size();
    ans[sz[pos]]=koz;
    calc(kis, l, koz-1), calc(nagy, koz+1, r);
}
void solve() {
    cin >> n;
    vector<int> sz;
    for (int i=1; i<=n; i++) {
        sz.push_back(i);
    }
    calc(sz, 1, n);

    cout << "! ";
    for (int i=1; i<=n; i++) {
        cout << ans[i] << " ";
    }
    cout.flush() << endl;
}
int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(false);
    int w;
    cin >> w;
    while (w--) {
        solve();
    }
    return 0;
}