結果
問題 | No.1103 Directed Length Sum |
ユーザー | apricity |
提出日時 | 2023-04-27 02:10:08 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 480 ms / 3,000 ms |
コード長 | 5,276 bytes |
コンパイル時間 | 1,418 ms |
コンパイル使用メモリ | 137,276 KB |
実行使用メモリ | 123,420 KB |
最終ジャッジ日時 | 2024-04-28 01:45:43 |
合計ジャッジ時間 | 7,909 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 288 ms
123,420 KB |
testcase_03 | AC | 157 ms
42,584 KB |
testcase_04 | AC | 217 ms
32,096 KB |
testcase_05 | AC | 480 ms
53,272 KB |
testcase_06 | AC | 121 ms
22,068 KB |
testcase_07 | AC | 27 ms
7,808 KB |
testcase_08 | AC | 42 ms
10,112 KB |
testcase_09 | AC | 16 ms
6,944 KB |
testcase_10 | AC | 56 ms
12,664 KB |
testcase_11 | AC | 246 ms
34,700 KB |
testcase_12 | AC | 120 ms
22,112 KB |
testcase_13 | AC | 58 ms
12,940 KB |
testcase_14 | AC | 13 ms
6,940 KB |
testcase_15 | AC | 94 ms
17,928 KB |
testcase_16 | AC | 287 ms
38,536 KB |
testcase_17 | AC | 308 ms
40,108 KB |
testcase_18 | AC | 56 ms
12,680 KB |
testcase_19 | AC | 247 ms
35,424 KB |
testcase_20 | AC | 20 ms
6,944 KB |
testcase_21 | AC | 37 ms
9,344 KB |
testcase_22 | AC | 180 ms
29,568 KB |
testcase_23 | AC | 106 ms
19,060 KB |
ソースコード
#include<iostream> #include<string> #include<vector> #include<algorithm> #include<numeric> #include<cmath> #include<utility> #include<tuple> #include<cstdint> #include<cstdio> #include<iomanip> #include<map> #include<queue> #include<set> #include<stack> #include<deque> #include<unordered_map> #include<unordered_set> #include<bitset> #include<cctype> #include<chrono> #include<random> #include<cassert> #include<cstddef> #include<iterator> #include<string_view> #include<type_traits> #ifdef LOCAL # include "debug_print.hpp" # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast<void>(0)) #endif using namespace std; #define rep(i,n) for(int i=0; i<(n); i++) #define rrep(i,n) for(int i=(n)-1; i>=0; i--) #define FOR(i,a,b) for(int i=(a); i<(b); i++) #define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--) #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); #define pb push_back using ll = long long; using D = double; using LD = long double; using P = pair<int, int>; template<typename T> using PQ = priority_queue<T,vector<T>>; template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>; template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";} template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; } template<typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p) { is >> p.first >> p.second; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; } void in() {} template<typename T, class... U> void in(T &t, U &...u) { cin >> t; in(u...); } void out() { cout << "\n"; } template<typename T, class... U, char sep = ' '> void out(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; out(u...); } void outr() {} template<typename T, class... U, char sep = ' '> void outr(const T &t, const U &...u) { cout << t; outr(u...); } template<int mod> struct Fp { long long val; constexpr Fp(long long v = 0) noexcept : val(v % mod) { if (val < 0) val += mod; } constexpr int getmod() { return mod; } constexpr Fp operator - () const noexcept { return val ? mod - val : 0; } constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; } constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; } constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; } constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; } constexpr Fp& operator += (const Fp& r) noexcept { val += r.val; if (val >= mod) val -= mod; return *this; } constexpr Fp& operator -= (const Fp& r) noexcept { val -= r.val; if (val < 0) val += mod; return *this; } constexpr Fp& operator *= (const Fp& r) noexcept { val = val * r.val % mod; return *this; } constexpr Fp& operator /= (const Fp& r) noexcept { long long a = r.val, b = mod, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } val = val * u % mod; if (val < 0) val += mod; return *this; } constexpr bool operator == (const Fp& r) const noexcept { return this->val == r.val; } constexpr bool operator != (const Fp& r) const noexcept { return this->val != r.val; } friend constexpr istream& operator >> (istream &is, const Fp<mod>& x) noexcept { int val; is >> val; x = Fp<mod>(val); return is; } friend constexpr ostream& operator << (ostream &os, const Fp<mod>& x) noexcept { return os << x.val; } friend constexpr Fp<mod> modpow(const Fp<mod> &a, long long n) noexcept { if (n == 0) return 1; auto t = modpow(a, n / 2); t = t * t; if (n & 1) t = t * a; return t; } }; const int mod = 1e9+7; // const int mod = 998244353; using mint = Fp<mod>; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; in(n); vector g(n,vector<int>()); vector ind(n,0); rep(i,n-1){ int a,b; in(a,b); a--; b--; g[a].pb(b); ind[b]++; } int root = -1; rep(i,n) if(ind[i] == 0) root = i; vector up(n,0), down(n,0); auto dfs = [&] (auto dfs, int u, int p) -> void{ for(int v : g[u]){ if(v == p) continue; up[v] = up[u]+1; dfs(dfs,v,u); down[u] += down[v]; } down[u]++; }; dfs(dfs,root,-1); mint ans = 0; rep(i,n) ans += (mint)up[i] * down[i]; out(ans); }