結果
問題 | No.2638 Initial fare |
ユーザー | miscalc |
提出日時 | 2024-02-19 21:45:20 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 373 ms / 2,000 ms |
コード長 | 3,611 bytes |
コンパイル時間 | 4,478 ms |
コンパイル使用メモリ | 267,860 KB |
実行使用メモリ | 39,868 KB |
最終ジャッジ日時 | 2024-09-29 01:40:28 |
合計ジャッジ時間 | 10,635 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
01_ | AC * 3 |
other | AC * 25 |
入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 3 ms
6,820 KB |
testcase_03 | AC | 3 ms
6,816 KB |
testcase_04 | AC | 276 ms
31,112 KB |
testcase_05 | AC | 307 ms
32,648 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 230 ms
31,996 KB |
testcase_08 | AC | 180 ms
30,528 KB |
testcase_09 | AC | 193 ms
32,668 KB |
testcase_10 | AC | 187 ms
32,872 KB |
testcase_11 | AC | 2 ms
6,820 KB |
testcase_12 | AC | 242 ms
31,648 KB |
testcase_13 | AC | 170 ms
29,108 KB |
testcase_14 | AC | 201 ms
32,428 KB |
testcase_15 | AC | 190 ms
32,992 KB |
testcase_16 | AC | 2 ms
6,816 KB |
testcase_17 | AC | 213 ms
31,944 KB |
testcase_18 | AC | 186 ms
31,252 KB |
testcase_19 | AC | 257 ms
33,488 KB |
testcase_20 | AC | 251 ms
32,512 KB |
testcase_21 | AC | 280 ms
33,556 KB |
testcase_22 | AC | 2 ms
6,816 KB |
testcase_23 | AC | 323 ms
39,868 KB |
testcase_24 | AC | 366 ms
38,988 KB |
testcase_25 | AC | 2 ms
6,816 KB |
testcase_26 | AC | 337 ms
37,512 KB |
testcase_27 | AC | 373 ms
39,292 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using ull = unsigned long long;using pll = pair<ll, ll>;using tlll = tuple<ll, ll, ll>;constexpr ll INF = 1LL << 60;template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;}return res;}ll mul_limited(ll A, ll B, ll M = INF) { return B == 0 ? 0 : A > M / B ? M : A * B; }ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *=A;} return res;}template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)//*#include <atcoder/all>using namespace atcoder;template <class T, internal::is_static_modint_t<T> * = nullptr>istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }template <class T, internal::is_dynamic_modint_t<T> * = nullptr>istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }template <class T, internal::is_static_modint_t<T> * = nullptr>ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }template <class T, internal::is_dynamic_modint_t<T> * = nullptr>ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }using mint = modint998244353;//using mint = modint1000000007;//using mint = modint;//*/template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " "); cout<< '\n';}template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}int main(){ll N;cin >> N;vector<vector<ll>> G(N + 3);for (ll i = N; i < N + 2; i++){G.at(i).push_back(i + 1);}G.at(N + 2).push_back(0);for (ll i = 0; i < N - 1; i++){ll u, v;cin >> u >> v;u--, v--;G.at(u).push_back(v);G.at(v).push_back(u);}vector<ll> par(N + 3, -1), dep(N + 3, 0);auto dfs = [&](auto self, ll v, ll pv) -> void{par.at(v) = pv;dep.at(v) = (pv < 0 ? 0 : dep.at(pv) + 1);for (auto nv : G.at(v)){if (nv == pv)continue;self(self, nv, v);}};dfs(dfs, N, -1);// cnt[v][d] := v から下に距離 d の頂点の個数vector<vector<ll>> cnt(N + 3, vector<ll>(4, 0));for (ll v = 0; v < N + 3; v++){ll p = v;for (ll k = 0; k < 4; k++){if (p < 0)break;cnt.at(p).at(k)++;p = par.at(p);}}/*printvec2(cnt);//*/ll ans = 0;for (ll v = 0; v < N; v++){ll p = v;for (ll k = 3; k >= 0; k--){if (p < 0)break;ans += cnt.at(p).at(k);if (k > 0)ans += cnt.at(p).at(k - 1);p = par.at(p);}ans--;ans -= max(0LL, 6 - dep.at(v));}cout << ans / 2 << endl;}