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

提出ソース

結果

問題	No.2577 Simple Permutation Guess
ユーザー	sgfc
提出日時	2023-12-16 00:02:30
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	146 ms / 2,000 ms
コード長	5,454 bytes
コンパイル時間	5,511 ms
コンパイル使用メモリ	318,488 KB
実行使用メモリ	25,476 KB
平均クエリ数	251.88
最終ジャッジ日時	2024-09-27 06:43:11
合計ジャッジ時間	18,773 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	27 ms 24,812 KB
testcase_01	AC	119 ms 24,556 KB
testcase_02	AC	47 ms 24,824 KB
testcase_03	AC	25 ms 24,940 KB
testcase_04	AC	60 ms 24,940 KB
testcase_05	AC	69 ms 25,184 KB
testcase_06	AC	145 ms 25,196 KB
testcase_07	AC	144 ms 24,940 KB
testcase_08	AC	145 ms 25,452 KB
testcase_09	AC	145 ms 24,812 KB
testcase_10	AC	146 ms 24,812 KB
testcase_11	AC	24 ms 24,940 KB
testcase_12	AC	24 ms 24,812 KB
testcase_13	AC	26 ms 24,812 KB
testcase_14	AC	26 ms 24,940 KB
testcase_15	AC	24 ms 25,196 KB
testcase_16	AC	23 ms 24,812 KB
testcase_17	AC	24 ms 25,196 KB
testcase_18	AC	24 ms 24,556 KB
testcase_19	AC	24 ms 25,452 KB
testcase_20	AC	24 ms 24,812 KB
testcase_21	AC	26 ms 24,812 KB
testcase_22	AC	26 ms 24,580 KB
testcase_23	AC	24 ms 24,824 KB
testcase_24	AC	26 ms 25,220 KB
testcase_25	AC	26 ms 24,964 KB
testcase_26	AC	24 ms 25,220 KB
testcase_27	AC	24 ms 25,220 KB
testcase_28	AC	24 ms 24,836 KB
testcase_29	AC	24 ms 24,836 KB
testcase_30	AC	24 ms 25,220 KB
testcase_31	AC	24 ms 24,940 KB
testcase_32	AC	24 ms 24,556 KB
testcase_33	AC	24 ms 24,940 KB
testcase_34	AC	24 ms 24,940 KB
testcase_35	AC	24 ms 24,812 KB
testcase_36	AC	24 ms 24,812 KB
testcase_37	AC	24 ms 25,220 KB
testcase_38	AC	24 ms 24,836 KB
testcase_39	AC	24 ms 24,836 KB
testcase_40	AC	25 ms 25,220 KB
testcase_41	AC	24 ms 24,836 KB
testcase_42	AC	23 ms 25,220 KB
testcase_43	AC	24 ms 24,964 KB
testcase_44	AC	24 ms 24,964 KB
testcase_45	AC	25 ms 25,220 KB
testcase_46	AC	24 ms 25,220 KB
testcase_47	AC	24 ms 24,836 KB
testcase_48	AC	24 ms 25,220 KB
testcase_49	AC	24 ms 25,220 KB
testcase_50	AC	25 ms 25,220 KB
testcase_51	AC	24 ms 24,580 KB
testcase_52	AC	24 ms 24,580 KB
testcase_53	AC	24 ms 25,220 KB
testcase_54	AC	24 ms 24,580 KB
testcase_55	AC	24 ms 24,580 KB
testcase_56	AC	24 ms 25,220 KB
testcase_57	AC	24 ms 25,220 KB
testcase_58	AC	24 ms 24,580 KB
testcase_59	AC	25 ms 24,580 KB
testcase_60	AC	24 ms 25,220 KB
testcase_61	AC	24 ms 25,220 KB
testcase_62	AC	25 ms 25,460 KB
testcase_63	AC	24 ms 24,964 KB
testcase_64	AC	24 ms 25,220 KB
testcase_65	AC	24 ms 24,964 KB
testcase_66	AC	24 ms 25,220 KB
testcase_67	AC	24 ms 24,964 KB
testcase_68	AC	24 ms 24,836 KB
testcase_69	AC	24 ms 25,476 KB
testcase_70	AC	24 ms 24,836 KB
testcase_71	AC	24 ms 24,964 KB
testcase_72	AC	24 ms 24,580 KB
testcase_73	AC	24 ms 24,940 KB
testcase_74	AC	26 ms 24,812 KB
testcase_75	AC	26 ms 25,196 KB
testcase_76	AC	26 ms 25,196 KB
testcase_77	AC	26 ms 24,940 KB
testcase_78	AC	26 ms 24,556 KB
testcase_79	AC	27 ms 24,556 KB
testcase_80	AC	28 ms 25,436 KB
testcase_81	AC	27 ms 24,556 KB
testcase_82	AC	26 ms 24,656 KB
testcase_83	AC	27 ms 25,196 KB
testcase_84	AC	26 ms 24,940 KB
testcase_85	AC	26 ms 24,556 KB
testcase_86	AC	26 ms 24,812 KB
testcase_87	AC	27 ms 24,812 KB
testcase_88	AC	26 ms 24,812 KB
testcase_89	AC	27 ms 24,556 KB
testcase_90	AC	26 ms 25,052 KB
testcase_91	AC	26 ms 24,812 KB
testcase_92	AC	124 ms 25,196 KB
testcase_93	AC	112 ms 24,812 KB
testcase_94	AC	110 ms 24,940 KB
testcase_95	AC	139 ms 24,940 KB
testcase_96	AC	142 ms 24,556 KB
testcase_97	AC	132 ms 24,812 KB
testcase_98	AC	130 ms 24,556 KB
testcase_99	AC	137 ms 24,812 KB
testcase_100	AC	111 ms 25,196 KB
testcase_101	AC	131 ms 24,812 KB
evil_1_rnd_1.txt	AC	253 ms 24,812 KB
evil_1_rnd_2.txt	AC	258 ms 24,940 KB
evil_2_big_1.txt	AC	311 ms 24,940 KB
evil_2_big_2.txt	AC	315 ms 24,812 KB
evil_2_big_3.txt	AC	313 ms 25,196 KB
evil_3_sorted_1.txt	AC	177 ms 24,952 KB
evil_4_sorted_rev_1.txt	AC	157 ms 24,836 KB
evil_4_sorted_rev_2.txt	AC	216 ms 24,952 KB
evil_400_sorted.txt	AC	290 ms 24,952 KB
evil_400_sorted_rev.txt	AC	327 ms 25,232 KB

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

ソースコード

raw source code

#include "bits/stdc++.h"

#include <stdio.h>
#include <math.h>

#include "atcoder/all"
#include <float.h>

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using vd = vector<double>;
using pl = pair<ll, ll>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;

void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }
bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }

//[1,2,...,s]の順列の並び変えたもののうち、辞書順でn(0-index)番目の順列を求める
vector<long long> get_n_perm(long long s, long long n) {
    vector<long long> a(s);
    for (int i = 0; i < s; i++) { a[i] = n % (i + 1); n /= (i + 1); }

    vector<long long> ret(s);
    vector<int> init(s, 1);
    atcoder::segtree<int, [](int a, int b) {return a + b; }, []() {return 0; } > seg(init);
    for (int i = 0; i < s; i++) {
        int r = seg.max_right(0, [&](int x) { return x <= a[s - i - 1]; });
        ret[i] = r + 1;
        seg.set(r, 0);
    }
    return ret;
}

//二分探索でf(t)を満たす整数tを返す
//ng < ok ならtは最小値 ng > ok ならtは最大値
template <class F>
ll bs(ll ng, ll ok, F f) {
    while (abs(ok - ng) > 1) {
        ll mid = (ok + ng) / 2;

        if (f(mid)) ok = mid;
        else ng = mid;
    }
    return ok;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << std::fixed << std::setprecision(10);

    ll n;
    cin >> n;

    if (n < 7) {
        ll mx = 1;
        REP(i, n) mx *= (i + 1);

        ll ans = bs(mx, 0, [&](ll x) {
            cout << "? ";
            ov(get_n_perm(n, x));
            cout << endl;

            ll ret;
            cin >> ret;

            if (ret == -1) exit(0);
            return ret == 1;
        });

        cout << "! ";
        ov(get_n_perm(n, ans));
        cout << endl;
    }
    else {
        vl no(n); iota(begin(no), end(no), 1);
        vl ans(n);
        REP(i, n - 1) {
            ll ok = 0; ll ng = no.size();
            while (abs(ok - ng) > 1) {
                ll mid = (ok + ng) / 2;

                cout << "?";
                REP(t, i) cout << " " << ans[t];
                cout << " " << no[mid];
                REP(t, no.size()) if (t != mid) cout << " " << no[t];
                cout << endl;

                ll res;
                cin >> res;
                if (res == -1) exit(-1);

                if (res == 1) ok = mid;
                else ng = mid;
            }
            ans[i] = no[ok];
            vl no2(no.size() - 1);
            REP(i, no.size()) if (i != ok) no2[i - (i > ok)] = no[i];
            no = move(no2);
        }
        ans[n - 1] = no[0];

        cout << "! ";
        ov(ans);
        cout << endl;
    }

    return 0;
}

yukicoder

結果

テストケース

ソースコード