#937229 (C++23) No.2577 Simple Permutation Guess

提出ソース

結果

問題	No.2577 Simple Permutation Guess
ユーザー	👑 bo9chan
提出日時	2023-12-08 00:03:02
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	26,424 bytes
コンパイル時間	2,128 ms
コンパイル使用メモリ	175,128 KB
実行使用メモリ	25,476 KB
平均クエリ数	248.84
最終ジャッジ日時	2024-09-27 02:27:27
合計ジャッジ時間	17,508 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	27 ms 25,436 KB
testcase_01	AC	167 ms 25,196 KB
testcase_02	AC	51 ms 24,556 KB
testcase_03	AC	24 ms 25,196 KB
testcase_04	AC	69 ms 25,196 KB
testcase_05	AC	80 ms 24,428 KB
testcase_06	AC	209 ms 25,196 KB
testcase_07	AC	206 ms 25,196 KB
testcase_08	AC	206 ms 24,556 KB
testcase_09	AC	206 ms 24,812 KB
testcase_10	AC	204 ms 24,940 KB
testcase_11	AC	25 ms 24,812 KB
testcase_12	AC	24 ms 24,428 KB
testcase_13	AC	26 ms 24,812 KB
testcase_14	AC	25 ms 24,800 KB
testcase_15	AC	24 ms 25,196 KB
testcase_16	AC	24 ms 24,940 KB
testcase_17	AC	24 ms 24,556 KB
testcase_18	AC	23 ms 24,812 KB
testcase_19	AC	23 ms 25,196 KB
testcase_20	AC	23 ms 24,796 KB
testcase_21	AC	24 ms 24,556 KB
testcase_22	AC	24 ms 24,836 KB
testcase_23	AC	25 ms 24,836 KB
testcase_24	AC	24 ms 25,220 KB
testcase_25	AC	24 ms 25,220 KB
testcase_26	AC	23 ms 25,220 KB
testcase_27	AC	24 ms 24,452 KB
testcase_28	AC	24 ms 24,580 KB
testcase_29	AC	24 ms 25,220 KB
testcase_30	AC	24 ms 25,220 KB
testcase_31	AC	23 ms 24,812 KB
testcase_32	AC	24 ms 25,196 KB
testcase_33	AC	23 ms 25,452 KB
testcase_34	AC	24 ms 24,812 KB
testcase_35	AC	24 ms 25,196 KB
testcase_36	AC	24 ms 24,556 KB
testcase_37	RE	-
testcase_38	AC	23 ms 24,580 KB
testcase_39	AC	24 ms 24,580 KB
testcase_40	AC	25 ms 24,836 KB
testcase_41	AC	25 ms 24,964 KB
testcase_42	AC	24 ms 25,220 KB
testcase_43	AC	24 ms 24,964 KB
testcase_44	AC	24 ms 24,836 KB
testcase_45	AC	23 ms 25,220 KB
testcase_46	AC	23 ms 24,580 KB
testcase_47	AC	24 ms 24,836 KB
testcase_48	AC	24 ms 25,220 KB
testcase_49	AC	23 ms 24,836 KB
testcase_50	AC	24 ms 24,580 KB
testcase_51	AC	23 ms 24,836 KB
testcase_52	AC	23 ms 24,580 KB
testcase_53	AC	24 ms 25,220 KB
testcase_54	AC	24 ms 25,476 KB
testcase_55	AC	24 ms 25,220 KB
testcase_56	AC	23 ms 24,964 KB
testcase_57	AC	24 ms 25,220 KB
testcase_58	AC	24 ms 25,220 KB
testcase_59	AC	24 ms 25,476 KB
testcase_60	AC	23 ms 24,836 KB
testcase_61	AC	23 ms 25,220 KB
testcase_62	AC	23 ms 25,208 KB
testcase_63	AC	24 ms 24,452 KB
testcase_64	AC	24 ms 25,220 KB
testcase_65	AC	24 ms 24,836 KB
testcase_66	AC	24 ms 25,076 KB
testcase_67	AC	24 ms 24,836 KB
testcase_68	AC	24 ms 25,220 KB
testcase_69	AC	24 ms 25,220 KB
testcase_70	AC	24 ms 24,452 KB
testcase_71	AC	24 ms 25,092 KB
testcase_72	AC	23 ms 24,580 KB
testcase_73	AC	24 ms 24,556 KB
testcase_74	AC	26 ms 24,556 KB
testcase_75	AC	25 ms 24,556 KB
testcase_76	AC	26 ms 24,940 KB
testcase_77	AC	26 ms 24,812 KB
testcase_78	AC	25 ms 24,812 KB
testcase_79	AC	26 ms 24,940 KB
testcase_80	AC	25 ms 24,940 KB
testcase_81	AC	26 ms 24,556 KB
testcase_82	AC	25 ms 24,428 KB
testcase_83	AC	26 ms 24,812 KB
testcase_84	AC	26 ms 25,452 KB
testcase_85	AC	26 ms 24,940 KB
testcase_86	AC	26 ms 25,196 KB
testcase_87	AC	25 ms 24,812 KB
testcase_88	AC	26 ms 24,800 KB
testcase_89	AC	25 ms 24,556 KB
testcase_90	AC	25 ms 25,196 KB
testcase_91	AC	28 ms 24,812 KB
testcase_92	AC	164 ms 24,812 KB
testcase_93	AC	151 ms 24,556 KB
testcase_94	AC	141 ms 24,812 KB
testcase_95	AC	194 ms 24,812 KB
testcase_96	AC	199 ms 24,556 KB
testcase_97	AC	184 ms 25,196 KB
testcase_98	AC	184 ms 25,196 KB
testcase_99	AC	193 ms 24,940 KB
testcase_100	AC	148 ms 25,452 KB
testcase_101	AC	183 ms 25,452 KB
evil_1_rnd_1.txt	AC	395 ms 25,196 KB
evil_1_rnd_2.txt	AC	400 ms 24,812 KB
evil_2_big_1.txt	AC	508 ms 24,556 KB
evil_2_big_2.txt	AC	503 ms 24,812 KB
evil_2_big_3.txt	AC	506 ms 25,196 KB
evil_3_sorted_1.txt	AC	280 ms 24,824 KB
evil_4_sorted_rev_1.txt	AC	212 ms 24,964 KB
evil_4_sorted_rev_2.txt	AC	310 ms 24,836 KB
evil_400_sorted.txt	AC	483 ms 24,952 KB
evil_400_sorted_rev.txt	AC	496 ms 24,836 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#ifdef __LOCAL
#include <mytemplate.hpp>  // プリコンパイル済みヘッダ ~/local/include/mytemplate.hpp.gch
#else
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream> 
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#endif
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
using int128 = __int128_t;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
#define REP1(i, n) REP3(i, 0, n, 1)
#define REP2(i, s, n) REP3(i, s, n, 1)
#define REP3(i, s, n, d) for(ll i = (ll)(s); i < (ll)(n); i += (d))
#define REP_OVERLOAD(e1, e2, e3, e4, NAME,...) NAME
#define rep(...) REP_OVERLOAD(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)
#define DEP1(i, n) DEP3(i, n, -1, 1)
#define DEP2(i, n, s) DEP3(i, n, s, 1)
#define DEP3(i, n, s, d) for(ll i = (ll)(n); (ll)(s) < i; i -= (d))
#define DEP_OVERLOAD(e1, e2, e3, e4, NAME,...) NAME
#define dep(...) DEP_OVERLOAD(__VA_ARGS__, DEP3, DEP2, DEP1)(__VA_ARGS__)
#define fore(e, a) for (auto&& e: (a))
#define len(a) (ll)(a).size()
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define th third
/*********    C O N S T A N T    **********/
constexpr ll INF = LONG_LONG_MAX / 2 - 10000LL;  // 4,611,686,018,427,377,903  ~= 4.6e+18, 19桁
const double PI = acos(-1);
/*********       P A I R       **********/
template<class T, class U> inline pair<T, U>& operator+=(pair<T, U>& a, const pair<T, U> b);
template<class T, class U> inline pair<T, U>& operator-=(pair<T, U>& a, const pair<T, U> b);
template<class T, class U> inline pair<T, U>& operator*=(pair<T, U>& a, const pair<T, U> b);
template<class T, class U> inline pair<T, U>& operator/=(pair<T, U>& a, const pair<T, U> b);
template<class T, class U> inline pair<T, U>& operator%=(pair<T, U>& a, const pair<T, U> b);
template<class T, class U, class V> inline pair<T, U>& operator+=(pair<T, U>& a, const V b);
template<class T, class U, class V> inline pair<T, U>& operator-=(pair<T, U>& a, const V b);
template<class T, class U, class V> inline pair<T, U>& operator*=(pair<T, U>& a, const V b);
template<class T, class U, class V> inline pair<T, U>& operator/=(pair<T, U>& a, const V b);
template<class T, class U, class V> inline pair<T, U>& operator%=(pair<T, U>& a, const V b);
template<class T, class U, class V> inline pair<T, U> operator+(pair<T, U> a, const V& b);
template<class T, class U, class V> inline pair<T, U> operator-(pair<T, U> a, const V& b);
template<class T, class U, class V> inline pair<T, U> operator*(pair<T, U> a, const V& b);
template<class T, class U, class V> inline pair<T, U> operator/(pair<T, U> a, const V& b);
template<class T, class U, class V> inline pair<T, U> operator%(pair<T, U> a, const V& b);
template<class T, class U> inline pair<T, U> operator+(pair<T, U> a);
template<class T, class U> inline pair<T, U> operator-(pair<T, U> a);
template<class T, class U> istream& operator >>(istream& stream, pair<T, U>& a);
template<class T, class U> ostream& operator <<(ostream &stream, const pair<T, U>& a);
/*********       V E C T O R      **********/
template<class T> inline vector<T>& operator+=(vector<T>& a, const vector<T> b);
template<class T> inline vector<T>& operator-=(vector<T>& a, const vector<T> b);
template<class T> inline vector<T>& operator*=(vector<T>& a, const vector<T> b);
template<class T> inline vector<T>& operator/=(vector<T>& a, const vector<T> b);
template<class T> inline vector<T>& operator%=(vector<T>& a, const vector<T> b);
template<class T, class U> inline vector<T>& operator+=(vector<T>& a, const U b);
template<class T, class U> inline vector<T>& operator-=(vector<T>& a, const U b);
template<class T, class U> inline vector<T>& operator*=(vector<T>& a, const U b);
template<class T, class U> inline vector<T>& operator/=(vector<T>& a, const U b);
template<class T, class U> inline vector<T>& operator%=(vector<T>& a, const U b);
template<class T, class U> inline vector<T> operator+(vector<T> a, const U& b);
template<class T, class U> inline vector<T> operator-(vector<T> a, const U& b);
template<class T, class U> inline vector<T> operator*(vector<T> a, const U& b);
template<class T, class U> inline vector<T> operator/(vector<T> a, const U& b);
template<class T, class U> inline vector<T> operator%(vector<T> a, const U& b);
template<class T> inline vector<T> operator+(vector<T> a);
template<class T> inline vector<T> operator-(vector<T> a);
template<class T> istream& operator >>(istream& stream, vector<T>& a);
template<class T> ostream& operator <<(ostream& stream, const vector<T>& v);
template<class T> ostream& operator <<(ostream& stream, const vector<vector<T>>& vv);
template<class T> inline T Sum(const vector<T>& v) {return reduce(all(v));}  // v.size() == 0 のとき T() を返す
template<class T> inline T Max(const vector<T>& v) {assert(v.size()); return *max_element(all(v));}
template<class T> inline T Min(const vector<T>& v) {assert(v.size()); return *min_element(all(v));}
template<class T> inline ll Argmax(const vector<T>& v) {assert(v.size()); return max_element(all(v)) - v.begin();}
template<class T> inline ll Argmin(const vector<T>& v) {assert(v.size()); return min_element(all(v)) - v.begin();}
template<class T, class U> inline bool Contains(const vector<T>& v, const U& a) {return find(all(v), a) != v.end();}
template<class T> inline void Unique(vector<T>& v) {sort(all(v)); v.erase(unique(all(v)), v.end());}  // ソートされたユニーク値のvectorに書き換える, O(NlogN).
template<class T, class U> vector<T> make_vector(int n, U v) { return vector<T>(n, v); }
template <class T, class... Args> auto make_vector(int n, Args... args) {auto val = make_vector<T>(args...); return make_vector<decltype(val)>(n, move(val));}
/*********        S E T        **********/
template<class T> istream& operator >>(istream& stream, set<T>& st);
template<class T> ostream& operator <<(ostream& stream, const set<T>& st);
template<class T> inline T Max(const set<T>& st) {assert(st.size()); return *prev(st.end());}
template<class T> inline T Min(const set<T>& st) {assert(st.size()); return *st.begin();}
/*********   M U L T I S E T   **********/
template<class T> istream& operator >>(istream& stream, multiset<T>& st);
template<class T> ostream& operator <<(ostream& stream, const multiset<T>& st);
template<class T> inline T Max(const multiset<T>& st) {assert(st.size()); return *prev(st.end());}
template<class T> inline T Min(const multiset<T>& st) {assert(st.size()); return *st.begin();}
template<class T> inline bool EraseOne(multiset<T>& st, T x) {auto it=st.find(x); if (it!=st.end()) {st.erase(it); return true;} else return false;}  // 要素xを1つ削除. 消せたらtrueを返す.
/*********     S T R I N G     **********/
inline string ToUpper(const string& s) {string t; t.resize(s.size()); std::transform(all(s), t.begin(), ::toupper); return t; }
inline string ToLower(const string& s) {string t; t.resize(s.size()); std::transform(all(s), t.begin(), ::tolower); return t; }
inline char ToUpper(const char& c) {string s{c}, t; t.resize(s.size()); std::transform(all(s), t.begin(), ::toupper); return t[0]; }
inline char ToLower(const char& c) {string s{c}, t; t.resize(s.size()); std::transform(all(s), t.begin(), ::tolower); return t[0]; }
/*********       T R I O       **********/
template<class T1, class T2, class T3> struct trio {
    T1 first; T2 second; T3 third;
    // コンストラクタ・代入演算子
    trio() {first=T1(); second=T2(); third=T3();}
    trio(const T1& x) : first(x), second(x), third(x) {}
    trio(const T1& x, const T2& y, const T3& z) : first(x), second(y), third(z) {}
    trio(const trio& t) {first=t.first; second=t.second; third=t.third;}  // コピーコンストラクタ
    trio& operator =(const trio& t) {first=t.first; second=t.second; third=t.third; return *this;}
    // 比較演算子
    auto operator <=>(const trio&) const = default;
    // 単項演算子（+ -）
    trio operator +() const { return *this; }
    trio operator -() const { return (-1) * (*this); }
    // 複合代入演算子
    trio& operator +=(const trio& t) {first += t.first; second += t.second; third += t.third; return *this;}
    trio& operator -=(const trio& t) {first -= t.first; second -= t.second; third -= t.third; return *this;}
    trio& operator *=(const trio& t) {first *= t.first; second *= t.second; third *= t.third; return *this;}
    trio& operator /=(const trio& t) {first /= t.first; second /= t.second; third /= t.third; return *this;}
    trio& operator %=(const trio& t) {first %= t.first; second %= t.second; third %= t.third; return *this;}
    // 算術演算子
    friend trio operator +(const trio& lhs, const trio& rhs) {return trio(lhs) += rhs;}
    friend trio operator -(const trio& lhs, const trio& rhs) {return trio(lhs) -= rhs;}
    friend trio operator *(const trio& lhs, const trio& rhs) {return trio(lhs) *= rhs;}
    friend trio operator /(const trio& lhs, const trio& rhs) {return trio(lhs) /= rhs;}
    friend trio operator %(const trio& lhs, const trio& rhs) {return trio(lhs) %= rhs;}
    // 入出力
    friend istream& operator >>(istream &stream, trio& t) {return stream >> t.first >> t.second >> t.third;}
    friend ostream& operator <<(ostream &stream, const trio& t) {return stream << t.first << " " << t.second << " " << t.third;}
    operator tuple<T1&, T2&, T3&>() {return tie(first, second, third);}
};
using tll = trio<ll, ll, ll>;
/*********     R A N D O M     **********/
struct Random {
    mt19937_64 rnd;
    Random() {
        random_device seed_gen;
        rnd.seed(seed_gen());
    }
    ll randint(ll a, ll b) {  // [a, b]
        uniform_int_distribution<ll> dist(a, b);
        return dist(rnd);
    }
    double randreal(double a, double b) {
        uniform_real_distribution<double> dist(a, b);
        return dist(rnd);
    }
    char randchar(char a, char b) {  // [a, b]
        uniform_int_distribution<ll> dist(a, b);
        return dist(rnd);
    }
};
/*********       P R I N T       **********/
template<class T> inline void print(const T& e);
template<class H, class... T> inline void print(const H& h, const T&... t);
template<class... T> inline void End(const T&... t);
/*********       D E B U G       **********/
#ifdef __LOCAL
#define debug(...) if(DEBUG) do{cout << '[' << #__VA_ARGS__ << "] ";debug_(__VA_ARGS__);}while(0)
#else
#define debug(...)
#endif
void dbg_(const long long& e);
template<class T> void dbg_(const T& e);
template<class T, class U> void dbg_(const pair<T, U>& p);
template<class T1, class T2, class T3> void dbg_(const trio<T1, T2, T3>& t);
template<class T> void debug_(const T& e);
template<class T> void debug_(const vector<T>& v);
template<class T> void debug_(const vector<vector<T>>& vv);
template<class T, class U> void debug_(const map<T, U>& mp);
template<class T, class U> void debug_(const vector<map<T, U>>& vm);
template<class T> void debug_(const set<T>& st);
template<class T> void debug_(const multiset<T>& st);
template<class T> void debug_(const vector<set<T>>& vs);
template<class T> void debug_(const vector<multiset<T>>& vs);
template<class H, class... T> void debug_(const H& h, const T&... t);
/*********       O T H E R S       **********/
template<class T, class U> inline bool chmin(T& a, U b) {if (a > b) {a = b; return true;} return false;}  // bは値渡し!
template<class T, class U> inline bool chmax(T& a, U b) {if (a < b) {a = b; return true;} return false;}
template<class T, class U> inline auto Mod(const T& a, const U& m) {return (a % m + m) % m;}  // 負もOK
template<class T, class U> inline auto Ceil(const T& x, const U& y) {return x < 0 ? x/y : (x + y - 1) / y;}  // 負もOK
template<class T, class U> inline auto Floor(const T& x, const U& y) {return -(Ceil(-x, y)); }  // 負もOK
inline ll Isqrt(ll n) {assert(n >= 0); ll x = round(sqrt(n)); while(x * x > n) --x; return x;}
inline ll Comb(ll n, ll r) {if (r < 0 || n < r) return 0; r = min(r, n - r); ll ret = 1; rep(i, r) {ret *= n - i; ret /= i + 1;} return ret;}  // n=60, r=30までOK
template<class T> inline T Pow(T x, ll n) {assert(n >= 0); T ret = 1; while(1) {if (n % 2) ret *= x; n /= 2; if(!n) return ret; x = x * x;}}  // べき乗 mintもOK
template<class T> inline T Aseries(T a, T d, ll n) {assert(n >= 0); return a * n + n * (n - 1) / 2 * d;}  // 等差級数 mintもOK
template<class T> inline T Gseries(T a, T r, ll n) {assert(n >= 0); if (r == 1) return a * n; else return a * (1 - Pow(r, n)) / (1 - r);}  // 等比級数 mintもOK
template<class T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
inline bool Bit(ll b, int i) {assert(0 <= i && i < 64); return (b >> i) & 1;}
inline ll Popcount(ll b) {return __builtin_popcountll(b);}
inline ll Mask(ll n) {assert(0 <= n && n < 63); return (1LL << n) - 1LL;}  // [0, n)のbitが立った64bit整数を返す。
inline ll Mask(ll n, ll m) {assert(n >= m); return Mask(n) ^ Mask(m);}  // [m, n)のbitが立った64bit整数を返す。
/*********       M  O  D       **********/
// #include <atcoder/modint>  // https://atcoder.github.io/ac-library/production/document_ja/
// using namespace atcoder;
// using mint = modint998244353;     // modint1000000007;
// istream& operator >>(istream& stream, mint& e) {ll n; stream >> n; e = n; return stream; }
// ostream& operator <<(ostream& stream, const mint& e) { stream << e.val(); return stream; }
// using vm = vector<mint>;
// using vvm = vector<vm>;
/***************************************/
constexpr bool DEBUG = true;

// 参考 : https://algo-logic.info/binary-indexed-tree/
template<class T> struct FenwickTree {
    ll N;
    vector<T> A;
    T total = 0;  // 全体の和.
    FenwickTree(ll N_) : N(N_) { A.resize(N + 1); }
    FenwickTree(const vector<T>& vec) : N(vec.size()) {
        A.resize(N + 1);
        for(ll i = 0; i < N; i++) add(i, vec[i]);
    }
    // 要素pにxを加算, O(logN).
    void add(ll p, T x) {
        assert(0 <= p && p < N);
        for (ll i = p + 1; i <= N; i += i&(-i)) A[i] += x;
        total += x;
    }
    // 要素pの値を得る, O(logN).
    T operator[](ll p)  {
        assert(0 <= p && p < N);
        return sum(p, p + 1);
    }
    // 区間[l, r)の和を得る, O(logN).
    T sum(ll l, ll r) {
        if (l > r) return 0;
        return sum(r) - sum(l);
    }
    //区間[0, r)の和を得る, O(logN).
    T sum(ll r) {
        assert(0 <= r && r <= N);
        T ret = 0;
        for (ll i = r; i > 0; i -= i&(-i)) ret += A[i];
        return ret;
    }
    // 全体の和を得る, O(1).
    T sum() {
        return total;
    }
    /***  以下, 集合管理（multiset）の文脈で使用可  ***/
    // n番目(1-origin)に小さい要素を得る, O(logN).
    ll nth_smallest(T n) {
        assert(0 < n && n <= total);
        ll l = 0;
        ll r = N + 1;
        while(r - l > 1) {
            ll m = (l + r) / 2;
            if (sum(m) >= n) r = m;
            else l = m;
        }
        return r - 1;
    }
    // n番目(1-origin)に大きい要素を得る, O(logN).
    ll nth_largest(T n) {
        return nth_smallest(total + 1 - n);
    }
};


// 10進数 -> 階乗進数. ex) 2575 -> 332101F（0!の桁はなし）
// 0 <= n < 20! = 2,432,902,008,176,640,000 ~= 2.4e+18
// 参考：https://wasan.hatenablog.com/entry/2016/05/23/130403
vl dec2fact(ll n) {
    assert(0 <= n);
    vl ret;
    rep(d, 2, 21) {
        ret.pb(n % d);
        n /= d;
        if (n == 0) break;
    }
    assert(n == 0);  // n < 20!
    reverse(all(ret));
    return ret;
}

// 階乗進数 -> 10進数. ex) 332101F -> 2575
ll fact2dec(const vl& fac) {
    ll n = len(fac);
    assert(0 < n && n < 20);
    ll ret = 0;
    ll d = 1;
    rep(i, 1, n + 1) {
        d *= i;  // i!
        ret += fac[n - i] * d;
    }
    return ret;
}

// 順列 -> 階乗進数. ex) (310542) -> 31021F
// 参考：https://wasan.hatenablog.com/entry/2016/06/02/134921
vl perm2fact(const vl& perm) {
    ll n = len(perm);
    FenwickTree<ll> fw(n);
    rep(i, n) fw.add(i, 1);
    vl ret;
    rep(i, n - 1) {
        ll cnt = fw.sum(0, perm[i]);
        ret.pb(cnt);
        fw.add(perm[i], -1);
    }
    return ret;
}

// 階乗進数 -> 順列. ex) 31021F -> (310542)
vl fact2perm(const vl& fac) {
    ll n = len(fac) + 1;
    FenwickTree<ll> fw(n);
    rep(i, n) fw.add(i, 1);
    vl ret;
    rep(i, n) {
        ll cnt = 1;
        if (i < n - 1) cnt = fac[i] + 1;
        ll val = fw.nth_smallest(cnt);
        ret.pb(val);
        fw.add(val, -1);
    }
    return ret;
}
// dec2fact(2575);                   // {3, 3, 2, 1, 0, 1}
// fact2dec(vl{3, 3, 2, 1, 0, 1});   // 2575
// perm2fact(vl{3, 1, 0, 5, 4, 2});  // {3, 1, 0, 2, 1}
// fact2perm(vl{3, 1, 0, 2, 1});     // {3, 1, 0, 5, 4, 2}

vl average(vl& f1, vl& f2) {
    ll n = len(f1);
    vl f(n);
    ll r = 0;
    rep(i, n) {
        ll p = n - i;
        ll val = f1[i] + f2[i] + r * (p + 1);
        r = val % 2;
        val /= 2;
        f[i] = val % (p + 1);
        ll q = val / (p + 1);
        ll i2 = i - 1;
        while(q) {
            q += f[i2];
            ll p2 = n - i2;
            f[i2] = q % (p2 + 1);
            q = q / (p2 + 1);
            i2--;
        }
        // debug(f, r);
    }
    return f;
}

int main() {
    cin.tie(nullptr); cout << fixed << setprecision(10);

    // vl a = {1,0,2,1};
    // vl b = {2,1,2,1};
    // vl c = average(a, b);
    // debug(fact2dec(a), fact2dec(b), fact2dec(c));
    // return 0;

    ll n;
    cin >> n;
    vl left(n);
    iota(all(left), 0);
    auto right(left);
    reverse(all(right));
    
    left = perm2fact(left);
    right = perm2fact(right);
    right.back()++;

    auto respond = [&](vl& fact, string s) -> void {
        vl perm = fact2perm(fact) + 1;
        cout << s;
        print(perm);
        cout << flush;
    };

    ll ret;
    while(1) {
        vl mid = average(left, right);

        if (mid == left) break;
        respond(mid, "? ");
        cin >> ret;
        if (ret == -1) return 0;
        else if (ret == 1) left = mid;
        else right = mid;
    }
    respond(left, "! ");
}





/*********       P A I R       **********/
template<class T, class U> inline pair<T, U>& operator+=(pair<T, U>& a, const pair<T, U> b) {a.fi += b.fi; a.se += b.se; return a;}
template<class T, class U> inline pair<T, U>& operator-=(pair<T, U>& a, const pair<T, U> b) {a.fi -= b.fi; a.se -= b.se; return a;}
template<class T, class U> inline pair<T, U>& operator*=(pair<T, U>& a, const pair<T, U> b) {a.fi *= b.fi; a.se *= b.se; return a;}
template<class T, class U> inline pair<T, U>& operator/=(pair<T, U>& a, const pair<T, U> b) {a.fi /= b.fi; a.se /= b.se; return a;}
template<class T, class U> inline pair<T, U>& operator%=(pair<T, U>& a, const pair<T, U> b) {a.fi %= b.fi; a.se %= b.se; return a;}
template<class T, class U, class V> inline pair<T, U>& operator+=(pair<T, U>& a, const V b) {a.fi += b; a.se += b; return a;}
template<class T, class U, class V> inline pair<T, U>& operator-=(pair<T, U>& a, const V b) {a.fi -= b; a.se -= b; return a;}
template<class T, class U, class V> inline pair<T, U>& operator*=(pair<T, U>& a, const V b) {a.fi *= b; a.se *= b; return a;}
template<class T, class U, class V> inline pair<T, U>& operator/=(pair<T, U>& a, const V b) {a.fi /= b; a.se /= b; return a;}
template<class T, class U, class V> inline pair<T, U>& operator%=(pair<T, U>& a, const V b) {a.fi %= b; a.se %= b; return a;}
template<class T, class U, class V> inline pair<T, U> operator+(pair<T, U> a, const V& b) {a += b; return a;}
template<class T, class U, class V> inline pair<T, U> operator-(pair<T, U> a, const V& b) {a -= b; return a;}
template<class T, class U, class V> inline pair<T, U> operator*(pair<T, U> a, const V& b) {a *= b; return a;}
template<class T, class U, class V> inline pair<T, U> operator/(pair<T, U> a, const V& b) {a /= b; return a;}
template<class T, class U, class V> inline pair<T, U> operator%(pair<T, U> a, const V& b) {a %= b; return a;}
template<class T, class U> inline pair<T, U> operator+(pair<T, U> a) {return a;}
template<class T, class U> inline pair<T, U> operator-(pair<T, U> a) {return a * (-1);}
template<class T, class U> istream& operator >>(istream& stream, pair<T, U>& a) {stream >> a.fi >> a.se; return stream;}
template<class T, class U> ostream& operator <<(ostream &stream, const pair<T, U>& a) { stream << a.fi << " " << a.se; return stream; }
/*********       V E C T O R      **********/
template<class T> inline vector<T>& operator+=(vector<T>& a, const vector<T> b) {assert(a.size() == b.size()); rep(i, 0, a.size()) a[i] += b[i]; return a;}
template<class T> inline vector<T>& operator-=(vector<T>& a, const vector<T> b) {assert(a.size() == b.size()); rep(i, 0, a.size()) a[i] -= b[i]; return a;}
template<class T> inline vector<T>& operator*=(vector<T>& a, const vector<T> b) {assert(a.size() == b.size()); rep(i, 0, a.size()) a[i] *= b[i]; return a;}
template<class T> inline vector<T>& operator/=(vector<T>& a, const vector<T> b) {assert(a.size() == b.size()); rep(i, 0, a.size()) a[i] /= b[i]; return a;}
template<class T> inline vector<T>& operator%=(vector<T>& a, const vector<T> b) {assert(a.size() == b.size()); rep(i, 0, a.size()) a[i] %= b[i]; return a;}
template<class T, class U> inline vector<T>& operator+=(vector<T>& a, const U b) {fore(e, a) e += b; return a;}
template<class T, class U> inline vector<T>& operator-=(vector<T>& a, const U b) {fore(e, a) e -= b; return a;}
template<class T, class U> inline vector<T>& operator*=(vector<T>& a, const U b) {fore(e, a) e *= b; return a;}
template<class T, class U> inline vector<T>& operator/=(vector<T>& a, const U b) {fore(e, a) e /= b; return a;}
template<class T, class U> inline vector<T>& operator%=(vector<T>& a, const U b) {fore(e, a) e %= b; return a;}
template<class T, class U> inline vector<T> operator+(vector<T> a, const U& b) {a += b; return a;}
template<class T, class U> inline vector<T> operator-(vector<T> a, const U& b) {a -= b; return a;}
template<class T, class U> inline vector<T> operator*(vector<T> a, const U& b) {a *= b; return a;}
template<class T, class U> inline vector<T> operator/(vector<T> a, const U& b) {a /= b; return a;}
template<class T, class U> inline vector<T> operator%(vector<T> a, const U& b) {a %= b; return a;}
template<class T> inline vector<T> operator+(vector<T> a) {return a;}
template<class T> inline vector<T> operator-(vector<T> a) {return a * (-1);}
template<class T> istream& operator >>(istream& stream, vector<T>& a) {fore(e, a) stream >> e; return stream;}
template<class T> ostream& operator <<(ostream& stream, const vector<T>& v) {if(v.size()){stream << v[0]; rep(i, 1, v.size()) cout << " " << v[i];} return stream;}
template<class T> ostream& operator <<(ostream& stream, const vector<vector<T>>& vv) {if(vv.size()){stream << vv[0]; rep(i, 1, vv.size()) cout << '\n' << vv[i];} return stream;}
/*********        S E T        **********/
template<class T> istream& operator >>(istream& stream, set<T>& st) {T e; stream >> e; st.insert(e); return stream;}
template<class T> ostream& operator <<(ostream& stream, const set<T>& st) {if(st.size()){auto it=st.begin(); stream << *it++; for(; it!=st.end(); it++) cout << " " << *it;} return stream;}
/*********   M U L T I S E T   **********/
template<class T> istream& operator >>(istream& stream, multiset<T>& st) {T e; stream >> e; st.insert(e); return stream;}
template<class T> ostream& operator <<(ostream& stream, const multiset<T>& st) {if(st.size()){auto it=st.begin(); stream << *it++; for(; it!=st.end(); it++) cout << " " << *it;} return stream;}
/*********       P R I N T       **********/
template<class T> inline void print(const T& e) {cout << e << '\n';}
template<class H, class... T> inline void print(const H& h, const T&... t) {cout << h << ' '; print(t...);}
template<class... T> inline void End(const T&... t) {print(t...); exit(0);}
/*********       D E B U G       **********/
void dbg_(const long long& e) {if (e == INF) cout << "INF"; else if (e == -INF) cout << "-INF"; else cout << e;}
template<class T> void dbg_(const T& e) {cout << e;}
template<class T, class U> void dbg_(const pair<T, U>& p) {cout << '('; dbg_(p.first); cout << ' '; dbg_(p.second); cout << ')';}
template<class T1, class T2, class T3> void dbg_(const trio<T1, T2, T3>& t) {cout << '('; dbg_(t.first); cout << ' '; dbg_(t.second); cout << ' '; dbg_(t.third); cout << ')';}
template<class T> void debug_(const T& e) {dbg_(e); cout << '\n';}
template<class T> void debug_(const vector<T>& v) {if (v.size()){auto it=v.begin(); dbg_(*it++); for(; it!=v.end(); ++it){cout << ' '; dbg_(*it);}} cout << '\n';}
template<class T> void debug_(const vector<vector<T>>& vv) {cout << '\n'; ll cnt=0; for(auto&& v : vv){cout << cnt++ << ": "; debug_(v);}}
template<class T, class U> void debug_(const map<T, U>& mp) {if (mp.size()) {auto it = mp.begin(); dbg_(*it++); for(; it != mp.end(); ++it) {cout << ' '; dbg_(*it);}} cout << '\n';}
template<class T, class U> void debug_(const vector<map<T, U>>& vm){cout << '\n'; ll cnt=0; for(auto&& mp : vm){cout << cnt++ << ": "; debug_(mp);}}
template<class T> void debug_(const set<T>& st) {if(st.size()){auto it=st.begin(); dbg_(*it++); for(; it!=st.end(); ++it) {cout << ' '; dbg_(*it);}}cout << '\n';}
template<class T> void debug_(const multiset<T>& st) {if(st.size()) {auto it=st.begin(); dbg_(*it++); for(; it != st.end(); ++it) {cout << ' '; dbg_(*it);}} cout << '\n';}
template<class T> void debug_(const vector<set<T>>& vs) {cout << '\n'; ll cnt=0; for(auto&& st : vs){cout << cnt++ << ": "; debug_(st);}}
template<class T> void debug_(const vector<multiset<T>>& vs) {cout << '\n'; ll cnt=0;for(auto&& st : vs){cout << cnt++ << ": "; debug_(st);}}
template<class H, class... T> void debug_(const H& h, const T&... t) {dbg_(h); cout << ", "; debug_(t...);}

yukicoder

結果

テストケース

ソースコード