結果

問題 No.828 全方位神童数
ユーザー hitonanodehitonanode
提出日時 2019-06-28 22:46:25
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 298 ms / 2,000 ms
コード長 4,600 bytes
コンパイル時間 1,818 ms
コンパイル使用メモリ 180,816 KB
実行使用メモリ 50,048 KB
最終ジャッジ日時 2024-07-02 05:02:45
合計ジャッジ時間 10,519 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 10 ms
5,632 KB
testcase_04 AC 4 ms
5,376 KB
testcase_05 AC 10 ms
5,504 KB
testcase_06 AC 3 ms
5,376 KB
testcase_07 AC 3 ms
5,376 KB
testcase_08 AC 3 ms
5,376 KB
testcase_09 AC 3 ms
5,376 KB
testcase_10 AC 7 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 8 ms
5,376 KB
testcase_13 AC 79 ms
21,232 KB
testcase_14 AC 183 ms
40,288 KB
testcase_15 AC 56 ms
16,384 KB
testcase_16 AC 84 ms
22,016 KB
testcase_17 AC 65 ms
18,176 KB
testcase_18 AC 128 ms
29,696 KB
testcase_19 AC 224 ms
48,680 KB
testcase_20 AC 148 ms
34,304 KB
testcase_21 AC 195 ms
42,932 KB
testcase_22 AC 39 ms
12,800 KB
testcase_23 AC 12 ms
6,272 KB
testcase_24 AC 129 ms
27,172 KB
testcase_25 AC 43 ms
13,184 KB
testcase_26 AC 269 ms
45,952 KB
testcase_27 AC 223 ms
39,936 KB
testcase_28 AC 274 ms
46,328 KB
testcase_29 AC 249 ms
43,776 KB
testcase_30 AC 126 ms
27,056 KB
testcase_31 AC 120 ms
26,496 KB
testcase_32 AC 268 ms
46,012 KB
testcase_33 AC 291 ms
49,536 KB
testcase_34 AC 224 ms
40,448 KB
testcase_35 AC 137 ms
28,544 KB
testcase_36 AC 185 ms
34,304 KB
testcase_37 AC 110 ms
23,936 KB
testcase_38 AC 168 ms
31,488 KB
testcase_39 AC 277 ms
46,464 KB
testcase_40 AC 112 ms
23,808 KB
testcase_41 AC 87 ms
20,456 KB
testcase_42 AC 298 ms
50,048 KB
testcase_43 AC 106 ms
47,232 KB
testcase_44 AC 43 ms
20,352 KB
testcase_45 AC 62 ms
28,928 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>;
*/

int N;
vector<set<int>> e, e2;
vector<lint> r;

struct UnionFind // UnionFind Tree (0-indexed)
{
    vector<int> par;
    UnionFind(int N) : par(N) { REP(i, N) par[i] = i; }
    int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }
    void unite(int x, int y) {
        x = find(x), y = find(y); if (x == y) return;
        if (x < y) par[x] = y; else par[y] = x;
    }
    bool same(int x, int y) { return find(x) == find(y); }
};

void dfs(int now, int add)
{
    r[now] += add;
    for (auto nxt : e2[now]) dfs(nxt, add + 1);
}

int main()
{
    cin >> N;
    r.resize(N);
    cin >> r;
    e.resize(N);
    e2.resize(N);
    REP(_, N - 1)
    {
        int u, v;
        cin >> u >> v;
        e[u - 1].insert(v - 1);
        e[v - 1].insert(u - 1);
    }

    UnionFind uf(N);
    REP(now, N)
    {
        for (auto nxt : e[now]) if (nxt < now)
        {
            int t = uf.find(nxt);
            e2[now].insert(t);
            uf.unite(nxt, now);
        }
    }
    dfs(N - 1, 1);
    lint ret = 1;
    REP(i, N) ret = ret * r[i] % 1000000007;
    cout << ret << endl;
}
0