結果

問題 No.827 総神童数
ユーザー 👑 hitonanodehitonanode
提出日時 2019-06-28 22:13:36
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 228 ms / 2,000 ms
コード長 4,591 bytes
コンパイル時間 1,725 ms
コンパイル使用メモリ 177,584 KB
実行使用メモリ 43,912 KB
最終ジャッジ日時 2023-09-14 22:06:45
合計ジャッジ時間 8,373 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 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,380 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 164 ms
43,912 KB
testcase_10 AC 55 ms
16,728 KB
testcase_11 AC 3 ms
4,376 KB
testcase_12 AC 21 ms
9,452 KB
testcase_13 AC 128 ms
36,172 KB
testcase_14 AC 5 ms
4,644 KB
testcase_15 AC 48 ms
16,332 KB
testcase_16 AC 132 ms
33,232 KB
testcase_17 AC 155 ms
39,164 KB
testcase_18 AC 65 ms
19,844 KB
testcase_19 AC 228 ms
34,688 KB
testcase_20 AC 165 ms
26,408 KB
testcase_21 AC 114 ms
20,072 KB
testcase_22 AC 183 ms
28,844 KB
testcase_23 AC 2 ms
4,376 KB
testcase_24 AC 200 ms
31,444 KB
testcase_25 AC 148 ms
24,572 KB
testcase_26 AC 200 ms
31,364 KB
testcase_27 AC 127 ms
22,080 KB
testcase_28 AC 128 ms
21,776 KB
testcase_29 AC 97 ms
17,988 KB
testcase_30 AC 21 ms
7,892 KB
testcase_31 AC 73 ms
14,928 KB
testcase_32 AC 68 ms
14,364 KB
testcase_33 AC 225 ms
33,884 KB
testcase_34 AC 205 ms
31,376 KB
testcase_35 AC 75 ms
14,892 KB
testcase_36 AC 111 ms
19,860 KB
testcase_37 AC 150 ms
24,628 KB
testcase_38 AC 219 ms
33,440 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_by_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

constexpr lint MOD = 1000000007;
vector<lint> fac, facInv, inv;
void facInit(int nmax)
{
    fac = facInv = inv = vector<lint>(nmax + 1, 1);
    for (int i = 2; i <= nmax; i++)
    {
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        facInv[i] = facInv[i-1] * inv[i] % MOD;
    }
}
lint nCr(int n, int r)
{
    if (n<r || r<0) return 0;
    if (n >= (int)fac.size()) facInit(n);
    return (fac[n] * facInv[r] % MOD) * facInv[n-r] % MOD;
}
lint nPr(int n, int r)
{
    if (n<r || r<0) return 0;
    if (n >= (int)fac.size()) facInit(n);
    return fac[n] * facInv[n-r] % MOD;
}


vector<set<int>> e;

int N;
lint ret;
void dfs(int now, int prv, int depth)
{
    (ret += nCr(N, depth) * fac[depth - 1] % MOD * fac[N - depth]) %= MOD;
    for (auto nxt : e[now]) if (nxt != prv) dfs(nxt, now, depth + 1);
}
int main()
{
    cin >> N;
    facInit(N);
    e.resize(N + 1);
    REP(_, N - 1)
    {
        int u, v;
        cin >> u >> v;
        e[u].insert(v);
        e[v].insert(u);
    }

    ret = 0;
    dfs(1, -1, 1);
    cout << ret << endl;
}
0