結果
問題 | No.1103 Directed Length Sum |
ユーザー | bond_cmprog |
提出日時 | 2020-07-03 21:31:28 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,554 bytes |
コンパイル時間 | 2,380 ms |
コンパイル使用メモリ | 207,504 KB |
実行使用メモリ | 96,384 KB |
最終ジャッジ日時 | 2024-09-16 22:57:21 |
合計ジャッジ時間 | 7,364 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge6 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | WA | - |
testcase_03 | AC | 172 ms
34,744 KB |
testcase_04 | AC | 253 ms
27,648 KB |
testcase_05 | AC | 492 ms
45,620 KB |
testcase_06 | AC | 145 ms
19,200 KB |
testcase_07 | AC | 30 ms
7,040 KB |
testcase_08 | AC | 46 ms
9,088 KB |
testcase_09 | AC | 18 ms
5,504 KB |
testcase_10 | AC | 68 ms
11,136 KB |
testcase_11 | AC | 288 ms
30,008 KB |
testcase_12 | AC | 145 ms
19,328 KB |
testcase_13 | AC | 67 ms
11,432 KB |
testcase_14 | AC | 15 ms
5,376 KB |
testcase_15 | AC | 105 ms
15,812 KB |
testcase_16 | AC | 321 ms
33,280 KB |
testcase_17 | AC | 335 ms
34,432 KB |
testcase_18 | AC | 64 ms
11,264 KB |
testcase_19 | AC | 288 ms
30,592 KB |
testcase_20 | AC | 24 ms
6,016 KB |
testcase_21 | AC | 43 ms
8,576 KB |
testcase_22 | AC | 240 ms
25,472 KB |
testcase_23 | AC | 114 ms
16,640 KB |
ソースコード
#include <bits/stdc++.h> #define REP(i, n) for(int i = 0;i < n;i++) #define ll long long using namespace std; //typedef vector<unsigned int>vec; //typedef vector<ll>vec; //typedef vector<vec> mat; typedef pair<int, int> P; typedef pair<ll,ll> LP; const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}; const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1}; const int INF = 1000000000; const ll LINF = 1000000000000000000;//1e18 const ll MOD = 1000000007; const ll MOD2 = 998244353; const double PI = acos(-1.0); const double EPS = 1e-10; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } //template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;}; 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 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; } }; template<class T> struct BiCoef { vector<T> fact_, inv_, finv_; constexpr BiCoef() {} constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) { init(n); } constexpr void init(int n) noexcept { fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1); int MOD = fact_[0].getmod(); for(int i = 2; i < n; i++){ fact_[i] = fact_[i-1] * i; inv_[i] = -inv_[MOD%i] * (MOD/i); finv_[i] = finv_[i-1] * inv_[i]; } } constexpr T com(int n, int k) const noexcept { if (n < k || n < 0 || k < 0) return 0; return fact_[n] * finv_[k] * finv_[n-k]; } constexpr T fact(int n) const noexcept { if (n < 0) return 0; return fact_[n]; } constexpr T inv(int n) const noexcept { if (n < 0) return 0; return inv_[n]; } constexpr T finv(int n) const noexcept { if (n < 0) return 0; return finv_[n]; } constexpr T perm(int n, int k) const noexcept { if (n < k || n < 0 || k < 0) return 0; return fact_[n] * finv_[n-k]; } }; using mint = Fp<MOD>; BiCoef<mint> bc; void solve(){ int N; cin >> N; vector<vector<int>> G(N); vector<int> deq(N); REP(i,N-1){ int a, b; cin >> a >> b; G[--a].emplace_back(--b); deq[b]++; } ll ans = 0; auto dfs = [&](auto && self, int cur, int par, ll cnt) -> void{ ans += cnt * (cnt + 1) / 2; for(auto nv : G[cur]){ if(nv == par) continue; self(self, nv, cur, cnt + 1); } }; int root = -1; REP(i,N) if(deq[i] == 0) root = i; dfs(dfs, root, -1, 0); cout << ans << endl; } int main(){ cin.tie(0); ios::sync_with_stdio(false); solve(); // int T; cin >> T; REP(t,T) solve(); }