#936682 (C++17) No.2577 Simple Permutation Guess

提出ソース

結果

問題	No.2577 Simple Permutation Guess
ユーザー	siro53
提出日時	2023-12-05 23:51:16
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	147 ms / 2,000 ms
コード長	12,130 bytes
コンパイル時間	2,725 ms
コンパイル使用メモリ	214,040 KB
実行使用メモリ	25,580 KB
平均クエリ数	251.88
最終ジャッジ日時	2024-09-27 00:38:20
合計ジャッジ時間	15,905 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	28 ms 24,812 KB
testcase_01	AC	118 ms 25,196 KB
testcase_02	AC	48 ms 25,580 KB
testcase_03	AC	26 ms 25,196 KB
testcase_04	AC	62 ms 25,196 KB
testcase_05	AC	70 ms 25,184 KB
testcase_06	AC	145 ms 25,196 KB
testcase_07	AC	144 ms 24,556 KB
testcase_08	AC	144 ms 24,812 KB
testcase_09	AC	146 ms 24,812 KB
testcase_10	AC	147 ms 24,556 KB
testcase_11	AC	26 ms 24,556 KB
testcase_12	AC	24 ms 25,052 KB
testcase_13	AC	27 ms 24,928 KB
testcase_14	AC	26 ms 24,812 KB
testcase_15	AC	24 ms 24,812 KB
testcase_16	AC	24 ms 24,812 KB
testcase_17	AC	24 ms 24,940 KB
testcase_18	AC	27 ms 24,812 KB
testcase_19	AC	27 ms 24,940 KB
testcase_20	AC	26 ms 25,196 KB
testcase_21	AC	25 ms 25,196 KB
testcase_22	AC	25 ms 25,220 KB
testcase_23	AC	24 ms 24,580 KB
testcase_24	AC	25 ms 25,220 KB
testcase_25	AC	25 ms 24,964 KB
testcase_26	AC	25 ms 25,220 KB
testcase_27	AC	24 ms 25,220 KB
testcase_28	AC	24 ms 24,836 KB
testcase_29	AC	26 ms 24,964 KB
testcase_30	AC	25 ms 24,964 KB
testcase_31	AC	25 ms 24,812 KB
testcase_32	AC	24 ms 24,556 KB
testcase_33	AC	24 ms 24,940 KB
testcase_34	AC	26 ms 25,196 KB
testcase_35	AC	25 ms 25,196 KB
testcase_36	AC	25 ms 25,196 KB
testcase_37	AC	25 ms 24,836 KB
testcase_38	AC	24 ms 24,836 KB
testcase_39	AC	24 ms 25,220 KB
testcase_40	AC	25 ms 25,220 KB
testcase_41	AC	25 ms 24,836 KB
testcase_42	AC	24 ms 25,220 KB
testcase_43	AC	24 ms 24,580 KB
testcase_44	AC	25 ms 24,836 KB
testcase_45	AC	24 ms 24,836 KB
testcase_46	AC	24 ms 24,580 KB
testcase_47	AC	25 ms 24,836 KB
testcase_48	AC	25 ms 24,580 KB
testcase_49	AC	24 ms 24,964 KB
testcase_50	AC	25 ms 24,964 KB
testcase_51	AC	25 ms 24,836 KB
testcase_52	AC	24 ms 24,580 KB
testcase_53	AC	24 ms 24,964 KB
testcase_54	AC	25 ms 24,836 KB
testcase_55	AC	24 ms 25,220 KB
testcase_56	AC	24 ms 24,836 KB
testcase_57	AC	25 ms 25,220 KB
testcase_58	AC	25 ms 25,220 KB
testcase_59	AC	24 ms 24,452 KB
testcase_60	AC	24 ms 25,220 KB
testcase_61	AC	24 ms 24,580 KB
testcase_62	AC	24 ms 25,220 KB
testcase_63	AC	24 ms 25,220 KB
testcase_64	AC	24 ms 25,220 KB
testcase_65	AC	25 ms 25,220 KB
testcase_66	AC	25 ms 25,208 KB
testcase_67	AC	24 ms 24,836 KB
testcase_68	AC	24 ms 24,580 KB
testcase_69	AC	24 ms 24,836 KB
testcase_70	AC	25 ms 24,568 KB
testcase_71	AC	25 ms 25,220 KB
testcase_72	AC	25 ms 24,964 KB
testcase_73	AC	26 ms 25,196 KB
testcase_74	AC	27 ms 25,196 KB
testcase_75	AC	26 ms 24,812 KB
testcase_76	AC	26 ms 25,160 KB
testcase_77	AC	26 ms 25,196 KB
testcase_78	AC	27 ms 25,196 KB
testcase_79	AC	28 ms 25,196 KB
testcase_80	AC	28 ms 24,556 KB
testcase_81	AC	26 ms 25,452 KB
testcase_82	AC	27 ms 24,556 KB
testcase_83	AC	26 ms 24,940 KB
testcase_84	AC	27 ms 24,812 KB
testcase_85	AC	27 ms 24,812 KB
testcase_86	AC	26 ms 24,812 KB
testcase_87	AC	26 ms 25,196 KB
testcase_88	AC	27 ms 24,812 KB
testcase_89	AC	26 ms 24,556 KB
testcase_90	AC	26 ms 25,196 KB
testcase_91	AC	26 ms 24,812 KB
testcase_92	AC	122 ms 24,812 KB
testcase_93	AC	111 ms 24,556 KB
testcase_94	AC	105 ms 25,196 KB
testcase_95	AC	139 ms 25,196 KB
testcase_96	AC	139 ms 24,812 KB
testcase_97	AC	130 ms 25,196 KB
testcase_98	AC	131 ms 24,812 KB
testcase_99	AC	136 ms 25,196 KB
testcase_100	AC	112 ms 24,812 KB
testcase_101	AC	132 ms 24,812 KB
evil_1_rnd_1.txt	AC	249 ms 24,556 KB
evil_1_rnd_2.txt	AC	254 ms 24,556 KB
evil_2_big_1.txt	AC	307 ms 25,196 KB
evil_2_big_2.txt	AC	311 ms 24,556 KB
evil_2_big_3.txt	AC	307 ms 24,556 KB
evil_3_sorted_1.txt	AC	175 ms 25,208 KB
evil_4_sorted_rev_1.txt	AC	156 ms 24,836 KB
evil_4_sorted_rev_2.txt	AC	212 ms 24,824 KB
evil_400_sorted.txt	AC	284 ms 25,208 KB
evil_400_sorted_rev.txt	AC	322 ms 24,836 KB

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

ソースコード

raw source code

#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// input output utils
namespace siro53_io {
    // https://maspypy.github.io/library/other/io_old.hpp
    struct has_val_impl {
        template <class T>
        static auto check(T &&x) -> decltype(x.val(), std::true_type{});

        template <class T> static auto check(...) -> std::false_type;
    };

    template <class T>
    class has_val : public decltype(has_val_impl::check<T>(std::declval<T>())) {
    };

    // debug
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void dump(const T t) {
        cerr << t;
    }
    template <class T, enable_if_t<is_floating_point<T>::value, int> = 0>
    void dump(const T t) {
        cerr << t;
    }
    template <class T, typename enable_if<has_val<T>::value>::type * = nullptr>
    void dump(const T &t) {
        cerr << t.val();
    }
    void dump(__int128_t n) {
        if(n == 0) {
            cerr << '0';
            return;
        } else if(n < 0) {
            cerr << '-';
            n = -n;
        }
        string s;
        while(n > 0) {
            s += (char)('0' + n % 10);
            n /= 10;
        }
        reverse(s.begin(), s.end());
        cerr << s;
    }
    void dump(const string &s) { cerr << s; }
    void dump(const char *s) {
        int n = (int)strlen(s);
        for(int i = 0; i < n; i++) cerr << s[i];
    }
    template <class T1, class T2> void dump(const pair<T1, T2> &p) {
        cerr << '(';
        dump(p.first);
        cerr << ',';
        dump(p.second);
        cerr << ')';
    }
    template <class T> void dump(const vector<T> &v) {
        cerr << '{';
        for(int i = 0; i < (int)v.size(); i++) {
            dump(v[i]);
            if(i < (int)v.size() - 1) cerr << ',';
        }
        cerr << '}';
    }
    template <class T> void dump(const set<T> &s) {
        cerr << '{';
        for(auto it = s.begin(); it != s.end(); it++) {
            dump(*it);
            if(next(it) != s.end()) cerr << ',';
        }
        cerr << '}';
    }
    template <class Key, class Value> void dump(const map<Key, Value> &mp) {
        cerr << '{';
        for(auto it = mp.begin(); it != mp.end(); it++) {
            dump(*it);
            if(next(it) != mp.end()) cerr << ',';
        }
        cerr << '}';
    }
    template <class Key, class Value>
    void dump(const unordered_map<Key, Value> &mp) {
        cerr << '{';
        for(auto it = mp.begin(); it != mp.end(); it++) {
            dump(*it);
            if(next(it) != mp.end()) cerr << ',';
        }
        cerr << '}';
    }
    template <class T> void dump(const deque<T> &v) {
        cerr << '{';
        for(int i = 0; i < (int)v.size(); i++) {
            dump(v[i]);
            if(i < (int)v.size() - 1) cerr << ',';
        }
        cerr << '}';
    }
    template <class T> void dump(queue<T> q) {
        cerr << '{';
        while(!q.empty()) {
            dump(q.front());
            if((int)q.size() > 1) cerr << ',';
            q.pop();
        }
        cerr << '}';
    }

    void debug_print() { cerr << endl; }
    template <class Head, class... Tail>
    void debug_print(const Head &h, const Tail &...t) {
        dump(h);
        if(sizeof...(Tail)) dump(' ');
        debug_print(t...);
    }
    // print
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void print_single(const T t) {
        cout << t;
    }
    template <class T, enable_if_t<is_floating_point<T>::value, int> = 0>
    void print_single(const T t) {
        cout << t;
    }
    template <class T, typename enable_if<has_val<T>::value>::type * = nullptr>
    void print_single(const T t) {
        cout << t.val();
    }
    void print_single(__int128_t n) {
        if(n == 0) {
            cout << '0';
            return;
        } else if(n < 0) {
            cout << '-';
            n = -n;
        }
        string s;
        while(n > 0) {
            s += (char)('0' + n % 10);
            n /= 10;
        }
        reverse(s.begin(), s.end());
        cout << s;
    }
    void print_single(const string &s) { cout << s; }
    void print_single(const char *s) {
        int n = (int)strlen(s);
        for(int i = 0; i < n; i++) cout << s[i];
    }
    template <class T1, class T2> void print_single(const pair<T1, T2> &p) {
        print_single(p.first);
        cout << ' ';
        print_single(p.second);
    }
    template <class T> void print_single(const vector<T> &v) {
        for(int i = 0; i < (int)v.size(); i++) {
            print_single(v[i]);
            if(i < (int)v.size() - 1) cout << ' ';
        }
    }
    template <class T> void print_single(const set<T> &s) {
        for(auto it = s.begin(); it != s.end(); it++) {
            print_single(*it);
            if(next(it) != s.end()) cout << ' ';
        }
    }
    template <class T> void print_single(const deque<T> &v) {
        for(int i = 0; i < (int)v.size(); i++) {
            print_single(v[i]);
            if(i < (int)v.size() - 1) cout << ' ';
        }
    }
    template <class T> void print_single(queue<T> q) {
        while(!q.empty()) {
            print_single(q.front());
            if((int)q.size() > 1) cout << ' ';
            q.pop();
        }
    }

    void print() { cout << '\n'; }
    template <class Head, class... Tail>
    void print(const Head &h, const Tail &...t) {
        print_single(h);
        if(sizeof...(Tail)) print_single(' ');
        print(t...);
    }

    // input
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void input_single(T &t) {
        cin >> t;
    }
    template <class T, enable_if_t<is_floating_point<T>::value, int> = 0>
    void input_single(T &t) {
        cin >> t;
    }
    template <class T, typename enable_if<has_val<T>::value>::type * = nullptr>
    void input_single(T &t) {
        cin >> t;
    }
    void input_single(__int128_t &n) {
        string s;
        cin >> s;
        if(s == "0") {
            n = 0;
            return;
        }
        bool is_minus = false;
        if(s[0] == '-') {
            s = s.substr(1);
            is_minus = true;
        }
        n = 0;
        for(int i = 0; i < (int)s.size(); i++) n = n * 10 + (int)(s[i] - '0');
        if(is_minus) n = -n;
    }
    void input_single(string &s) { cin >> s; }
    template <class T1, class T2> void input_single(pair<T1, T2> &p) {
        input_single(p.first);
        input_single(p.second);
    }
    template <class T> void input_single(vector<T> &v) {
        for(auto &e : v) input_single(e);
    }
    void input() {}
    template <class Head, class... Tail> void input(Head &h, Tail &...t) {
        input_single(h);
        input(t...);
    }
}; // namespace siro53_io
#ifdef DEBUG
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debug_print(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
// io setup
struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;
using namespace siro53_io;
// types
using ll = long long;
using i128 = __int128_t;
// input macros
#define INT(...)                                                               \
    int __VA_ARGS__;                                                           \
    input(__VA_ARGS__)
#define LL(...)                                                                \
    ll __VA_ARGS__;                                                            \
    input(__VA_ARGS__)
#define STRING(...)                                                            \
    string __VA_ARGS__;                                                        \
    input(__VA_ARGS__)
#define CHAR(...)                                                              \
    char __VA_ARGS__;                                                          \
    input(__VA_ARGS__)
#define DBL(...)                                                               \
    double __VA_ARGS__;                                                        \
    input(__VA_ARGS__)
#define LD(...)                                                                \
    long double __VA_ARGS__;                                                   \
    input(__VA_ARGS__)
#define UINT(...)                                                              \
    unsigned int __VA_ARGS__;                                                  \
    input(__VA_ARGS__)
#define ULL(...)                                                               \
    unsigned long long __VA_ARGS__;                                            \
    input(__VA_ARGS__)
#define VEC(name, type, len)                                                   \
    vector<type> name(len);                                                    \
    input(name);
#define VEC2(name, type, len1, len2)                                           \
    vector name(len1, vector<type>(len2));                                     \
    input(name);
// other macros
// https://trap.jp/post/1224/
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < int(n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define UNIQUE(v)                                                              \
    sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end()), v.shrink_to_fit()
#define REV(v) reverse(ALL(v))
#define SZ(v) ((int)(v).size())
#define MIN(v) (*min_element(ALL(v)))
#define MAX(v) (*max_element(ALL(v)))
// util const
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// util functions
void Case(int i) { cout << "Case #" << i << ": "; }
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
template <class T> inline bool chmax(T &a, T b) {
    return (a < b ? a = b, true : false);
}
template <class T> inline bool chmin(T &a, T b) {
    return (a > b ? a = b, true : false);
}
template <class T, size_t dim>
auto make_vector_impl(vector<size_t> &sizes, const T &e) {
    if constexpr(dim == 1) {
        return vector(sizes[0], e);
    } else {
        size_t n = sizes[dim - 1];
        sizes.pop_back();
        return vector(n, make_vector_impl<T, dim - 1>(sizes, e));
    }
}
template <class T, size_t dim>
auto make_vector(const size_t (&sizes)[dim], const T &e) {
    vector<size_t> s(dim);
    for(size_t i = 0; i < dim; i++) s[i] = sizes[dim - i - 1];
    return make_vector_impl<T, dim>(s, e);
}
#pragma endregion Macros

int ask(const vector<int> &Q) {
    print('?', Q);
    cout.flush();
    INT(ret);
    assert(ret == 0 or ret == 1);
    return ret;
}
void answer(const vector<int> &Q) {
    print('!', Q);
    cout.flush();
}

void solve1(int N) {
    vector<int> cand(N), ans(N, -1);
    iota(ALL(cand), 1);
    REP(i, N) {
        vector<int> Q;
        auto check = [&](int x) {
            Q = ans;
            Q[i] = cand[x];
            for(int j = i + 1, k = 0; j < N; k++) {
                if(k == x) continue;
                Q[j++] = cand[k];
            }
            return ask(Q);
        };
        int ok = 0, ng = SZ(cand);
        while(ng - ok > 1) {
            int mid = (ok + ng) / 2;
            (check(mid) ? ok : ng) = mid;
        }
        ans[i] = cand[ok];
        cand.erase(cand.begin() + ok);
    }
    answer(ans);
}

void solve2(int N) {
    vector<vector<int>> kouho;
    vector<int> ord(N);
    iota(ALL(ord), 1);
    do {
        kouho.emplace_back(ord);
    } while(next_permutation(ALL(ord)));
    int ok = 0, ng = SZ(kouho);
    while(ng - ok > 1) {
        int mid = (ok + ng) / 2;
        (ask(kouho[mid]) ? ok : ng) = mid;
    }
    answer(kouho[ok]);
}

int main() {
    INT(N);
    if(N <= 6) solve2(N);
    else solve1(N);
}

yukicoder

結果

テストケース

ソースコード