結果

問題 No.2360 Path to Integer
ユーザー siganaisiganai
提出日時 2023-06-23 22:05:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 140 ms / 2,500 ms
コード長 8,699 bytes
コンパイル時間 2,518 ms
コンパイル使用メモリ 217,288 KB
実行使用メモリ 41,344 KB
最終ジャッジ日時 2024-07-01 01:42:32
合計ジャッジ時間 4,446 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 3 ms
6,940 KB
testcase_08 AC 10 ms
6,940 KB
testcase_09 AC 134 ms
12,304 KB
testcase_10 AC 93 ms
15,000 KB
testcase_11 AC 92 ms
15,124 KB
testcase_12 AC 71 ms
12,288 KB
testcase_13 AC 136 ms
12,324 KB
testcase_14 AC 140 ms
35,968 KB
testcase_15 AC 136 ms
12,416 KB
testcase_16 AC 140 ms
41,344 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "main.cpp"
//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
    in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
    ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
//constexpr int mod = 1000000007;
constexpr int mod = 998244353;
#line 2 "library/modint/Modint.hpp"
template <int mod>
struct Modint{
    int x;
    Modint():x(0) {}
    Modint(long long y): x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    Modint &operator += (const Modint &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;}
    Modint &operator -= (const Modint &p) {
        if ((x += mod - p.x) >= mod) x -= mod;
        return *this;}
    Modint &operator *= (const Modint &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;}
    Modint &operator /= (const Modint &p) {
        *this *= p.inverse();
        return *this;}
    Modint operator -() const{return Modint(-x);}
    Modint operator +(const Modint &p) const {return Modint(*this) += p;}
    Modint operator -(const Modint &p) const {return Modint(*this) -= p;}
    Modint operator *(const Modint &p) const {return Modint(*this) *= p;}
    Modint operator /(const Modint &p) const {return Modint(*this) /= p;}
    Modint &operator ++() {if(x == mod - 1) x = 0; else x++; return *this;}
    Modint &operator --() {if(x == 0) x = mod - 1; else x--; return *this;} 
    bool operator == (const Modint &p) const {return x == p.x;}
    bool operator != (const Modint &p) const {return x != p.x;}
    Modint inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return Modint(u);}
    Modint pow(long long n) const {
        Modint ret(1), mul(x);
        while (n > 0) {
            if (n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;}
    friend ostream &operator<<(ostream &os, const Modint &p) { return os << p.x; }
    friend istream &operator>>(istream &is, Modint &a) {
        long long t;
        is >> t;
        a = Modint<mod>(t);
        return (is);
    }
    int get() const { return x; }
    static constexpr int get_mod() {return mod;}
};
#line 86 "main.cpp"
using mint = Modint<mod>;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;
#line 2 "library/tree/Rerooting.hpp"
template <typename T, typename G, typename F1, typename F2>
struct Rerooting {
    const G &g;
    const F1 f1;
    const F2 f2;
    vector<T> memo,memo2,dp;
    T I;

    Rerooting(const G &_g, const F1 _f1, const F2 _f2, const T &I_)
        : g(_g), f1(_f1), f2(_f2), memo(g.size(), I_), memo2(g.size(),I_),dp(g.size(), I_), I(I_) {
        dfs(0, -1);
        efs(0, -1, I);
    }
    const T &operator[](int i) const { return dp[i]; }
    void dfs(int cur, int par) {
        for (auto &dst : g[cur]) {
            if (dst == par) continue;
            dfs(dst, cur);
            memo[cur] = f1(memo[cur], f2(memo[dst], dst, cur));
        }
    }
    void efs(int cur, int par, const T &pval) {
        // get cumulative sum
        vector<T> buf;
        for (auto dst : g[cur]) {
            if (dst == par) continue;
            buf.push_back(f2(memo[dst], dst, cur));
        }
        vector<T> head(buf.size() + 1), tail(buf.size() + 1);
        head[0] = tail[buf.size()] = I;
        for (int i = 0; i < (int)buf.size(); i++) head[i + 1] = f1(head[i], buf[i]);
        for (int i = (int)buf.size() - 1; i >= 0; i--) tail[i] = f1(tail[i + 1], buf[i]);
        memo2[cur] = pval;
        // update
        dp[cur] = par == -1 ? head.back() : f1(pval, head.back());
        // propagate
        int idx = 0;
        for (auto &dst : g[cur]) {
            if (dst == par) continue;
            efs(dst, cur, f2(f1(pval, f1(head[idx], tail[idx + 1])), cur, dst));
            idx++;
        }
    }
};
#line 91 "main.cpp"
int main() {
    INT(n);
    VEC(ll,a,n);
    vvi g(n);
    rep(i,n-1) {
        INT(u,v);
        u--,v--;
        g[u].emplace_back(v);
        g[v].emplace_back(u);
    }
    vi len(n);
    rep(i,n) {
        len[i] = to_string(a[i]).size();
    }
    using T = pair<mint,mint>;
    // identify element of f1, and answer of leaf
    T I = {0,0};
    
    // merge value of child node
    auto f1 = [&](T x, T y) -> T {
        return {x.first + y.first,x.second + y.second};
    };
    
    // return value from child node to parent node
    auto f2 = [&](T x, int chd, int par) -> T {
        return {x.first * mint(10).pow(len[chd]) + (x.second + 1) * a[chd],x.second + 1};
    };
    Rerooting<T, decltype(g), decltype(f1), decltype(f2)> dp(g,f1,f2,I);
    debug(dp.dp,dp.memo,dp.memo2);
    mint ans;
    rep(i,n) {
        ans += dp.dp[i].first * mint(10).pow(len[i]) + (dp.dp[i].second + 1) * a[i];
    }
    cout << ans << '\n';
}
0