結果

問題 No.1103 Directed Length Sum
ユーザー tkmst201tkmst201
提出日時 2020-12-01 16:51:52
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 737 ms / 3,000 ms
コード長 4,178 bytes
コンパイル時間 2,665 ms
コンパイル使用メモリ 206,756 KB
実行使用メモリ 107,740 KB
最終ジャッジ日時 2024-09-13 03:02:56
合計ジャッジ時間 11,983 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 363 ms
107,740 KB
testcase_03 AC 200 ms
42,552 KB
testcase_04 AC 373 ms
32,324 KB
testcase_05 AC 737 ms
53,284 KB
testcase_06 AC 231 ms
22,172 KB
testcase_07 AC 37 ms
7,936 KB
testcase_08 AC 58 ms
10,248 KB
testcase_09 AC 22 ms
6,944 KB
testcase_10 AC 91 ms
12,832 KB
testcase_11 AC 435 ms
34,696 KB
testcase_12 AC 234 ms
22,192 KB
testcase_13 AC 96 ms
13,176 KB
testcase_14 AC 16 ms
6,944 KB
testcase_15 AC 174 ms
17,976 KB
testcase_16 AC 481 ms
38,804 KB
testcase_17 AC 517 ms
40,420 KB
testcase_18 AC 93 ms
12,800 KB
testcase_19 AC 440 ms
35,668 KB
testcase_20 AC 27 ms
6,940 KB
testcase_21 AC 52 ms
9,728 KB
testcase_22 AC 363 ms
29,536 KB
testcase_23 AC 183 ms
19,016 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

template<int M>
struct ModInt {
	static_assert(M > 0);
	
public:
	using value_type = int;
	using calc_type = std::int_fast64_t;
	
private:
	value_type val_;
	
public:
	constexpr ModInt(calc_type val = 0) : val_(val < 0 ? (val % M + M) % M : val % M) {}
	constexpr const value_type & val() const noexcept { return val_; }
	constexpr static decltype(M) mod() noexcept { return M; }
	
	explicit constexpr operator bool() const noexcept { return val_; }
	constexpr bool operator !() const noexcept { return !static_cast<bool>(*this); }
	constexpr ModInt operator +() const noexcept { return ModInt(*this); }
	constexpr ModInt operator -() const noexcept { return ModInt(-val_); }
	constexpr ModInt operator ++(int) noexcept { ModInt res = *this; ++*this; return res; }
	constexpr ModInt operator --(int) noexcept { ModInt res = *this; --*this; return res; }
	constexpr ModInt & operator ++() noexcept { val_ = val_ + 1 == M ? 0 : val_ + 1; return *this; }
	constexpr ModInt & operator --() noexcept { val_ = val_ == 0 ? M - 1 : val_ - 1; return *this; }
	constexpr ModInt & operator +=(const ModInt & rhs) noexcept { val_ += val_ < M - rhs.val_ ? rhs.val_ : rhs.val_ - M; return *this; }
	constexpr ModInt & operator -=(const ModInt & rhs) noexcept { val_ += val_ >= rhs.val_ ? -rhs.val_ : M - rhs.val_; return *this; }
	constexpr ModInt & operator *=(const ModInt & rhs) noexcept { val_ = static_cast<calc_type>(val_) * rhs.val_ % M; return *this; }
	constexpr ModInt & operator /=(const ModInt & rhs) noexcept { return *this *= rhs.inv(); }
	friend constexpr ModInt operator +(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) += rhs; }
	friend constexpr ModInt operator -(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) -= rhs; }
	friend constexpr ModInt operator *(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) *= rhs; }
	friend constexpr ModInt operator /(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) /= rhs; }
	friend constexpr bool operator ==(const ModInt & lhs, const ModInt & rhs) noexcept { return lhs.val_ == rhs.val_; }
	friend constexpr bool operator !=(const ModInt & lhs, const ModInt & rhs) noexcept { return !(lhs == rhs); }
	friend std::ostream & operator <<(std::ostream & os, const ModInt & rhs) { return os << rhs.val_; }
	friend std::istream & operator >>(std::istream & is, ModInt & rhs) { calc_type x; is >> x; rhs = ModInt(x); return is; }
	
	constexpr ModInt pow(calc_type n) const noexcept {
		ModInt res = 1, x = val_;
		if (n < 0) { x = x.inv(); n = -n; }
		while (n) { if (n & 1) res *= x; x *= x; n >>= 1; }
		return res;
	}
	
	constexpr ModInt inv() const noexcept {
		value_type a = val_, a1 = 1, a2 = 0, b = M, b1 = 0, b2 = 1;
		while (b > 0) {
			value_type q = a / b, r = a % b;
			value_type nb1 = a1 - q * b1, nb2 = a2 - q * b2;
			a = b; b = r;
			a1 = b1; b1 = nb1;
			a2 = b2; b2 = nb2;
		}
		assert(a == 1);
		return a1;
	}
};
using mint = ModInt<MOD>;

int main() {
	int N;
	cin >> N;
	vector<vector<int>> g(N);
	vector<int> indeg(N);
	REP(i, N - 1) {
		int A, B;
		scanf("%d %d", &A, &B);
		--A; --B;
		g[A].emplace_back(B);
		++indeg[B];
	}
	
	vector<int> depth(N), child(N);
	auto dfs = [&](auto && self, int u) -> int {
		child[u] = 1;
		for (int v : g[u]) {
			depth[v] = depth[u] + 1;
			child[u] += self(self, v);
		}
		return child[u];
	};
	const int root = find(ALL(indeg), 0) - indeg.begin();
	depth[root] = 1;
	dfs(dfs, root);
	
	mint ans = 0;
	REP(i, N) for (int v : g[i]) ans += (ll)depth[i] * child[v];
	cout << ans << endl;
}
0