#939204 (C++17) No.2598 Kadomatsu on Tree

• 問題: No.2598 Kadomatsu on Tree
• ユーザー: 👑 AngrySadEight
• 提出日時: 2023-12-19 17:22:57
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 359 ms / 2,000 ms
• コード長: 4,892 bytes
• コンパイル時間: 5,896 ms
• コンパイル使用メモリ: 225,192 KB
• 実行使用メモリ: 35,220 KB
• 最終ジャッジ日時: 2024-09-27 17:14:22
• 合計ジャッジ時間: 20,755 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	2 ms; 6,940 KB
testcase_04	AC	2 ms; 6,944 KB
testcase_05	AC	2 ms; 6,944 KB
testcase_06	AC	2 ms; 6,944 KB
testcase_07	AC	2 ms; 6,944 KB
testcase_08	AC	2 ms; 6,940 KB
testcase_09	AC	2 ms; 6,944 KB
testcase_10	AC	2 ms; 6,944 KB
testcase_11	AC	2 ms; 6,944 KB
testcase_12	AC	2 ms; 6,944 KB
testcase_13	AC	6 ms; 6,940 KB
testcase_14	AC	8 ms; 6,940 KB
testcase_15	AC	6 ms; 6,940 KB
testcase_16	AC	8 ms; 6,940 KB
testcase_17	AC	4 ms; 6,940 KB
testcase_18	AC	7 ms; 6,944 KB
testcase_19	AC	7 ms; 6,940 KB
testcase_20	AC	5 ms; 6,944 KB
testcase_21	AC	6 ms; 6,944 KB
testcase_22	AC	7 ms; 6,940 KB
testcase_23	AC	326 ms; 22,392 KB
testcase_24	AC	351 ms; 22,828 KB
testcase_25	AC	347 ms; 22,788 KB
testcase_26	AC	335 ms; 22,324 KB
testcase_27	AC	332 ms; 22,528 KB
testcase_28	AC	338 ms; 22,704 KB
testcase_29	AC	341 ms; 22,760 KB
testcase_30	AC	344 ms; 22,324 KB
testcase_31	AC	339 ms; 22,840 KB
testcase_32	AC	349 ms; 22,520 KB
testcase_33	AC	355 ms; 22,976 KB
testcase_34	AC	340 ms; 22,208 KB
testcase_35	AC	345 ms; 23,052 KB
testcase_36	AC	336 ms; 23,092 KB
testcase_37	AC	336 ms; 22,992 KB
testcase_38	AC	344 ms; 23,148 KB
testcase_39	AC	339 ms; 23,124 KB
testcase_40	AC	337 ms; 22,992 KB
testcase_41	AC	351 ms; 23,172 KB
testcase_42	AC	353 ms; 23,148 KB
testcase_43	AC	348 ms; 23,164 KB
testcase_44	AC	359 ms; 23,128 KB
testcase_45	AC	352 ms; 23,176 KB
testcase_46	AC	350 ms; 23,144 KB
testcase_47	AC	352 ms; 23,056 KB
testcase_48	AC	351 ms; 34,100 KB
testcase_49	AC	26 ms; 6,944 KB
testcase_50	AC	217 ms; 22,904 KB
testcase_51	AC	54 ms; 9,856 KB
testcase_52	AC	92 ms; 11,904 KB
testcase_53	AC	107 ms; 11,788 KB
testcase_54	AC	88 ms; 10,352 KB
testcase_55	AC	35 ms; 6,944 KB
testcase_56	AC	163 ms; 16,104 KB
testcase_57	AC	59 ms; 8,104 KB
testcase_58	AC	332 ms; 22,472 KB
testcase_59	AC	331 ms; 22,828 KB
testcase_60	AC	305 ms; 33,112 KB
testcase_61	AC	321 ms; 35,220 KB
testcase_62	AC	301 ms; 31,940 KB

ソースコード

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

void dfs(vector<vector<ll>> &graph, vector<bool> &isvisited, vector<ll> &prev,
         vector<ll> &dp, ll v) {
    isvisited[v] = true;
    ll dp_val = 1;
    for (ll i = 0; i < graph[v].size(); i++) {
        if (isvisited[graph[v][i]]) {
            continue;
        }
        prev[graph[v][i]] = v;
        dfs(graph, isvisited, prev, dp, graph[v][i]);
        dp_val += dp[graph[v][i]];
    }
    dp[v] = dp_val;
}

int main() {
    ll N;
    cin >> N;
    vector<ll> U(N - 1);
    vector<ll> V(N - 1);
    for (ll i = 0; i < N - 1; i++) {
        cin >> U[i] >> V[i];
        U[i]--;
        V[i]--;
    }
    vector<vector<ll>> graph(N, vector<ll>(0));
    for (ll i = 0; i < N - 1; i++) {
        graph[U[i]].push_back(V[i]);
        graph[V[i]].push_back(U[i]);
    }
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    // 根つき木を適当にとり，部分木のサイズを求める
    vector<ll> dp(N, 0);
    vector<bool> isvisited(N, false);
    vector<ll> prev(N, -1);
    dfs(graph, isvisited, prev, dp, 0);

    ll ans = 0;
    for (ll i = 0; i < N; i++) {
        ll plus = 0;
        ll minus = 0;

        ll rem = N - 1;
        for (ll j = 0; j < graph[i].size(); j++) {
            if (prev[i] != graph[i][j]) {
                rem -= dp[graph[i][j]];
            }
        }
        for (ll j = 0; j < graph[i].size(); j++) {
            ll subsize = dp[graph[i][j]];
            if (prev[i] == graph[i][j]) {
                subsize = rem;
            }
            if (A[i] < A[graph[i][j]]) {
                plus += subsize;
            }
            if (A[i] > A[graph[i][j]]) {
                minus += subsize;
            }
        }
        for (ll j = 0; j < graph[i].size(); j++) {
            ll subsize = dp[graph[i][j]];
            if (prev[i] == graph[i][j]) {
                subsize = rem;
            }
            if (A[i] < A[graph[i][j]]) {
                ans += subsize * (plus - subsize);
                ans %= mod2;
                plus -= subsize;
            }
            if (A[i] > A[graph[i][j]]) {
                ans += subsize * (minus - subsize);
                ans %= mod2;
                minus -= subsize;
            }
        }
        // debug_out(i, plus, minus, ans);
    }
    cout << ans << endl;
}