結果

問題 No.567 コンプリート
コンテスト
ユーザー sten_san
提出日時 2023-05-02 09:31:51
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 19 ms / 2,000 ms
コード長 3,926 bytes
コンパイル時間 1,789 ms
コンパイル使用メモリ 203,848 KB
最終ジャッジ日時 2025-02-12 16:34:10
ジャッジサーバーID
（参考情報） 		judge3 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 12
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

constexpr auto lim = 6;

using tmat = array<array<double, 1 << lim>, 1 << lim>;
using vmat = array<array<double, 1>, 1 << lim>;

template <typename X, typename Y>
using mmat = array<array<double, tuple_size<typename Y::value_type>::value>, tuple_size<X>::value>;

constexpr tmat tstep = []() {
    tmat mat = {};

    for (int i = 0; i < (1 << lim); ++i) {
        for (int j = 0; j < lim; ++j) {
            if (i & (1 << j)) {
                ++mat[i][i]; mat[i][i ^ (1 << j)] = 1;
            }
        }
    }

    for (auto &_ : mat) {
        for (auto &e : _) {
            e /= 6;
        }
    }

    return mat;
}();

int main() {
    int n; cin >> n;

    auto mmul = [&](auto x, auto y) {
        mmat<decltype(x), decltype(y)> m = {};
        for (int i = 0; i < size(x); ++i) {
            for (int j = 0; j < size(y[0]); ++j) {
                for (int k = 0; k < size(x[0]); ++k) {
                    m[i][j] += x[i][k] * y[k][j];
                }
            }
        }
        return m;
    };

    auto mpow = [&](auto init, auto mat, int n) {
        auto acc = init;
        while (0 < n) {
            if (n & 1) {
                acc = mmul(acc, mat);
            }
            mat = mmul(mat, mat);
            n >>= 1;
        }
        return acc;
    };

    auto trans = mpow(tstep, tstep, n - 1);

    vmat v = {}; v[0][0] = 1;

    cout << fixed << setprecision(15) << mmul(trans, v)[(1 << lim) - 1][0] << endl;
}
0