結果
問題 | No.1103 Directed Length Sum |
ユーザー | Ogtsn99 |
提出日時 | 2020-07-03 22:21:48 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 647 ms / 3,000 ms |
コード長 | 6,566 bytes |
コンパイル時間 | 2,455 ms |
コンパイル使用メモリ | 215,908 KB |
実行使用メモリ | 151,808 KB |
最終ジャッジ日時 | 2024-09-17 03:13:54 |
合計ジャッジ時間 | 9,384 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 357 ms
151,808 KB |
testcase_03 | AC | 202 ms
50,812 KB |
testcase_04 | AC | 353 ms
35,840 KB |
testcase_05 | AC | 647 ms
59,636 KB |
testcase_06 | AC | 220 ms
24,320 KB |
testcase_07 | AC | 39 ms
8,192 KB |
testcase_08 | AC | 70 ms
10,880 KB |
testcase_09 | AC | 23 ms
6,400 KB |
testcase_10 | AC | 103 ms
13,824 KB |
testcase_11 | AC | 392 ms
38,808 KB |
testcase_12 | AC | 226 ms
24,576 KB |
testcase_13 | AC | 105 ms
14,208 KB |
testcase_14 | AC | 18 ms
5,632 KB |
testcase_15 | AC | 175 ms
19,832 KB |
testcase_16 | AC | 444 ms
43,028 KB |
testcase_17 | AC | 464 ms
44,800 KB |
testcase_18 | AC | 103 ms
13,756 KB |
testcase_19 | AC | 405 ms
39,632 KB |
testcase_20 | AC | 30 ms
7,168 KB |
testcase_21 | AC | 63 ms
10,112 KB |
testcase_22 | AC | 326 ms
32,876 KB |
testcase_23 | AC | 190 ms
21,032 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define int long long #define rep(i,n) for(int (i)=0;(i)<(n);(i)++) #define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--) #define itn int #define miele(v) min_element(v.begin(), v.end()) #define maele(v) max_element(v.begin(), v.end()) #define SUM(v) accumulate(v.begin(), v.end(), 0LL) #define lb(a, key) lower_bound(a.begin(),a.end(),key) #define ub(a, key) upper_bound(a.begin(),a.end(),key) #define COUNT(a, key) count(a.begin(), a.end(), key) #define BITCOUNT(x) __builtin_popcount(x) #define pb push_back #define all(x) (x).begin(),(x).end() #define F first #define S second using P = pair <int,int>; using WeightedGraph = vector<vector <P>>; using UnWeightedGraph = vector<vector<int>>; using Real = long double; using Point = complex<Real>; //Point and Vector2d is the same! using Vector2d = complex<Real>; const long long INF = 1LL << 60; const int MOD = 1000000007; const double EPS = 1e-15; const double PI=3.14159265358979323846; template <typename T> int getIndexOfLowerBound(vector <T> &v, T x){ return lower_bound(v.begin(),v.end(),x)-v.begin(); } template <typename T> int getIndexOfUpperBound(vector <T> &v, T x){ return upper_bound(v.begin(),v.end(),x)-v.begin(); } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } #define DUMPOUT cerr #define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++) istream &operator>>(istream &is, Point &p) { Real a, b; is >> a >> b; p = Point(a, b); return is; } template <typename T, typename U> istream &operator>>(istream &is, pair<T,U> &p_var) { is >> p_var.first >> p_var.second; return is; } template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (T &x : vec) is >> x; return is; } template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { DUMPOUT<<'{'; os << pair_var.first; DUMPOUT<<','; os << " "<< pair_var.second; DUMPOUT<<'}'; return os; } template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) { DUMPOUT<<'['; for (int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " "); DUMPOUT<<']'; return os; } template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &df) { for (auto& vec : df) os<<vec; return os; } template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { DUMPOUT << "{"; repi(itr, map_var) { os << *itr; itr++; if (itr != map_var.end()) DUMPOUT << ", "; itr--; } DUMPOUT << "}"; return os; } template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { DUMPOUT << "{"; repi(itr, set_var) { os << *itr; itr++; if (itr != set_var.end()) DUMPOUT << ", "; itr--; } DUMPOUT << "}"; return os; } void print() {cout << endl;} template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { cout << head; if (sizeof...(tail) != 0) cout << " "; print(forward<Tail>(tail)...); } void dump_func() {DUMPOUT << '#'<<endl;} template <typename Head, typename... Tail> void dump_func(Head &&head, Tail &&... tail) { DUMPOUT << head; if (sizeof...(Tail) > 0) DUMPOUT << ", "; dump_func(std::move(tail)...); } #ifdef DEBUG_ #define DEB #define dump(...) \ DUMPOUT << " " << string(#__VA_ARGS__) << ": " \ << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \ << endl \ << " ", \ dump_func(__VA_ARGS__) #else #define DEB if (false) #define dump(...) #endif 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; } }; using mint = Fp<1000000007>; int n; UnWeightedGraph g; vector <pair<mint, mint>> daten; vector <bool> done; pair <mint, mint> dfs(int now, int mae = -1, int cnt=0){ if(done[now]) return daten[now]; daten[now].S += 1; for(auto e: g[now]){ daten[now].F += dfs(e, now).F + dfs(e, now).S; daten[now].S += dfs(e, now).S; } done[now] = 1; return daten[now]; } signed main(void) { cin.tie(0); ios::sync_with_stdio(false); cin>>n; g.resize(n); daten.resize(n), done.resize(n); rep(i, n-1){ int a, b; cin>>a>>b; a--, b--; g[a].pb(b); // a to b } mint ans = 0; for(int i=0;i<n;i++){ ans += dfs(i).F; } print(ans); }