結果

問題 No.1103 Directed Length Sum
ユーザー hitonanodehitonanode
提出日時 2020-07-11 10:40:50
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 963 ms / 3,000 ms
コード長 3,913 bytes
コンパイル時間 2,293 ms
コンパイル使用メモリ 207,352 KB
実行使用メモリ 146,048 KB
最終ジャッジ日時 2024-10-12 19:05:26
合計ジャッジ時間 13,364 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 403 ms
146,048 KB
testcase_03 AC 268 ms
89,096 KB
testcase_04 AC 485 ms
58,496 KB
testcase_05 AC 963 ms
98,944 KB
testcase_06 AC 303 ms
39,040 KB
testcase_07 AC 43 ms
11,904 KB
testcase_08 AC 76 ms
16,384 KB
testcase_09 AC 24 ms
8,576 KB
testcase_10 AC 125 ms
21,376 KB
testcase_11 AC 552 ms
63,360 KB
testcase_12 AC 300 ms
39,424 KB
testcase_13 AC 123 ms
21,888 KB
testcase_14 AC 19 ms
7,168 KB
testcase_15 AC 215 ms
31,488 KB
testcase_16 AC 646 ms
70,912 KB
testcase_17 AC 674 ms
73,856 KB
testcase_18 AC 111 ms
21,120 KB
testcase_19 AC 571 ms
64,896 KB
testcase_20 AC 31 ms
9,856 KB
testcase_21 AC 70 ms
15,232 KB
testcase_22 AC 442 ms
53,760 KB
testcase_23 AC 242 ms
33,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }
template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << "(" << pa.first << "," << pa.second << ")"; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int main()
{
    int N;
    cin >> N;
    vector<vector<int>> to(N), from(N);
    REP(_, N - 1)
    {
        int a, b;
        cin >> a >> b;
        to[a - 1].emplace_back(b - 1), from[b - 1].emplace_back(a - 1);
    }
    int r = 0;
    while (from[r].size()) r++;

    vector<int> D(N);

    lint ret = 0;
    auto dfs = [&](auto &&rec, int now) -> void {
        for (int nxt : to[now])
        {
            D[nxt] = D[now] + 1;
            rec(rec, nxt);
        }
        ret += 1LL * D[now] * (D[now] + 1) / 2;
        ret %= 1000000007;
    };
    dfs(dfs, r);
    cout << ret << '\n';
}
0