#514456 (C++17) No.1106 🦉 何事もバランスが大事

提出ソース

結果

問題	No.1106 🦉 何事もバランスが大事
ユーザー	jell
提出日時	2020-07-19 16:14:17
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	3 ms / 2,000 ms
コード長	12,057 bytes
コンパイル時間	2,938 ms
コンパイル使用メモリ	225,452 KB
実行使用メモリ	4,384 KB
最終ジャッジ日時	2023-08-22 10:02:21
合計ジャッジ時間	7,413 ms
ジャッジサーバーID （参考情報）	judge14 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,376 KB
testcase_01	AC	2 ms 4,376 KB
testcase_02	AC	1 ms 4,380 KB
testcase_03	AC	1 ms 4,376 KB
testcase_04	AC	2 ms 4,376 KB
testcase_05	AC	2 ms 4,376 KB
testcase_06	AC	1 ms 4,380 KB
testcase_07	AC	2 ms 4,376 KB
testcase_08	AC	2 ms 4,380 KB
testcase_09	AC	1 ms 4,380 KB
testcase_10	AC	1 ms 4,376 KB
testcase_11	AC	1 ms 4,376 KB
testcase_12	AC	2 ms 4,376 KB
testcase_13	AC	2 ms 4,376 KB
testcase_14	AC	1 ms 4,380 KB
testcase_15	AC	1 ms 4,380 KB
testcase_16	AC	2 ms 4,376 KB
testcase_17	AC	2 ms 4,376 KB
testcase_18	AC	2 ms 4,380 KB
testcase_19	AC	2 ms 4,380 KB
testcase_20	AC	2 ms 4,376 KB
testcase_21	AC	2 ms 4,376 KB
testcase_22	AC	2 ms 4,380 KB
testcase_23	AC	2 ms 4,376 KB
testcase_24	AC	2 ms 4,380 KB
testcase_25	AC	2 ms 4,380 KB
testcase_26	AC	2 ms 4,376 KB
testcase_27	AC	2 ms 4,380 KB
testcase_28	AC	3 ms 4,380 KB
testcase_29	AC	2 ms 4,376 KB
testcase_30	AC	3 ms 4,376 KB
testcase_31	AC	2 ms 4,380 KB
testcase_32	AC	2 ms 4,380 KB
testcase_33	AC	2 ms 4,376 KB
testcase_34	AC	2 ms 4,376 KB
testcase_35	AC	2 ms 4,376 KB
testcase_36	AC	2 ms 4,376 KB
testcase_37	AC	2 ms 4,380 KB
testcase_38	AC	2 ms 4,376 KB
testcase_39	AC	2 ms 4,380 KB
testcase_40	AC	2 ms 4,376 KB
testcase_41	AC	2 ms 4,380 KB
testcase_42	AC	2 ms 4,376 KB
testcase_43	AC	2 ms 4,380 KB
testcase_44	AC	2 ms 4,376 KB
testcase_45	AC	2 ms 4,376 KB
testcase_46	AC	2 ms 4,376 KB
testcase_47	AC	2 ms 4,376 KB
testcase_48	AC	2 ms 4,376 KB
testcase_49	AC	2 ms 4,376 KB
testcase_50	AC	2 ms 4,376 KB
testcase_51	AC	2 ms 4,380 KB
testcase_52	AC	2 ms 4,380 KB
testcase_53	AC	2 ms 4,376 KB
testcase_54	AC	2 ms 4,376 KB
testcase_55	AC	2 ms 4,376 KB
testcase_56	AC	2 ms 4,380 KB
testcase_57	AC	2 ms 4,380 KB
testcase_58	AC	2 ms 4,380 KB
testcase_59	AC	2 ms 4,380 KB
testcase_60	AC	2 ms 4,376 KB
testcase_61	AC	2 ms 4,380 KB
testcase_62	AC	2 ms 4,380 KB
testcase_63	AC	2 ms 4,376 KB
testcase_64	AC	2 ms 4,380 KB
testcase_65	AC	2 ms 4,376 KB
testcase_66	AC	2 ms 4,376 KB
testcase_67	AC	3 ms 4,380 KB
testcase_68	AC	3 ms 4,380 KB
testcase_69	AC	2 ms 4,376 KB
testcase_70	AC	2 ms 4,384 KB
testcase_71	AC	2 ms 4,380 KB
testcase_72	AC	2 ms 4,376 KB
testcase_73	AC	2 ms 4,376 KB
testcase_74	AC	2 ms 4,376 KB
testcase_75	AC	2 ms 4,380 KB
testcase_76	AC	2 ms 4,376 KB
testcase_77	AC	2 ms 4,380 KB
testcase_78	AC	2 ms 4,376 KB
testcase_79	AC	2 ms 4,376 KB
testcase_80	AC	2 ms 4,376 KB
testcase_81	AC	2 ms 4,380 KB

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

ソースコード

raw source code

#pragma region preprocessor
#ifdef LOCAL
//*
    #define _GLIBCXX_DEBUG  // gcc
/*/
    #define _LIBCPP_DEBUG 0 // clang
//*/
    // #define __buffer_check__
#else
    #pragma GCC optimize("Ofast")
    // #define NDEBUG
#endif
#define __precision__ 15
#define __iostream_untie__ true
#include <bits/stdc++.h>
#include <ext/rope>

#ifdef LOCAL
    #include "dump.hpp"
    #define mesg(str) std::cerr << "[ " << __LINE__ << " : " << __FUNCTION__ << " ]  " << str << "\n"
#else
    #define dump(...) ((void)0)
    #define mesg(str) ((void)0)
#endif
#pragma endregion

#pragma region std-overload
namespace std
{
    // hash
    template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }
    template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };
    template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };
    template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };
    template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };
    // iostream
    template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }
    template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }
    template <class tuple_t, size_t index> struct tupleis { static istream &apply(istream &is, tuple_t &t) { tupleis<tuple_t, index - 1>::apply(is, t); return is >> get<index>(t); } };
    template <class tuple_t> struct tupleis<tuple_t, SIZE_MAX> { static istream &apply(istream &is, tuple_t &t) { return is; } };
    template <class... T> istream &operator>>(istream &is, tuple<T...> &t) { return tupleis<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is, t); }
    template <> istream &operator>>(istream &is, tuple<> &t) { return is; }
    template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };
    template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };
    template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }
    template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }
    template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>
    istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }
    template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>
    ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }
} // namespace std
#pragma endregion

#pragma region config
namespace config
{
    const auto start_time{std::chrono::system_clock::now()};
    int64_t elapsed()
    {
        using namespace std::chrono;
        const auto end_time{std::chrono::system_clock::now()};
        return duration_cast<milliseconds>(end_time - start_time).count();
    }
    __attribute__((constructor)) void setup()
    {
        using namespace std;
        if(__iostream_untie__) ios::sync_with_stdio(false), cin.tie(nullptr);
                cout << fixed << setprecision(__precision__);
        #ifdef DEBUG
                freopen("debug.out","w",stdout);
                freopen("debug.err","w",stderr);
                if(!freopen("debug.in","r",stdin))
                {
                    cerr << "error: \"./debug.in\" not found.\n";
                    exit(EXIT_FAILURE);
                }
        #endif
        #ifdef stderr_path
                freopen(stderr_path, "a", stderr);
        #endif
        #ifdef LOCAL
                cerr << fixed << setprecision(__precision__) << boolalpha << "\n----- stderr at LOCAL -----\n\n";
                atexit([]{ cerr << "\n----- Exec time : " << elapsed() << " ms -----\n\n"; });
        #endif
        #ifdef __buffer_check__
                atexit([]{ ofstream cnsl("CON"); char bufc; if(cin >> bufc) cnsl << "\n\033[1;35mwarning\033[0m: buffer not empty.\n\n"; });
        #endif
    }
} // namespace config
#pragma endregion

#pragma region utility
// lambda wrapper for recursive method.
template <class lambda_type>
class fixed_point
{
    lambda_type func;
public:
    fixed_point(lambda_type &&f) : func(std::move(f)) {}
    template <class... Args> auto operator()(Args &&... args) const { return func(*this, std::forward<Args>(args)...); }
};
// read with std::cin.
template <class T = void>
struct read
{
    typename std::remove_const<T>::type value;
    template <class... types>
    read(types... args) : value(args...) { std::cin >> value; }
    operator T() const { return value; }
};
template <>
struct read<void>
{
    template <class T>
    operator T() const { T value; std::cin >> value; return value; }
};
// substitute y for x if x > y.
template <class T> inline bool chmin(T &x, const T &y) { return x > y ? x = y, true : false; }
// substitute y for x if x < y.
template <class T> inline bool chmax(T &x, const T &y) { return x < y ? x = y, true : false; }
// binary search on discrete range.
template <class iter_type, class pred_type>
iter_type binary(iter_type __ok, iter_type __ng, pred_type pred)
{
    assert(__ok != __ng);
    std::ptrdiff_t dist(__ng - __ok);
    while(std::abs(dist) > 1)
    {
        iter_type mid(__ok + dist / 2);
        if(pred(mid)) __ok = mid, dist -= dist / 2;
        else __ng = mid, dist /= 2;
    }
    return __ok;
}
// binary search on real numbers.
template <class pred_type>
long double binary(long double __ok, long double __ng, const long double eps, pred_type pred)
{
    assert(__ok != __ng);
    while(std::abs(__ok - __ng) > eps)
    {
        long double mid{(__ok + __ng) / 2};
        (pred(mid) ? __ok : __ng) = mid;
    }
    return __ok;
}
// trinary search on discrete range.
template <class iter_type, class comp_type>
iter_type trinary(iter_type __first, iter_type __last, comp_type comp)
{
    assert(__first < __last);
    std::ptrdiff_t dist(__last - __first);
    while(dist > 2)
    {
        iter_type __left(__first + dist / 3), __right(__first + dist * 2 / 3);
        if(comp(__left, __right)) __last = __right, dist = dist * 2 / 3;
        else __first = __left, dist -= dist / 3;
    }
    if(dist > 1 && comp(next(__first), __first)) ++__first;
    return __first;
}
// trinary search on real numbers.
template <class comp_type>
long double trinary(long double __first, long double __last, const long double eps, comp_type comp)
{
    assert(__first < __last);
    while(__last - __first > eps)
    {
        long double __left{(__first * 2 + __last) / 3}, __right{(__first + __last * 2) / 3};
        if(comp(__left, __right)) __last = __right;
        else __first = __left;
    }
    return __first;
}
// size of array.
template <class A, size_t N> size_t size(A (&array)[N]) { return N; }
// be careful that val is type-sensitive.
template <class T, class A, size_t N> void init(A (&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }
#pragma endregion

#pragma region alias
using namespace std;
using i32 = int_least32_t; using i64 = int_least64_t; using u32 = uint_least32_t; using u64 = uint_least64_t;
using p32 = pair<i32, i32>; using p64 = pair<i64, i64>;
template <class T, class Comp = less<T>> using heap = priority_queue<T, vector<T>, Comp>;
template <class T> using hashset = unordered_set<T>;
template <class Key, class Value> using hashmap = unordered_map<Key, Value>;
using namespace __gnu_cxx;
#pragma endregion

#pragma region library



#pragma endregion

struct solver; template <class> void main_(); int main() { main_<solver>(); }
template <class solver> void main_()
{
    unsigned t = 1;
#ifdef LOCAL
    t = 1;
#endif
    // t = -1; // infinite loop
    // cin >> t; // case number given

    while(t--) solver();
}

struct solver
{

    solver()
    {
        i64 n=read();
        int m=0;
        {
            for(i64 x=1; x<=n; x*=5)
            {
                m++;
            }
            m++;
            for(i64 x=0,y=2; x<m; x++,y*=5)
            {
                n+=y;
            }
        }

        vector dp(4*m+1, vector(2, vector<i64>(2)));
        dp[0][0][0]=1;
        for(int i=0; i<m; i++)
        {
            int nd=n%5;
            n/=5;
            vector dq(4*m+1, vector(2, vector<i64>(2)));
            for(int j=4*i; j>=0; j--)
            {
                for(int k=4; k>=0; k--)
                {
                    if(k<nd)
                    {
                        auto &fro=dp[j][1];
                        auto &to=dq[j+k][0];
                        if(k<2)
                        {
                            to[0]+=fro[1];
                        }
                        else
                        {
                            to[1]+=fro[1];
                        }
                        if(k>2)
                        {
                            to[1]+=fro[0];
                        }
                        else
                        {
                            to[0]+=fro[0];
                        }
                    }
                    else
                    {
                        auto &fro=dp[j][1];
                        auto &to=dq[j+k][1];
                        if(k<2)
                        {
                            to[0]+=fro[1];
                        }
                        else
                        {
                            to[1]+=fro[1];
                        }
                        if(k>2)
                        {
                            to[1]+=fro[0];
                        }
                        else
                        {
                            to[0]+=fro[0];
                        }
                    }
                    if(k>nd)
                    {
                        auto &fro=dp[j][0];
                        auto &to=dq[j+k][1];
                        if(k<2)
                        {
                            to[0]+=fro[1];
                        }
                        else
                        {
                            to[1]+=fro[1];
                        }
                        if(k>2)
                        {
                            to[1]+=fro[0];
                        }
                        else
                        {
                            to[0]+=fro[0];
                        }
                    }
                    else
                    {
                        auto &fro=dp[j][0];
                        auto &to=dq[j+k][0];
                        if(k<2)
                        {
                            to[0]+=fro[1];
                        }
                        else
                        {
                            to[1]+=fro[1];
                        }
                        if(k>2)
                        {
                            to[1]+=fro[0];
                        }
                        else
                        {
                            to[0]+=fro[0];
                        }
                    }
                }
            }
            swap(dp,dq);
        }

        cout << dp[2*m][0][1] << "\n";
    }
};

yukicoder

結果

テストケース

ソースコード