結果

問題 No.922 東北きりきざむたん
ユーザー 👑 hitonanodehitonanode
提出日時 2019-11-08 21:54:02
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 275 ms / 2,000 ms
コード長 8,339 bytes
コンパイル時間 2,826 ms
コンパイル使用メモリ 203,376 KB
実行使用メモリ 43,352 KB
最終ジャッジ日時 2023-10-13 03:48:43
合計ジャッジ時間 8,596 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,352 KB
testcase_01 AC 2 ms
4,352 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 1 ms
4,348 KB
testcase_04 AC 2 ms
4,348 KB
testcase_05 AC 2 ms
4,348 KB
testcase_06 AC 2 ms
4,348 KB
testcase_07 AC 2 ms
4,348 KB
testcase_08 AC 2 ms
4,352 KB
testcase_09 AC 101 ms
25,964 KB
testcase_10 AC 39 ms
9,584 KB
testcase_11 AC 86 ms
20,712 KB
testcase_12 AC 74 ms
31,708 KB
testcase_13 AC 23 ms
10,248 KB
testcase_14 AC 174 ms
40,568 KB
testcase_15 AC 73 ms
34,288 KB
testcase_16 AC 254 ms
41,176 KB
testcase_17 AC 255 ms
41,164 KB
testcase_18 AC 249 ms
41,212 KB
testcase_19 AC 254 ms
41,180 KB
testcase_20 AC 249 ms
41,400 KB
testcase_21 AC 270 ms
40,788 KB
testcase_22 AC 275 ms
40,688 KB
testcase_23 AC 264 ms
37,568 KB
testcase_24 AC 260 ms
36,976 KB
testcase_25 AC 237 ms
36,800 KB
testcase_26 AC 237 ms
36,816 KB
testcase_27 AC 238 ms
36,720 KB
testcase_28 AC 119 ms
41,084 KB
testcase_29 AC 190 ms
43,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#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> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
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> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
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> ostream &operator<<(ostream &os, const unordered_set<T> &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> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

vector<set<int>> e;

struct UnionFind // UnionFind Tree (0-indexed)
{
    vector<int> par, rank;
    UnionFind(int N) : par(N), rank(N) { REP(i, N) par[i] = i; }
    int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }
    void unite(int x, int y) {
        x = find(x), y = find(y); if (x == y) return;
        if (rank[x] < rank[y]) par[x] = y; else par[y] = x;
        if (rank[x] == rank[y]) rank[x]++;
    }
    bool same(int x, int y) { return find(x) == find(y); }
};

vector<lint> w;
vector<lint> cost;
vector<int> nairport;
vector<lint> costpar;
vector<int> npar;

void dfs(int now, int prv)
{
    nairport[now] += w[now];
    for (auto nxt : e[now]) if (nxt != prv)
    {
        dfs(nxt, now);
        cost[now] += cost[nxt] + nairport[nxt];
        nairport[now] += nairport[nxt];
    }
}

void dfs2(int now, int prv)
{
    for (auto nxt : e[now]) if (nxt != prv)
    {
        costpar[nxt] = cost[now] + costpar[now] + npar[now] + nairport[now] - nairport[nxt] * 2 - cost[nxt];
        npar[nxt] = npar[now] + nairport[now] - nairport[nxt];
        dfs2(nxt, now);
    }
}
class UndirectedWeightedTree
{
    using T = long long int;   // Arbitrary data structure (operator+, operator- must be defined)
    const int INVALID = -1;
    int V, lgV;
    int E;
    int root;
    vector<vector<pair<int, int>>> adj; // (nxt_vertex, edge_id)
    // vector<pint> edge;  // edges[edge_id] = (vertex_id, vertex_id)
    vector<T> weight;  // w[edge_id]
    vector<int> par;  // parent_vertex_id[vertex_id]
    vector<int> depth;  // depth_from_root[vertex_id]
    vector<T> acc_weight;  // w_sum_from_root[vertex_id]

public:
    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(int N = 0): 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++;
    }

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

    vector<vector<int>> doubling;
    void doubling_precalc()
    {
        doubling.assign(lgV, 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]];
        }
    }

    int kth_parent(int x, int k)
    {
        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]) 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, M, Q;
    cin >> N >> M >> Q;
    e.resize(N);
    UnionFind uf(N);
    UndirectedWeightedTree uwt(N);
    REP(_, M)
    {
        int u, v;
        cin >> u >> v;
        u--, v--;
        e[u].insert(v);
        e[v].insert(u);
        uf.unite(u, v);
        uwt.add_edge(u, v, 1);
    }
    set<int> roots;
    REP(i, N) roots.insert(uf.find(i));
    for (auto r : roots) uwt.fix_root(r);
    uwt.doubling_precalc();

    vector<pint> p;
    lint ret = 0;
    w.resize(N);
    nairport.resize(N);
    REP(_, Q)
    {
        int a, b;
        cin >> a >> b;
        a--, b--;
        if (uf.same(a, b))
        {
            ret += uwt.path_length(a, b);
        }
        else
        {
            w[a]++;
            w[b]++;
        }
    }

    cost.resize(N);
    costpar.resize(N);
    npar.resize(N);
    for (auto r : roots)
    {
        dfs(r, -1);
        dfs2(r, -1);
    }
    // dbg(ret);
    map<int, set<lint>> ms;
    // dbg(costpar);
    // dbg(cost);
    REP(i, N) ms[uf.find(i)].insert(costpar[i] + cost[i]);
    for (auto p : ms) ret += *p.second.begin();
    // dbg(ms);
    cout << ret << endl;
}
0