結果
| 問題 | No.1103 Directed Length Sum |
| ユーザー |
 Shuz*
|
| 提出日時 | 2020-07-03 21:31:37 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 1,887 ms / 3,000 ms |
| コード長 | 5,494 bytes |
| コンパイル時間 | 2,061 ms |
| コンパイル使用メモリ | 181,600 KB |
| 実行使用メモリ | 221,988 KB |
| 最終ジャッジ日時 | 2024-09-16 22:58:23 |
| 合計ジャッジ時間 | 16,136 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
6,816 KB |
| testcase_01 | AC | 1 ms
6,940 KB |
| testcase_02 | AC | 811 ms
221,988 KB |
| testcase_03 | AC | 621 ms
104,664 KB |
| testcase_04 | AC | 996 ms
66,468 KB |
| testcase_05 | AC | 1,887 ms
112,736 KB |
| testcase_06 | AC | 510 ms
44,196 KB |
| testcase_07 | AC | 72 ms
13,184 KB |
| testcase_08 | AC | 124 ms
18,308 KB |
| testcase_09 | AC | 42 ms
9,472 KB |
| testcase_10 | AC | 198 ms
23,992 KB |
| testcase_11 | AC | 1,005 ms
72,248 KB |
| testcase_12 | AC | 582 ms
44,804 KB |
| testcase_13 | AC | 244 ms
24,568 KB |
| testcase_14 | AC | 34 ms
7,936 KB |
| testcase_15 | AC | 425 ms
35,676 KB |
| testcase_16 | AC | 1,247 ms
80,756 KB |
| testcase_17 | AC | 1,216 ms
84,136 KB |
| testcase_18 | AC | 205 ms
23,904 KB |
| testcase_19 | AC | 1,022 ms
73,948 KB |
| testcase_20 | AC | 62 ms
10,624 KB |
| testcase_21 | AC | 130 ms
16,896 KB |
| testcase_22 | AC | 881 ms
60,848 KB |
| testcase_23 | AC | 453 ms
37,856 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define fi first
#define se second
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 (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(_i, h) { \
rep(_j, w) { \
if (abs(a[_i][_j]) >= INF / 2 and a[_i][_j] <= -INF / 2) \
cerr << '-'; \
if (abs(a[_i][_j]) >= INF / 2) \
cerr << "∞" << sp; \
else \
cerr << a[_i][_j] << sp; \
} \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(_i, n) { \
if (_i) cerr << sp; \
if (abs(a[_i]) >= INF / 2 and a[_i] <= -INF / 2) cerr << '-'; \
if (abs(a[_i]) >= INF / 2) \
cerr << "∞" << sp; \
else \
cerr << a[_i]; \
} \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// Math
inline constexpr ll gcd(const ll a, const ll b) {
return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i)) r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
signed main() {
ll N;
cin >> N;
map<ll, ll> M;
vector<vector<ll>> G(N);
rep(i, N - 1) {
ll A, B;
cin >> A >> B;
A--, B--;
M[B]++;
G[A].pb(B);
}
ll D[N] = {}, sum = 0;
function<ll(ll)> dfs = [&](ll t) {
ll cnt = 0;
each(i, G[t]) {
D[i] = D[t] + 1;
cnt += dfs(i);
}
sum += (cnt + 1) * D[t];
return cnt + 1;
};
rep(i, N) if (!M[i]) dfs(i);
cout << sum % MOD << rt;
}