#375333 (C++14) No.827 総神童数

提出ソース

結果

問題	No.827 総神童数
ユーザー	jell
提出日時	2019-09-03 17:19:19
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	111 ms / 2,000 ms
コード長	13,254 bytes
コンパイル時間	1,797 ms
コンパイル使用メモリ	134,392 KB
実行使用メモリ	15,772 KB
最終ジャッジ日時	2023-08-25 20:59:19
合計ジャッジ時間	7,584 ms
ジャッジサーバーID （参考情報）	judge11 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	5 ms 9,496 KB
testcase_01	AC	5 ms 9,640 KB
testcase_02	AC	5 ms 9,568 KB
testcase_03	AC	5 ms 9,568 KB
testcase_04	AC	5 ms 9,508 KB
testcase_05	AC	5 ms 9,696 KB
testcase_06	AC	5 ms 9,552 KB
testcase_07	AC	5 ms 9,548 KB
testcase_08	AC	5 ms 9,556 KB
testcase_09	AC	100 ms 15,712 KB
testcase_10	AC	35 ms 11,768 KB
testcase_11	AC	6 ms 9,672 KB
testcase_12	AC	18 ms 10,456 KB
testcase_13	AC	82 ms 14,400 KB
testcase_14	AC	8 ms 9,740 KB
testcase_15	AC	33 ms 11,496 KB
testcase_16	AC	80 ms 14,548 KB
testcase_17	AC	95 ms 15,436 KB
testcase_18	AC	42 ms 12,052 KB
testcase_19	AC	107 ms 15,644 KB
testcase_20	AC	75 ms 14,092 KB
testcase_21	AC	51 ms 12,812 KB
testcase_22	AC	84 ms 14,500 KB
testcase_23	AC	6 ms 9,740 KB
testcase_24	AC	91 ms 15,168 KB
testcase_25	AC	68 ms 13,668 KB
testcase_26	AC	102 ms 15,060 KB
testcase_27	AC	59 ms 13,500 KB
testcase_28	AC	55 ms 13,140 KB
testcase_29	AC	45 ms 12,496 KB
testcase_30	AC	17 ms 10,404 KB
testcase_31	AC	37 ms 11,792 KB
testcase_32	AC	34 ms 11,688 KB
testcase_33	AC	111 ms 15,772 KB
testcase_34	AC	97 ms 14,960 KB
testcase_35	AC	35 ms 11,824 KB
testcase_36	AC	49 ms 12,812 KB
testcase_37	AC	65 ms 13,808 KB
testcase_38	AC	106 ms 15,648 KB

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

ソースコード

raw source code

#ifdef stderr_path
    #define LOCAL
    #define _GLIBCXX_DEBUG
#endif
#pragma GCC optimize("Ofast")
#include <cassert>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <complex>
#include <iomanip>
#include <bitset>
#include <random>
#include <chrono>

#define debug_stream std::cerr
#define iostream_untie true
#define __precision__ 10

#define rep(i, n) for(int i = 0; i < int(n); ++i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define odd(n) (int_fast64_t(n) & 1LL)
#define even(n) (odd(n) ^ 1LL)
#define bit(n, i) (int_fast64_t(n) >> size_t(i) & 1LL)
#define mask(n, i) (int_fast64_t(n) & (1LL << size_t(i)) - 1)

#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcountll

using i64 = int_fast64_t;
using pii = std::pair<int, int>;
using pll = std::pair<int_fast64_t, int_fast64_t>;
template <class T> using heap = std::priority_queue<T>;
template <class T> using minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T> constexpr T inf = std::numeric_limits<T>::max() / (T)2 - (T)1123456;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};

namespace execution
{
    std::chrono::system_clock::time_point start_time, end_time;
    void print_elapsed_time()
    {
        end_time = std::chrono::system_clock::now();
        std::cerr << "\n----- Exec time : ";
        std::cerr << std::chrono::duration_cast<std::chrono::milliseconds>(end_time - start_time).count();
        std::cerr << " ms -----\n\n";
    }
    struct setupper
    {
        setupper()
        {
            if(iostream_untie)
            {
                std::ios::sync_with_stdio(false);
                std::cin.tie(nullptr);
            }
            std::cout << std::fixed << std::setprecision(__precision__);
#ifdef stderr_path
            if(freopen(stderr_path, "a", stderr))
            {
                std::cerr << std::fixed << std::setprecision(__precision__);
            }
            else fclose(stderr);
#endif
#ifdef stdout_path
            if(not freopen(stdout_path, "w", stdout))
            {
                freopen("CON", "w", stdout);
                std::cerr << "Failed to open the stdout file\n\n";
            }
            std::cout << "";
#endif
#ifdef stdin_path
            if(not freopen(stdin_path, "r", stdin))
            {
                freopen("CON", "r", stdin);
                std::cerr << "Failed to open the stdin file\n\n";
            }
#endif
#ifdef LOCAL
            atexit(print_elapsed_time);
            start_time = std::chrono::system_clock::now();
#endif
        }
    } __setupper;
}

struct myclock_t
{
    std::chrono::system_clock::time_point built_pt, last_pt;
    int built_ln, last_ln;
    std::string built_func, last_func;
    bool is_built;
    myclock_t() : is_built(false) {}
    void build(int crt_ln, const std::string &crt_func)
    {
        is_built = true;
        last_pt = built_pt = std::chrono::system_clock::now();
        last_ln = built_ln = crt_ln, last_func = built_func = crt_func;
    }
    void set(int crt_ln, const std::string &crt_func)
    {
        if(is_built)
        {
            last_pt = std::chrono::system_clock::now();
            last_ln = crt_ln, last_func = crt_func;
        }
        else
        {
            debug_stream << "[ " << crt_ln << " : " << crt_func << " ] " << "myclock_t::set failed (yet to be built clock!)\n";
        }
    }
    void get(int crt_ln, const std::string &crt_func) {
        if(is_built)
        {
            std::chrono::system_clock::time_point crt_pt(std::chrono::system_clock::now());
            int64_t diff = std::chrono::duration_cast<std::chrono::milliseconds>(crt_pt - last_pt).count();
            debug_stream << diff << " ms elapsed from" << " [ " <<  last_ln << " : " << last_func << " ]";
            if(last_ln == built_ln) debug_stream << " (when built)";
            debug_stream << " to" << " [ " << crt_ln << " : " << crt_func << " ]" << "\n";
            last_pt = built_pt, last_ln = built_ln, last_func = built_func;
        }
        else
        {
            debug_stream << "[ " << crt_ln << " : " << crt_func << " ] " << "myclock_t::get failed (yet to be built clock!)\n";
        }
    }
};
#ifdef LOCAL
    myclock_t myclock;
    #define build_clock() myclock.build(__LINE__, __func__)
    #define set_clock() myclock.set(__LINE__, __func__)
    #define get_clock() myclock.get(__LINE__, __func__)
#else
    #define build_clock()
    #define set_clock()
    #define get_clock()
#endif

namespace std
{
    template <class RAitr> void rsort(RAitr __first, RAitr __last) { sort(__first, __last, greater<>()); }
    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); } };
    template <class T, class U> istream &operator>> (std::istream &s, pair<T,U> &p) { return s >> p.first >> p.second; }
    template <class T, class U> ostream &operator<< (std::ostream &s, const pair<T,U> p) { return s << p.first << " " << p.second; }
    template <class T> istream &operator>> (istream &s, vector<T> &v) { for(T &e : v) { s >> e; } return s; }
    template <class T> ostream &operator<< (ostream &s, const vector<T> &v) { for(size_t i = 0; i < v.size(); ++i) { s << (i ? " " : "") << v[i]; } return s; }
    template <class tuple_t, size_t index>
    struct tupleos
    {
        static ostream &apply(ostream &s, const tuple_t &t)
        {
            tupleos<tuple_t,index - 1>::apply(s,t);
            return s << " " << get<index>(t);
        }
    };
    template <class tuple_t>
    struct tupleos<tuple_t, 0>
    {
        static ostream &apply(ostream &s, const tuple_t &t)
        {
            return s << get<0>(t);
        }
    };
    template <class ...T> ostream &operator<< (ostream &s, const tuple<T...> &t)
    {
        return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(s,t);
    }
    template <> ostream &operator<< (ostream &s, const tuple<> &t) { return s; }
}


#ifdef LOCAL
    #define dump(...) debug_stream << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ << " : ", dump_func(__VA_ARGS__)
#else
    #define dump(...)
#endif
template <class T> void dump_func(const T &x) { debug_stream << x << '\n'; }
template <class T,class ...Rest> void dump_func(const T &x, Rest ... rest) { debug_stream << x << ", "; dump_func(rest...); }
template <class T> void write(const T &x) { std::cout << x << '\n'; }
template <class T, class ...Rest> void write(const T &x, Rest ... rest) { std::cout << x << ' '; write(rest...); }
void writeln() {}
template <class T, class ...Rest> void writeln(const T &x, Rest ... rest) { std::cout << x << '\n'; writeln(rest...); }
#define esc(...) writeln(__VA_ARGS__), exit(0)
template <class P> void read_range(P __first, P __second) { for(P i = __first; i != __second; ++i) std::cin >> *i; }

template <class T> bool chmin(T &x, const T &y) { return x > y ? x = y, true : false; }
template <class T> bool chmax(T &x, const T &y) { return x < y ? x = y, true : false; }
template <class T> constexpr T minf(const T &x, const T &y) { return std::min(x,y); }
template <class T> constexpr T maxf(const T &x, const T &y) { return std::max(x,y); }
template <class int_t, class F>
int_t bin(int_t ok, int_t ng, const F &f)
{
    while (std::abs(ok - ng) > 1)
    {
        int_t mid = (ok + ng) / 2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class A, size_t N, class T> void init(A (&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }
template <class A, size_t N> void init(A (&array)[N]) { memset(array, 0, sizeof(array)); }
void for_subset(int_fast64_t s, const std::function<void(int_fast64_t)> &fn) { int_fast64_t t = s; do { fn(t); } while((--t &= s) != s); }

namespace math
{
    template <class int_t>
    constexpr int_t gcd(int_t x, int_t y)
    {
        x = x > 0 ? x : -x, y = y > 0 ? y : -y;
        while(y) y ^= x ^= y ^= x %= y;
        return x;
    }
    template <class int_t>
    constexpr int_t lcm(int_t x, int_t y)
    {
        return x ? x / gcd(x, y) * y : 0;
    }
    template <class int_t>
    constexpr std::pair<int_t, int_t> ext_gcd(int_t a, int_t b)
    {
        int_t sgn_a = a >= 0, sgn_b = b >= 0;
        int_t p = 1, q = 0, r = 0, s = 1;
        while(b)
        {
            int_t t = a / b;
            r ^= p ^= r ^= p -= t * r;
            s ^= q ^= s ^= q -= t * s;
            b ^= a ^= b ^= a %= b;
        }
        return std::pair<int_t, int_t>(sgn_a ? p : -p, sgn_b ? q : -q);
    }
}


/* The main code follows. */

signed main()
{
    void solve();
    void input();
    void init();

    int t = 1;

    // cin >> t;

    while(t--)
    {
        init();
        input();
        solve();
    }
}


using namespace std;
using namespace math;

template <int_fast32_t mod>
struct modint {
    int x;

    constexpr modint() : x(0) {}
    constexpr modint(int_fast64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    constexpr modint &operator+=(const modint &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    constexpr modint &operator++() { return ++x, *this; }

    constexpr modint operator++(int) { modint t = *this; return ++x, t; }

    constexpr modint &operator-=(const modint &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    constexpr modint &operator--() { return --x, *this; }

    constexpr modint operator--(int) { modint t = *this; return --x, t; }

    constexpr modint &operator*=(const modint &p) { return x = (int_fast64_t)x * p.x % mod, *this; }

    constexpr modint &operator/=(const modint &p) { return *this *= inverse(p); }

    // constexpr modint &operator%=(int m) { return x %= m, *this; }

    constexpr modint operator-() const { return modint(-x); }

    constexpr modint operator+(const modint &p) const { return modint(*this) += p; }

    constexpr modint operator-(const modint &p) const { return modint(*this) -= p; }

    constexpr modint operator*(const modint &p) const { return modint(*this) *= p; }

    constexpr modint operator/(const modint &p) const { return modint(*this) /= p; }

    // constexpr modint operator%(int m) const { return modint(*this) %= m; }

    constexpr bool operator==(const modint &p) const { return x == p.x; }

    constexpr bool operator!=(const modint &p) const { return x != p.x; }

    constexpr bool operator!() const { return !x; }

    // constexpr bool operator>(const modint &p) const { return x > p.x; }

    // constexpr bool operator<(const modint &p) const { return x <  p.x; }

    // constexpr bool operator>=(const modint &p) const { return x >= p.x; }

    // constexpr bool operator<=(const modint &p) const { return x <= p.x; }

    constexpr friend modint inverse(const modint &p) {
        int a = p.x, b = mod, u = 1, v = 0;
        while(b > 0) {
            int t = a / b;
            a -= t * b;
            a ^= b ^= a ^= b;
            u -= t * v;
            u ^= v ^= u ^= v;
        }
        return modint(u);
    }

    constexpr friend modint pow(modint p, int_fast64_t e) {
        if(e < 0) e = (e % (mod - 1) + mod - 1) % (mod - 1);
        modint ret = 1;
        while(e) {
            if(e & 1) ret *= p;
            p *= p;
            e >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &s, const modint &p) { return s << p.x; }

    friend istream &operator>>(istream &s, modint &p) {
        int_fast64_t x;
        p = modint((s >> x, x));
        return s;
    }
};
using mint=modint<1000000007>;

int n;
std::vector<int> g[1<<18];

void init()
{}

void input()
{
    std::cin >> n;
    for(int i=1; i<n; i++)
    {
        int a,b; std::cin >> a >> b; a--, b--;
        g[a].emplace_back(b);
        g[b].emplace_back(a);
    }
}



void solve()
{
    queue<tuple<int,int,int>> que;
    que.emplace(0,-1,1);
    mint ans=0;
    while(not que.empty())
    {
        int v,p,d; tie(v,p,d)=que.front();
        que.pop();
        ans+=inverse(mint(d));
        for(int u : g[v])
        {
            if(u!=p)
            {
                que.emplace(u,v,d+1);
            }
        }
    }
    for(int i=1; i<=n; i++)
    {
        ans*=i;
    }
    std::cout << ans << '\n';
}

yukicoder

結果

テストケース

ソースコード