#1172030 (C++23) No.3592 I Love LIS

• 問題: No.3592 I Love LIS
• ユーザー: noya2
• 提出日時: 2026-07-19 16:53:36
• 言語: C++23 (gcc 15.2.0 + boost 1.90.0)
• 結果: AC
• 実行時間: 1,328 ms / 8,000 ms
• コード長: 6,892 bytes
• コンパイル時間: 2,676 ms
• コンパイル使用メモリ: 356,712 KB
• 実行使用メモリ: 7,296 KB
• 平均クエリ数: 4591.42
• 最終ジャッジ日時: 2026-07-19 16:54:00
• 合計ジャッジ時間: 23,370 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge1_0

ファイルパターン	結果
other	AC * 36

ソースコード

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/misc/longest_increasing_subsequence.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/misc/longest_increasing_subsequence.hpp"

namespace noya2 {

template<typename T>
std::vector<int> longest_increasing_subsequence_ids(const std::vector<T> &a){
    if (a.empty()) return {};
    int n = a.size();
    const T Tinf = std::numeric_limits<T>::max();
    std::vector<T> dp(n, Tinf);
    std::vector<int> pre(n), ids(n);
    for (int i = 0; i < n; i++){
        int pos = std::lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
        dp[pos] = a[i];
        ids[pos] = i;
        pre[i] = (pos == 0 ? -1 : ids[pos-1]);
    }
    int len = std::lower_bound(dp.begin(), dp.end(), Tinf) - dp.begin();
    ids.resize(len);
    int cid = ids[len-1];
    for (int i = len-1; i >= 0; i--){
        ids[i] = cid;
        cid = pre[cid];
    }
    return ids;
}

} // namespace noya2
#line 4 "c.cpp"

// bool LOCAL = true;
bool LOCAL = false;
vector<int> jp;

void solve(){
    int n; in(n);
    if (LOCAL){
        jp.resize(n); iota(all(jp),0);
        random_device rd;
        mt19937 mt(rd());
        shuffle(all(jp),mt);
    }
    int qlim = 12000;
    auto ask = [&](vector<int> a) -> int {
        assert(qlim > 0);
        qlim--;
        if (LOCAL){
            vector<int> na(n);
            rep(i,n){
                na[i] = a[jp[i]];
            }
            return longest_increasing_subsequence_ids(na).size();
        }
        cout << "? " << a << endl;
        int x; in(x);
        assert(x >= 1);
        return x;
    };
    int p0 = [&]{
        rep(i,n){
            vector<int> a(n);
            a[i] = 1;
            if (ask(a) == 1){
                return i;
            }
        }
        abort();
    }();
    vector memo(n,vector<int>(n,-1));
    auto comp = [&](int i, int j){
        if (i == j) return false;
        if (i == p0) return true;
        if (j == p0) return false;
        if (memo[i][j] != -1){
            return memo[i][j] == 1;
        }
        vector<int> a(n);
        a[i] = 1, a[j] = 2;
        int ret = ask(a);
        memo[i][j] = int(ret == 3);
        return ret == 3;
    };
    vector<int> p(n); iota(all(p),0);
    stable_sort(all(p),comp);
    // sort(all(p),comp);
    auto ans = p;
    rep(i,n){
        ans[i]++;
    }
    cout << "! " << ans << endl;
    if (LOCAL){
        out("noya2",p);
        out("judge",jp);
        cout << flush;
        assert(p == jp);
        out("query",12000-qlim);
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}