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

提出ソース

結果

問題	No.2577 Simple Permutation Guess
ユーザー	noya2
提出日時	2023-12-07 18:53:15
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	209 ms / 2,000 ms
コード長	10,143 bytes
コンパイル時間	3,465 ms
コンパイル使用メモリ	258,136 KB
実行使用メモリ	24,012 KB
平均クエリ数	248.84
最終ジャッジ日時	2023-12-07 18:53:35
合計ジャッジ時間	19,747 ms
ジャッジサーバーID （参考情報）	judge13 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	29 ms 24,000 KB
testcase_01	AC	165 ms 24,000 KB
testcase_02	AC	57 ms 24,000 KB
testcase_03	AC	26 ms 24,000 KB
testcase_04	AC	76 ms 24,000 KB
testcase_05	AC	88 ms 24,000 KB
testcase_06	AC	205 ms 24,000 KB
testcase_07	AC	207 ms 24,000 KB
testcase_08	AC	207 ms 24,000 KB
testcase_09	AC	209 ms 24,000 KB
testcase_10	AC	204 ms 24,000 KB
testcase_11	AC	27 ms 24,000 KB
testcase_12	AC	26 ms 24,000 KB
testcase_13	AC	28 ms 24,000 KB
testcase_14	AC	28 ms 24,000 KB
testcase_15	AC	27 ms 24,000 KB
testcase_16	AC	26 ms 24,000 KB
testcase_17	AC	26 ms 24,000 KB
testcase_18	AC	26 ms 24,000 KB
testcase_19	AC	25 ms 24,000 KB
testcase_20	AC	26 ms 24,000 KB
testcase_21	AC	26 ms 24,000 KB
testcase_22	AC	25 ms 24,012 KB
testcase_23	AC	26 ms 24,012 KB
testcase_24	AC	26 ms 24,012 KB
testcase_25	AC	25 ms 24,012 KB
testcase_26	AC	26 ms 24,012 KB
testcase_27	AC	27 ms 24,012 KB
testcase_28	AC	26 ms 24,012 KB
testcase_29	AC	26 ms 24,012 KB
testcase_30	AC	26 ms 24,012 KB
testcase_31	AC	26 ms 24,000 KB
testcase_32	AC	26 ms 24,000 KB
testcase_33	AC	25 ms 24,000 KB
testcase_34	AC	25 ms 24,000 KB
testcase_35	AC	26 ms 24,000 KB
testcase_36	AC	25 ms 24,000 KB
testcase_37	AC	25 ms 24,000 KB
testcase_38	AC	25 ms 24,000 KB
testcase_39	AC	25 ms 24,000 KB
testcase_40	AC	25 ms 24,000 KB
testcase_41	AC	25 ms 24,000 KB
testcase_42	AC	25 ms 24,000 KB
testcase_43	AC	26 ms 24,000 KB
testcase_44	AC	25 ms 24,000 KB
testcase_45	AC	25 ms 24,000 KB
testcase_46	AC	25 ms 24,000 KB
testcase_47	AC	25 ms 24,000 KB
testcase_48	AC	25 ms 24,000 KB
testcase_49	AC	26 ms 24,000 KB
testcase_50	AC	25 ms 24,000 KB
testcase_51	AC	25 ms 24,000 KB
testcase_52	AC	25 ms 24,000 KB
testcase_53	AC	25 ms 24,000 KB
testcase_54	AC	25 ms 24,000 KB
testcase_55	AC	25 ms 24,000 KB
testcase_56	AC	26 ms 24,000 KB
testcase_57	AC	25 ms 24,000 KB
testcase_58	AC	26 ms 24,000 KB
testcase_59	AC	26 ms 24,000 KB
testcase_60	AC	25 ms 24,000 KB
testcase_61	AC	25 ms 24,000 KB
testcase_62	AC	25 ms 24,000 KB
testcase_63	AC	26 ms 24,000 KB
testcase_64	AC	25 ms 24,012 KB
testcase_65	AC	25 ms 24,012 KB
testcase_66	AC	25 ms 24,012 KB
testcase_67	AC	25 ms 24,012 KB
testcase_68	AC	25 ms 24,012 KB
testcase_69	AC	26 ms 24,012 KB
testcase_70	AC	25 ms 24,012 KB
testcase_71	AC	25 ms 24,012 KB
testcase_72	AC	25 ms 24,012 KB
testcase_73	AC	25 ms 24,000 KB
testcase_74	AC	27 ms 24,000 KB
testcase_75	AC	28 ms 24,000 KB
testcase_76	AC	28 ms 24,000 KB
testcase_77	AC	28 ms 24,000 KB
testcase_78	AC	28 ms 24,000 KB
testcase_79	AC	28 ms 24,000 KB
testcase_80	AC	28 ms 24,000 KB
testcase_81	AC	28 ms 24,000 KB
testcase_82	AC	29 ms 24,000 KB
testcase_83	AC	27 ms 24,000 KB
testcase_84	AC	28 ms 24,000 KB
testcase_85	AC	28 ms 24,000 KB
testcase_86	AC	28 ms 24,000 KB
testcase_87	AC	28 ms 24,012 KB
testcase_88	AC	28 ms 24,012 KB
testcase_89	AC	29 ms 24,012 KB
testcase_90	AC	27 ms 24,012 KB
testcase_91	AC	28 ms 24,012 KB
testcase_92	AC	167 ms 24,012 KB
testcase_93	AC	152 ms 24,012 KB
testcase_94	AC	145 ms 24,012 KB
testcase_95	AC	195 ms 24,012 KB
testcase_96	AC	195 ms 24,012 KB
testcase_97	AC	185 ms 24,012 KB
testcase_98	AC	182 ms 24,012 KB
testcase_99	AC	188 ms 24,012 KB
testcase_100	AC	151 ms 24,012 KB
testcase_101	AC	184 ms 24,012 KB
evil_1_rnd_1.txt	AC	375 ms 24,012 KB
evil_1_rnd_2.txt	AC	374 ms 24,012 KB
evil_2_big_1.txt	AC	490 ms 24,012 KB
evil_2_big_2.txt	AC	463 ms 24,012 KB
evil_2_big_3.txt	AC	468 ms 24,012 KB
evil_3_sorted_1.txt	AC	267 ms 24,012 KB
evil_4_sorted_rev_1.txt	AC	210 ms 24,012 KB
evil_4_sorted_rev_2.txt	AC	294 ms 24,012 KB
evil_400_sorted.txt	AC	444 ms 24,012 KB
evil_400_sorted_rev.txt	AC	449 ms 24,012 KB

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

ソースコード

raw source code

#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 1 "/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 << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),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(vector<T> &v){
    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/data_structure/segment_tree.hpp"

namespace noya2{

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = 0;
        size = 1;
        while (size < _n) size <<= 1, log++;

        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/fenwick_tree.hpp"

#line 4 "/Users/noya2/Desktop/Noya2_library/data_structure/fenwick_tree.hpp"

namespace noya2{

template <class T> struct fenwick_tree {
  public:
    fenwick_tree() : _n(0) {}
    explicit fenwick_tree(int n_) : _n(n_), data(n_) {}

    void add(int p, T x) {
        assert(0 <= p && p < _n);
        p++;
        while (p <= _n) {
            data[p - 1] += x;
            p += p & -p;
        }
    }

    T sum(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        return sum(r) - sum(l);
    }

  private:
    int _n;
    vector<T> data;

    T sum(int r) {
        T s = 0;
        while (r > 0) {
            s += data[r - 1];
            r -= r & -r;
        }
        return s;
    }
};

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

namespace fact_base {

const int mx = 402;
using ar = array<int,mx>;
void norm(ar &a){
    rep(i,mx-1){
        a[i+1] += a[i] / (i+1);
        a[i] %= i+1;
    }
}
ar plus_ar(ar a, ar b){
    rep(i,mx) a[i] += b[i];
    norm(a);
    return a;
}
ar div_2(ar a){
    ar b = {};
    repp(i,2,mx){
        if (a[i] % 2 == 1){
            if (i % 2 == 1){
                b[i-1] += i/2;
                b[i-2] += i/2;
            }
            else {
                b[i-1] += i/2;
            }
        }
        b[i] += a[i]/2;
    }
    norm(b);
    return b;
}
const ar one = {0,1};
bool diff_1(const ar &a, const ar &b){
    // a + 1 == b
    return plus_ar(a,one) == b;
}

ar perm_to_num(vector<int> p){
    int n = p.size();
    fenwick_tree<int> fen(n);
    rep(i,n) fen.add(i,1);
    ar res = {};
    rep(i,n){
        res[n-1-i] = fen.sum(0,p[i]);
        fen.add(p[i],-1);
    }
    return res;
}

int op(int a, int b){
    return a + b;
}
int e(){
    return 0;
}

vector<int> num_to_perm(int n, ar p){
    segtree<int,op,e> seg([&]{
        vector<int> a(n,1);
        return a;
    }());
    vector<int> res(n);
    reb(i,n){
        auto f = [&](int x){
            return x < p[i]+1;
        };
        res[n-1-i] = seg.max_right(0,f);
        seg.set(res[n-1-i],0);
    }
    return res;
}

} // namespace fact_base

bool LOCAL = false;

void solve(){
    int n; in(n);
    vector<int> judge(n); if (LOCAL) in(judge);
    auto ask = [&](vector<int> a){
        rep(i,n) a[i]++;
        cout << "? " << a << endl;
        if (LOCAL){
            return (a <= judge ? 1 : 0);
        }
        else {
            int ret; in(ret);
            return ret;
        }
    };
    auto say = [&](vector<int> a){
        rep(i,n) a[i]++;
        cout << "! " << a << endl;
        if (LOCAL){
            assert(a == judge);
        }
    };
    using namespace fact_base;
    ar le = {}, ri = {}; ri[n] = 1;
    while (!diff_1(le,ri)){
        ar md = div_2(plus_ar(le,ri));
        if (ask(num_to_perm(n,md)) == 1) le = md;
        else ri = md;
        // assert(perm_to_num(num_to_perm(n,md)) == md);
    }
    say(num_to_perm(n,le));
}

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

yukicoder

結果

テストケース

ソースコード