結果

問題 No.2360 Path to Integer
ユーザー apricity
提出日時 2023-06-26 11:35:36
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 153 ms / 2,500 ms
コード長 6,187 bytes
コンパイル時間 1,422 ms
コンパイル使用メモリ 134,392 KB
最終ジャッジ日時 2025-02-15 02:22:24
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>
#ifdef LOCAL
# include "debug_print.hpp"
# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
# define debug(...) (static_cast<void>(0))
#endif
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}
template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
cout << t;
outr(u...);
}
template<int mod> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % mod) {
if (val < 0) val += mod;
}
constexpr int getmod() { return mod; }
constexpr Fp operator - () const noexcept {
return val ? mod - val : 0;
}
constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
constexpr Fp& operator += (const Fp& r) noexcept {
val += r.val;
if (val >= mod) val -= mod;
return *this;
}
constexpr Fp& operator -= (const Fp& r) noexcept {
val -= r.val;
if (val < 0) val += mod;
return *this;
}
constexpr Fp& operator *= (const Fp& r) noexcept {
val = val * r.val % mod;
return *this;
}
constexpr Fp& operator /= (const Fp& r) noexcept {
long long a = r.val, b = mod, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
val = val * u % mod;
if (val < 0) val += mod;
return *this;
}
constexpr bool operator == (const Fp& r) const noexcept {
return this->val == r.val;
}
constexpr bool operator != (const Fp& r) const noexcept {
return this->val != r.val;
}
friend constexpr istream& operator >> (istream &is, const Fp<mod>& x) noexcept {
int val; is >> val;
x = Fp<mod>(val);
return is;
}
friend constexpr ostream& operator << (ostream &os, const Fp<mod>& x) noexcept {
return os << x.val;
}
friend constexpr Fp<mod> modpow(const Fp<mod> &a, long long n) noexcept {
if (n == 0) return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1) t = t * a;
return t;
}
};
//const int mod = 1e9+7;
const int mod = 998244353;
using mint = Fp<mod>;
const int MAX_N = 100005;
vector<ll> a(MAX_N);
vector<mint> ten(11);
vector<int> g[MAX_N];
struct var {
mint dp; mint sz;
var(mint dp = 0, mint sz = 0): dp(dp), sz(sz) {}
var operator+ (const var& a) const {
return {dp + a.dp, sz + a.sz};
}
var addRoot(const int u) const {
return {dp * ten[to_string(a[u]).size()] + (sz+1)*a[u], sz+1};
}
};
vector<var> dp[MAX_N];
var ans[MAX_N];
var dfs1(int v, int p = -1) {
var dpsum;
dp[v] = vector<var> (g[v].size());
rep(i, g[v].size()) {
int u = g[v][i];
if(u == p) continue;
dp[v][i] = dfs1(u, v);
dpsum = dpsum + dp[v][i];
}
return dpsum.addRoot(v);
}
void dfs2(int v, const var& dpParent = var(), int p = -1) {
int deg = g[v].size();
rep(i, deg) if(g[v][i] == p) dp[v][i] = dpParent;
vector<var> dpSum_Left(deg+1), dpSum_Right(deg+1);
rep(i,deg) dpSum_Left[i+1] = dpSum_Left[i] + dp[v][i];
rrep(i, deg) dpSum_Right[i] = dpSum_Right[i+1] + dp[v][i];
ans[v] = dpSum_Left[deg].addRoot(v);
rep(i,deg) {
int u = g[v][i];
if(u == p) continue;
var d = dpSum_Left[i] + dpSum_Right[i+1];
dfs2(u, d.addRoot(v), v);
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n; in(n);
a.resize(n); in(a);
rep(i,n-1){
int u,v; in(u,v); u--; v--;
g[u].pb(v);
g[v].pb(u);
}
ten[0] = 1;
rep(i,10) ten[i+1] = ten[i] * 10;
dfs1(0);
dfs2(0);
mint res = 0;
rep(i,n) res += ans[i].dp;
out(res);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0