結果
問題 | No.1002 Twotone |
ユーザー | hitonanode |
提出日時 | 2022-09-25 05:00:17 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,398 ms / 5,000 ms |
コード長 | 11,967 bytes |
コンパイル時間 | 2,556 ms |
コンパイル使用メモリ | 200,368 KB |
実行使用メモリ | 65,532 KB |
最終ジャッジ日時 | 2024-12-22 12:43:41 |
合計ジャッジ時間 | 22,794 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 430 ms
31,824 KB |
testcase_04 | AC | 612 ms
40,348 KB |
testcase_05 | AC | 616 ms
40,212 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 339 ms
26,508 KB |
testcase_08 | AC | 632 ms
41,600 KB |
testcase_09 | AC | 631 ms
41,636 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 681 ms
33,284 KB |
testcase_12 | AC | 1,002 ms
42,368 KB |
testcase_13 | AC | 1,029 ms
42,240 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 478 ms
25,632 KB |
testcase_16 | AC | 1,026 ms
42,240 KB |
testcase_17 | AC | 1,050 ms
42,372 KB |
testcase_18 | AC | 2 ms
5,248 KB |
testcase_19 | AC | 850 ms
48,212 KB |
testcase_20 | AC | 1,042 ms
65,532 KB |
testcase_21 | AC | 1,053 ms
64,328 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 756 ms
37,672 KB |
testcase_24 | AC | 1,396 ms
61,512 KB |
testcase_25 | AC | 1,398 ms
57,712 KB |
testcase_26 | AC | 2 ms
5,248 KB |
testcase_27 | AC | 107 ms
27,204 KB |
testcase_28 | AC | 219 ms
39,172 KB |
testcase_29 | AC | 175 ms
39,172 KB |
testcase_30 | AC | 2 ms
5,248 KB |
testcase_31 | AC | 166 ms
38,976 KB |
testcase_32 | AC | 235 ms
39,172 KB |
testcase_33 | AC | 179 ms
39,172 KB |
testcase_34 | AC | 756 ms
64,596 KB |
ソースコード
#include <algorithm> #include <array> #include <bitset> #include <cassert> #include <chrono> #include <cmath> #include <complex> #include <deque> #include <forward_list> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iostream> #include <limits> #include <list> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <string> #include <tuple> #include <type_traits> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> 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, typename V> void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); } template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); } template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; } template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; } int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); } template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); } template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); } template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); } template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec); template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr); template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec); template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa); template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec); template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec); template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec); template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec); template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa); template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp); template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp); template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl); template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } #if __cplusplus >= 201703L template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; } #endif template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; } template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl #define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr) #else #define dbg(x) ((void)0) #define dbgif(cond, x) ((void)0) #endif struct CentroidDecomposition { int NO_PARENT = -1; int V; int E; std::vector<std::vector<std::pair<int, int>>> to; // (node_id, edge_id) std::vector<int> par; // parent node_id par[root] = -1 std::vector<std::vector<int>> chi; // children id's std::vector<int> subtree_size; // size of each subtree std::vector<int> available_edge; // If 0, ignore the corresponding edge. CentroidDecomposition(int v = 0) : V(v), E(0), to(v), par(v, NO_PARENT), chi(v), subtree_size(v) {} CentroidDecomposition(const std::vector<std::vector<int>> &to_) : CentroidDecomposition(to_.size()) { for (int i = 0; i < V; i++) { for (auto j : to_[i]) { if (i < j) { add_edge(i, j); } } } } void add_edge(int v1, int v2) { to[v1].emplace_back(v2, E), to[v2].emplace_back(v1, E), E++; available_edge.emplace_back(1); } int _dfs_fixroot(int now, int prv) { chi[now].clear(), subtree_size[now] = 1; for (auto nxt : to[now]) { if (nxt.first != prv and available_edge[nxt.second]) { par[nxt.first] = now, chi[now].push_back(nxt.first); subtree_size[now] += _dfs_fixroot(nxt.first, now); } } return subtree_size[now]; } void fix_root(int root) { par[root] = NO_PARENT; _dfs_fixroot(root, -1); } //// Centroid Decpmposition //// std::vector<int> centroid_cand_tmp; void _dfs_detect_centroids(int now, int prv, int n) { bool is_centroid = true; for (auto nxt : to[now]) { if (nxt.first != prv and available_edge[nxt.second]) { _dfs_detect_centroids(nxt.first, now, n); if (subtree_size[nxt.first] > n / 2) is_centroid = false; } } if (n - subtree_size[now] > n / 2) is_centroid = false; if (is_centroid) centroid_cand_tmp.push_back(now); } std::pair<int, int> detect_centroids(int r) { // ([centroid_node_id1], ([centroid_node_id2]|-1)) centroid_cand_tmp.clear(); while (par[r] != NO_PARENT) r = par[r]; int n = subtree_size[r]; _dfs_detect_centroids(r, -1, n); if (centroid_cand_tmp.size() == 1) return std::make_pair(centroid_cand_tmp[0], -1); else return std::make_pair(centroid_cand_tmp[0], centroid_cand_tmp[1]); } std::vector<int> _cd_vertices; void _centroid_decomposition(int now) { fix_root(now); now = detect_centroids(now).first; _cd_vertices.emplace_back(now); /* do something */ for (auto p : to[now]) { int nxt, eid; std::tie(nxt, eid) = p; if (available_edge[eid] == 0) continue; available_edge[eid] = 0; _centroid_decomposition(nxt); } } std::vector<int> centroid_decomposition(int x) { _cd_vertices.clear(); _centroid_decomposition(x); return _cd_vertices; } }; int main() { int N, K; cin >> N >> K; CentroidDecomposition cd(N); vector<vector<pint>> to(N); REP(e, N - 1) { int u, v, c; cin >> u >> v >> c; --u, --v, --c; cd.add_edge(u, v); to.at(u).emplace_back(v, c); to.at(v).emplace_back(u, c); } vector<int> alive(N, 1); lint ret = 0; for (const int root : cd.centroid_decomposition(0)) { alive.at(root) = 0; unordered_map<int, int> cnt1; int cnt1sum = 0; map<pint, int> cnt2; unordered_map<int, int> cnt2half; vector<pint> st; auto rec = [&](auto &&self, int now, int prv, int c1, int c2) -> void { // assert(c1 > c2); if (c1 >= 0 and c2 >= 0) ++ret; if (c2 >= 0) { if (cnt2.count(minmax(c1, c2))) ret += cnt2[minmax(c1, c2)]; if (cnt1.count(c1)) ret += cnt1[c1]; if (cnt1.count(c2)) ret += cnt1[c2]; } else { ret += cnt1sum - (cnt1.count(c1) ? cnt1[c1] : 0); if (cnt2half.count(c1)) ret += cnt2half[c1]; } for (auto [nxt, nxtc] : to[now]) { if (nxt == prv) continue; if (!alive.at(nxt)) continue; if (c2 >= 0 and c1 != nxtc and c2 != nxtc) continue; if (nxtc == c1 or nxtc == c2) { self(self, nxt, now, c1, c2); } else if (c2 == -1 and c1 != nxtc) { self(self, nxt, now, c1, nxtc); } else { exit(1); } } st.emplace_back(c1, c2); }; for (auto [nxt, c] : to.at(root)) { if (!alive.at(nxt)) continue; rec(rec, nxt, root, c, -1); for (auto [c1, c2] : st) { if (c2 >= 0) cnt2[minmax(c1, c2)]++, cnt2half[c1]++, cnt2half[c2]++; if (c2 < 0) cnt1[c1]++, cnt1sum++; } st.clear(); } dbg(make_tuple(root, ret)); } cout << ret << endl; }