結果
問題 | No.2638 Initial fare |
ユーザー | ebi_fly |
提出日時 | 2024-02-19 21:30:19 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 154 ms / 2,000 ms |
コード長 | 5,165 bytes |
コンパイル時間 | 3,009 ms |
コンパイル使用メモリ | 252,712 KB |
実行使用メモリ | 20,620 KB |
最終ジャッジ日時 | 2024-09-29 01:26:24 |
合計ジャッジ時間 | 6,321 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | AC | 121 ms
14,580 KB |
testcase_05 | AC | 128 ms
15,192 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 104 ms
15,084 KB |
testcase_08 | AC | 72 ms
14,640 KB |
testcase_09 | AC | 84 ms
15,648 KB |
testcase_10 | AC | 86 ms
15,772 KB |
testcase_11 | AC | 2 ms
6,820 KB |
testcase_12 | AC | 102 ms
14,880 KB |
testcase_13 | AC | 68 ms
14,048 KB |
testcase_14 | AC | 86 ms
15,568 KB |
testcase_15 | AC | 83 ms
15,564 KB |
testcase_16 | AC | 2 ms
6,816 KB |
testcase_17 | AC | 98 ms
15,248 KB |
testcase_18 | AC | 82 ms
15,068 KB |
testcase_19 | AC | 105 ms
16,080 KB |
testcase_20 | AC | 117 ms
15,428 KB |
testcase_21 | AC | 119 ms
15,944 KB |
testcase_22 | AC | 2 ms
6,820 KB |
testcase_23 | AC | 147 ms
20,620 KB |
testcase_24 | AC | 154 ms
19,816 KB |
testcase_25 | AC | 2 ms
6,820 KB |
testcase_26 | AC | 124 ms
18,308 KB |
testcase_27 | AC | 127 ms
19,820 KB |
ソースコード
#line 1 "template/template.hpp"#include <bits/stdc++.h>#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)#define all(v) (v).begin(), (v).end()#define rall(v) (v).rbegin(), (v).rend()#line 2 "template/debug_template.hpp"#line 4 "template/debug_template.hpp"namespace ebi {#ifdef LOCAL#define debug(...) \std::cerr << "LINE: " << __LINE__ << " [" << #__VA_ARGS__ << "]:", \debug_out(__VA_ARGS__)#else#define debug(...)#endifvoid debug_out() {std::cerr << std::endl;}template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {std::cerr << " " << h;if (sizeof...(t) > 0) std::cerr << " :";debug_out(t...);}} // namespace ebi#line 2 "template/int_alias.hpp"#line 4 "template/int_alias.hpp"namespace ebi {using ld = long double;using std::size_t;using i8 = std::int8_t;using u8 = std::uint8_t;using i16 = std::int16_t;using u16 = std::uint16_t;using i32 = std::int32_t;using u32 = std::uint32_t;using i64 = std::int64_t;using u64 = std::uint64_t;using i128 = __int128_t;using u128 = __uint128_t;} // namespace ebi#line 2 "template/io.hpp"#line 5 "template/io.hpp"#include <optional>#line 7 "template/io.hpp"namespace ebi {template <typename T1, typename T2>std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {return os << pa.first << " " << pa.second;}template <typename T1, typename T2>std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {return os >> pa.first >> pa.second;}template <typename T>std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");return os;}template <typename T>std::istream &operator>>(std::istream &os, std::vector<T> &vec) {for (T &e : vec) std::cin >> e;return os;}template <typename T>std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {if (opt) {os << opt.value();} else {os << "invalid value";}return os;}void fast_io() {std::cout << std::fixed << std::setprecision(15);std::cin.tie(nullptr);std::ios::sync_with_stdio(false);}} // namespace ebi#line 2 "template/utility.hpp"#line 5 "template/utility.hpp"#line 2 "graph/template.hpp"#line 4 "graph/template.hpp"namespace ebi {template <class T> struct Edge {int to;T cost;Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}};template <class T> struct Graph : std::vector<std::vector<Edge<T>>> {using std::vector<std::vector<Edge<T>>>::vector;void add_edge(int u, int v, T w, bool directed = false) {(*this)[u].emplace_back(v, w);if (directed) return;(*this)[v].emplace_back(u, w);}};struct graph : std::vector<std::vector<int>> {using std::vector<std::vector<int>>::vector;void add_edge(int u, int v, bool directed = false) {(*this)[u].emplace_back(v);if (directed) return;(*this)[v].emplace_back(u);}};} // namespace ebi#line 8 "template/utility.hpp"namespace ebi {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;}template <class T> T safe_ceil(T a, T b) {if (a % b == 0)return a / b;else if (a >= 0)return (a / b) + 1;elsereturn -((-a) / b);}template <class T> T safe_floor(T a, T b) {if (a % b == 0)return a / b;else if (a >= 0)return a / b;elsereturn -((-a) / b) - 1;}constexpr i64 LNF = std::numeric_limits<i64>::max() / 4;constexpr int INF = std::numeric_limits<int>::max() / 2;const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};} // namespace ebi#line 2 "a.cpp"namespace ebi {void main_() {int n;std::cin >> n;graph g(n);rep(i,0,n-1) {int u,v;std::cin >> u >> v;u--; v--;g.add_edge(u, v);}std::vector<int> par(n, -1);auto dfs = [&](auto &&self, int v) -> void {for(auto nv: g[v]) {if(nv == par[v]) continue;par[nv] = v;self(self, nv);}};dfs(dfs, 0);i64 ans = n-1;// 2kmrep(i,0,n) {i64 d = g[i].size();ans += d * (d - 1) / 2;}// 3kmrep(i,0,n) {if(par[i] == -1) continue;ans += i64(g[i].size() - 1) * i64(g[par[i]].size() - 1);}std::cout << ans << '\n';}} // namespace ebiint main() {ebi::fast_io();int t = 1;// std::cin >> t;while (t--) {ebi::main_();}return 0;}