結果
問題 | No.1103 Directed Length Sum |
ユーザー | heno239 |
提出日時 | 2020-07-25 12:48:35 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 641 ms / 3,000 ms |
コード長 | 3,208 bytes |
コンパイル時間 | 1,246 ms |
コンパイル使用メモリ | 118,164 KB |
実行使用メモリ | 171,384 KB |
最終ジャッジ日時 | 2024-06-27 03:03:34 |
合計ジャッジ時間 | 8,181 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 11 ms
19,144 KB |
testcase_01 | AC | 10 ms
19,172 KB |
testcase_02 | AC | 398 ms
171,384 KB |
testcase_03 | AC | 190 ms
50,524 KB |
testcase_04 | AC | 365 ms
43,332 KB |
testcase_05 | AC | 641 ms
61,420 KB |
testcase_06 | AC | 184 ms
34,920 KB |
testcase_07 | AC | 35 ms
22,888 KB |
testcase_08 | AC | 60 ms
24,772 KB |
testcase_09 | AC | 25 ms
21,480 KB |
testcase_10 | AC | 86 ms
27,056 KB |
testcase_11 | AC | 365 ms
45,732 KB |
testcase_12 | AC | 198 ms
35,052 KB |
testcase_13 | AC | 78 ms
27,172 KB |
testcase_14 | AC | 22 ms
20,804 KB |
testcase_15 | AC | 143 ms
31,408 KB |
testcase_16 | AC | 449 ms
48,940 KB |
testcase_17 | AC | 434 ms
50,224 KB |
testcase_18 | AC | 82 ms
26,900 KB |
testcase_19 | AC | 370 ms
46,268 KB |
testcase_20 | AC | 28 ms
21,864 KB |
testcase_21 | AC | 54 ms
24,296 KB |
testcase_22 | AC | 275 ms
41,404 KB |
testcase_23 | AC | 145 ms
32,304 KB |
コンパイルメッセージ
main.cpp: In function 'void solve()': main.cpp:107:13: warning: 'root' may be used uninitialized [-Wmaybe-uninitialized] 107 | int root; | ^~~~
ソースコード
#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<utility> #include<cassert> #include<complex> #include<numeric> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pair<int, int>P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; typedef long double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acos(-1.0); ll mod_pow(ll x, ll n,ll m) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, int n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1010000; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } void solve(){ int n; cin >> n; vector<vector<int>> G(n); vector<int> cnt(n); rep(i, n - 1) { int a, b; cin >> a >> b; a--; b--; G[a].push_back(b); cnt[b]++; } int root; rep(i, n)if (cnt[i] == 0)root = i; ll ans = 0; function<int(int,int)> dfs = [&](int id, int dep)->int{ int res = 1; for (int to : G[id]) { int c = dfs(to, dep + 1); ans += (ll)c * dep; res += c; } return res; }; dfs(root, 1); cout << ans%mod << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); //init_f(); //cout << grandy(2, 3, false, false) << "\n"; //int t; cin >> t; rep(i, t) solve(); return 0; }