結果

問題 No.1769 Don't Stop the Game
ユーザー hitonanodehitonanode
提出日時 2021-11-26 23:43:36
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 619 ms / 3,000 ms
コード長 10,692 bytes
コンパイル時間 2,186 ms
コンパイル使用メモリ 202,468 KB
実行使用メモリ 117,228 KB
最終ジャッジ日時 2024-06-29 18:38:58
合計ジャッジ時間 13,062 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 253 ms
46,456 KB
testcase_09 AC 206 ms
36,500 KB
testcase_10 AC 376 ms
62,088 KB
testcase_11 AC 164 ms
33,992 KB
testcase_12 AC 356 ms
56,576 KB
testcase_13 AC 371 ms
57,568 KB
testcase_14 AC 368 ms
57,084 KB
testcase_15 AC 345 ms
56,652 KB
testcase_16 AC 347 ms
56,716 KB
testcase_17 AC 441 ms
62,976 KB
testcase_18 AC 556 ms
84,732 KB
testcase_19 AC 589 ms
95,872 KB
testcase_20 AC 614 ms
97,800 KB
testcase_21 AC 619 ms
97,728 KB
testcase_22 AC 599 ms
97,920 KB
testcase_23 AC 341 ms
58,176 KB
testcase_24 AC 356 ms
58,240 KB
testcase_25 AC 122 ms
58,892 KB
testcase_26 AC 447 ms
98,500 KB
testcase_27 AC 223 ms
81,960 KB
testcase_28 AC 489 ms
117,228 KB
testcase_29 AC 472 ms
109,508 KB
testcase_30 AC 492 ms
109,532 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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 <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> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename 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 <typename 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 <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, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
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, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &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, typename TH> ostream &operator<<(ostream &os, const 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) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) (x)
#define dbgif(cond, x) 0
#endif

// lowest common ancestor (LCA) for undirected weighted tree
template <typename T> struct UndirectedWeightedTree {
    int INVALID = -1;
    int V, lgV;
    int E;
    int root;
    std::vector<std::vector<std::pair<int, int>>> adj; // (nxt_vertex, edge_id)
    // vector<pint> edge; // edges[edge_id] = (vertex_id, vertex_id)
    std::vector<T> weight;     // w[edge_id]
    std::vector<int> par;      // parent_vertex_id[vertex_id]
    std::vector<int> depth;    // depth_from_root[vertex_id]
    std::vector<T> acc_weight; // w_sum_from_root[vertex_id]

    void _fix_root_dfs(int now, int prv, int prv_edge_id) {
        par[now] = prv;
        if (prv_edge_id != INVALID) acc_weight[now] = acc_weight[prv] + weight[prv_edge_id];
        for (auto nxt : adj[now])
            if (nxt.first != prv) {
                depth[nxt.first] = depth[now] + 1;
                _fix_root_dfs(nxt.first, now, nxt.second);
            }
    }

    UndirectedWeightedTree() = default;
    UndirectedWeightedTree(int N) : V(N), E(0), adj(N) {
        lgV = 1;
        while (1 << lgV < V) lgV++;
    }

    void add_edge(int u, int v, T w) {
        adj[u].emplace_back(v, E);
        adj[v].emplace_back(u, E);
        // edge.emplace_back(u, v);
        weight.emplace_back(w);
        E++;
    }

    std::vector<std::vector<int>> doubling;
    void _doubling_precalc() {
        doubling.assign(lgV, std::vector<int>(V));
        doubling[0] = par;
        for (int d = 0; d < lgV - 1; d++)
            for (int i = 0; i < V; i++) {
                if (doubling[d][i] == INVALID)
                    doubling[d + 1][i] = INVALID;
                else
                    doubling[d + 1][i] = doubling[d][doubling[d][i]];
            }
    }

    void fix_root(int r) {
        root = r;
        par.resize(V);
        depth.resize(V);
        depth[r] = 0;
        acc_weight.resize(V);
        acc_weight[r] = 0;
        _fix_root_dfs(root, INVALID, INVALID);
        _doubling_precalc();
    }

    int kth_parent(int x, int k) {
        if (depth[x] < k) return INVALID;
        for (int d = 0; d < lgV; d++) {
            if (x == INVALID) return INVALID;
            if (k & (1 << d)) x = doubling[d][x];
        }
        return x;
    }

    int lowest_common_ancestor(int u, int v) {
        if (depth[u] > depth[v]) std::swap(u, v);

        v = kth_parent(v, depth[v] - depth[u]);
        if (u == v) return u;
        for (int d = lgV - 1; d >= 0; d--) {
            if (doubling[d][u] != doubling[d][v]) u = doubling[d][u], v = doubling[d][v];
        }
        return par[u];
    }

    T path_length(int u, int v) {
        // Not distance, but the sum of weights
        int r = lowest_common_ancestor(u, v);
        return (acc_weight[u] - acc_weight[r]) + (acc_weight[v] - acc_weight[r]);
    }
};


int main() {
    int N;
    cin >> N;
    vector<vector<pint>> to(N);
    UndirectedWeightedTree<int> tree(N);
    REP(i, N - 1) {
        int a, b, c;
        cin >> a >> b >> c;
        --a, --b;
        to[a].emplace_back(b, c);
        to[b].emplace_back(a, c);
        tree.add_edge(a, b, 1);
    }
    dbg(to);
    map<int, vector<int>> mp;
    vector<int> depth(N), cw(N);
    vector<int> stsz(N);
    vector<int> par(N, -1);
    auto rec = [&](auto &&self, int now, int prv) -> int {
        mp[cw[now]].push_back(now);
        for (auto [nxt, w] : to[now]) {
            if (nxt == prv) continue;
            par[nxt] = now;
            depth[nxt] = depth[now] + 1;
            cw[nxt] = cw[now] ^ w;
            stsz[now] += self(self, nxt, now);
        }
        stsz[now]++;
        return stsz[now];
    };
    const int root = 0;
    tree.fix_root(root);
    rec(rec, root, -1);

    dbg(mp);
    dbg(stsz);

    vector<vector<int>> to2(N);
    vector<int> is_not_root(N);
    for (auto [w, is] : mp) {
        vector<int> st;
        for (auto i : is) {
            while (st.size() and tree.lowest_common_ancestor(st.back(), i) != st.back()) st.pop_back();
            if (st.size()) {
                is_not_root[i] = 1;
                to2[st.back()].push_back(i);
            }
            st.push_back(i);
        }
    }
    dbg(to2);

    vector<int> visited(N);
    lint ret = 0;
    map<int, vector<int>> rmp;
    REP(i, N) {
        if (is_not_root[i]) continue;
        if (visited[i]) continue;
        // ret += N - stsz[i];
        rmp[cw[i]].push_back(i);

        auto rec = [&](auto &&self, int now, int prv) -> void {
            visited[now] = 1;
            vector<int> chs;
            for (auto [nxt, w] : to[now]) {
                if (nxt == par[now]) continue;
                chs.push_back(nxt);
            }
            sort(ALL(chs));
            vector<int> cntr(chs.size());
            vector<int> szs;
            for (auto c : chs) szs.push_back(stsz[c]);

            for (auto nxt : to2[now]) {
                self(self, nxt, now);
                int l = tree.path_length(nxt, now) - 1;
                int k = tree.kth_parent(nxt, l);
                k = arglb(chs, k);
                cntr[k]++;
                szs[k] -= stsz[nxt];
            }
            REP(i, chs.size()) {
                ret += lint(szs[i]) * (cntr[i] + 1);
            }
        };
        rec(rec, i, -1);
    }
    for (auto [w, is] : rmp) {
        lint sz = N;
        for (auto i : is) sz -= stsz[i];
        lint tmp2 = sz * is.size();
        dbg(is);
        dbg(tmp2);
        ret += sz * lint(is.size());
    }
    cout << ret << '\n';
}
0