#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #ifdef LOCAL # include "debug_print.hpp" # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast(0)) #endif using namespace std; #define rep(i,n) for(int i=0; i<(n); i++) #define rrep(i,n) for(int i=(n)-1; i>=0; i--) #define FOR(i,a,b) for(int i=(a); i<(b); i++) #define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--) #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); #define pb push_back using ll = long long; using D = double; using LD = long double; using P = pair; template using PQ = priority_queue>; template using minPQ = priority_queue, greater>; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b ostream &operator<<(ostream &os, const pair &p) { os << p.first << " " << p.second; return os; } template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const vector &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template istream &operator>>(istream &is, vector &v) { for (auto &x : v) is >> x; return is; } void in() {} template void in(T &t, U &...u) { cin >> t; in(u...); } void out() { cout << "\n"; } template void out(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; out(u...); } void outr() {} template void outr(const T &t, const U &...u) { cout << t; outr(u...); } #include #include using namespace __gnu_pbds; int query(vector &v){ out("?",v); cout.flush(); int ret; in(ret); if(ret == -1) exit(0); return ret; } void answer(vector &v){ out("!",v); cout.flush(); exit(0); } int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; in(n); tree, rb_tree_tag, tree_order_statistics_node_update> s; rep(i,n) s.insert(i+1); vector ans; vector q; rep(i,n){ int ok = 0, ng = s.size(); while(ng-ok > 1) { int mid = (ok+ng)/2; int qi = *s.find_by_order(mid); q = ans; q.pb(qi); for(int x : s) { if(x != qi) q.pb(x); } int asc = 1, desc = 1; rep(i,n-1){ if(q[i] < q[i+1]) desc = 0; else asc = 0; } int res; if(asc) res = 1; else res = query(q); if(desc and res == 1){ answer(q); } if(res == 1) ok = mid; else ng = mid; } int qi = *s.find_by_order(ok); s.erase(qi); ans.pb(qi); } answer(ans); }