結果
問題 | No.828 全方位神童数 |
ユーザー | risujiroh |
提出日時 | 2019-05-11 15:55:37 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 179 ms / 2,000 ms |
コード長 | 3,182 bytes |
コンパイル時間 | 2,313 ms |
コンパイル使用メモリ | 173,164 KB |
実行使用メモリ | 22,272 KB |
最終ジャッジ日時 | 2023-09-14 18:11:31 |
合計ジャッジ時間 | 8,118 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 7 ms
4,376 KB |
testcase_04 | AC | 3 ms
4,376 KB |
testcase_05 | AC | 6 ms
4,376 KB |
testcase_06 | AC | 3 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 3 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 5 ms
4,376 KB |
testcase_11 | AC | 2 ms
4,376 KB |
testcase_12 | AC | 6 ms
4,376 KB |
testcase_13 | AC | 47 ms
10,448 KB |
testcase_14 | AC | 104 ms
18,184 KB |
testcase_15 | AC | 35 ms
8,548 KB |
testcase_16 | AC | 50 ms
10,860 KB |
testcase_17 | AC | 39 ms
9,076 KB |
testcase_18 | AC | 70 ms
14,048 KB |
testcase_19 | AC | 134 ms
21,644 KB |
testcase_20 | AC | 95 ms
15,896 KB |
testcase_21 | AC | 128 ms
19,532 KB |
testcase_22 | AC | 24 ms
7,060 KB |
testcase_23 | AC | 8 ms
4,380 KB |
testcase_24 | AC | 75 ms
12,824 KB |
testcase_25 | AC | 26 ms
7,084 KB |
testcase_26 | AC | 152 ms
20,600 KB |
testcase_27 | AC | 127 ms
18,020 KB |
testcase_28 | AC | 154 ms
20,528 KB |
testcase_29 | AC | 137 ms
19,628 KB |
testcase_30 | AC | 67 ms
12,876 KB |
testcase_31 | AC | 73 ms
12,532 KB |
testcase_32 | AC | 154 ms
20,280 KB |
testcase_33 | AC | 174 ms
21,984 KB |
testcase_34 | AC | 127 ms
18,156 KB |
testcase_35 | AC | 77 ms
13,288 KB |
testcase_36 | AC | 98 ms
15,636 KB |
testcase_37 | AC | 58 ms
11,452 KB |
testcase_38 | AC | 85 ms
14,728 KB |
testcase_39 | AC | 160 ms
20,560 KB |
testcase_40 | AC | 64 ms
11,420 KB |
testcase_41 | AC | 51 ms
10,104 KB |
testcase_42 | AC | 179 ms
22,272 KB |
testcase_43 | AC | 72 ms
18,408 KB |
testcase_44 | AC | 29 ms
9,072 KB |
testcase_45 | AC | 43 ms
12,128 KB |
コンパイルメッセージ
main.cpp:11:10: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 11 | ModInt(auto x) : v(x >= 0 ? x % P : (P - -x % P) % P) {} | ^~~~ main.cpp:38:9: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 38 | M pow(auto n) const { | ^~~~ main.cpp:44:22: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 44 | friend M operator*(auto l, M r) { return M(l) *= r; } | ^~~~ main.cpp:45:22: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 45 | friend M operator/(auto l, M r) { return M(l) /= r; } | ^~~~ main.cpp:46:22: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 46 | friend M operator+(auto l, M r) { return M(l) += r; } | ^~~~ main.cpp:47:22: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 47 | friend M operator-(auto l, M r) { return M(l) -= r; } | ^~~~ main.cpp:50:26: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 50 | friend bool operator==(auto l, M r) { return M(l) == r; } | ^~~~ main.cpp:51:26: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 51 | friend bool operator!=(auto l, M r) { return !(l == r); } | ^~~~
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long; template<class T = int> using V = vector<T>; template<class T = int> using VV = V< V<T> >; template<unsigned P> struct ModInt { using M = ModInt; unsigned v; ModInt() : v(0) {} ModInt(auto x) : v(x >= 0 ? x % P : (P - -x % P) % P) {} constexpr ModInt(unsigned v, int) : v(v) {} static constexpr unsigned p() { return P; } M operator+() const { return *this; } M operator-() const { return {v ? P - v : 0, 0}; } explicit operator bool() const noexcept { return v; } bool operator!() const noexcept { return !(bool) *this; } M operator*(M r) const { return M(*this) *= r; } M operator/(M r) const { return M(*this) /= r; } M operator+(M r) const { return M(*this) += r; } M operator-(M r) const { return M(*this) -= r; } bool operator==(M r) const { return v == r.v; } bool operator!=(M r) const { return !(*this == r); } M& operator*=(M r) { v = (uint64_t) v * r.v % P; return *this; } M& operator/=(M r) { return *this *= r.inv(); } M& operator+=(M r) { if ((v += r.v) >= P) v -= P; return *this; } M& operator-=(M r) { if ((v += P - r.v) >= P) v -= P; return *this; } M inv() const { int a = v, b = P, x = 1, u = 0; while (b) { int q = a / b; swap(a -= q * b, b); swap(x -= q * u, u); } assert(a == 1); return x; } M pow(auto n) const { if (n < 0) return pow(-n).inv(); M res = 1; for (M a = *this; n; a *= a, n >>= 1) if (n & 1) res *= a; return res; } friend M operator*(auto l, M r) { return M(l) *= r; } friend M operator/(auto l, M r) { return M(l) /= r; } friend M operator+(auto l, M r) { return M(l) += r; } friend M operator-(auto l, M r) { return M(l) -= r; } friend ostream& operator<<(ostream& os, M r) { return os << r.v; } friend istream& operator>>(istream& is, M& r) { lint x; is >> x; r = x; return is; } friend bool operator==(auto l, M r) { return M(l) == r; } friend bool operator!=(auto l, M r) { return !(l == r); } }; using Mint = ModInt<(unsigned) 1e9 + 7>; struct UnionFind { const int n; V<> t, a; // root ? -sz : par UnionFind(int n) : n(n), t(n, -1), a(n) {} int find(int v) const { return t[v] < 0 ? v : find(t[v]); } void unite(int u, int v) { if ((u = find(u)) == (v = find(v))) return; if (-t[u] < -t[v]) swap(u, v); t[u] += t[v]; t[v] = u; a[v] -= a[u]; } void dfs(int v) { static VV<> ch; if (ch.empty()) { ch.resize(n); for (int v = 0; v < n; ++v) if (t[v] >= 0) { ch[t[v]].push_back(v); } } for (int w : ch[v]) { a[w] += a[v]; dfs(w); } } }; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n; cin >> n; V<> r(n); for (auto&& e : r) cin >> e; VV<> g(n); for (int i = 0; i < n - 1; ++i) { int u, v; cin >> u >> v, --u, --v; g[u].push_back(v); g[v].push_back(u); } UnionFind uf(n); for (int v = 0; v < n; ++v) { for (int w : g[v]) if (w < v) { uf.unite(v, w); } ++uf.a[uf.find(v)]; } uf.dfs(uf.find(0)); Mint res = 1; for (int v = 0; v < n; ++v) res *= r[v] + uf.a[v]; cout << res << '\n'; }