結果
問題 | No.2360 Path to Integer |
ユーザー |
|
提出日時 | 2023-06-23 22:33:07 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 71 ms / 2,500 ms |
コード長 | 3,725 bytes |
コンパイル時間 | 2,323 ms |
コンパイル使用メモリ | 204,388 KB |
最終ジャッジ日時 | 2025-02-15 01:19:01 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 15 |
ソースコード
#include "bits/stdc++.h"using namespace std;#define all(x) begin(x),end(x)template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type>ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }#define debug(a) cerr << "(" << #a << ": " << a << ")\n";typedef long long ll;typedef vector<int> vi;typedef vector<vi> vvi;typedef pair<int,int> pi;const int mxN = 1e5+1, oo = 1e9;const long long MD = 998244353;template<long long MOD=MD> struct mdint {int d=0;mdint () {d=0;}mdint (long long _d) : d(_d%MOD){if(d<0) d+=MOD;};friend mdint& operator+=(mdint& a, const mdint& o) {a.d+=o.d; if(a.d>=MOD) a.d-=MOD;return a;}friend mdint& operator-=(mdint& a, const mdint& o) {a.d-=o.d; if(a.d<0) a.d+=MOD;return a;}friend mdint& operator*=(mdint& a, const mdint& o) {return a = mdint((ll)a.d*o.d);}mdint operator*(const mdint& o) const {mdint res = *this;res*=o;return res;}mdint operator+(const mdint& o) const {mdint res = *this;res+=o;return res;}mdint operator-(const mdint& o) const {mdint res = *this;res-=o;return res;}mdint operator^(long long b) const {mdint tmp = 1;mdint power = *this;while(b) {if(b&1) {tmp = tmp*power;}power = power*power;b/=2;}return tmp;}friend mdint operator/=(mdint& a, const mdint& o) {a *= (o^(MOD-2));return a;}mdint operator/(const mdint& o) {mdint res = *this;res/=o;return res;}bool operator==(const mdint& o) { return d==o.d;}bool operator!=(const mdint& o) { return d!=o.d;}friend istream& operator>>(istream& c, mdint& a) {return c >> a.d;}friend ostream& operator<<(ostream& c, const mdint& a) {return c << a.d;}};using mint = mdint<MD>;int main() {ios_base::sync_with_stdio(false);cin.tie(NULL);int n; cin >> n;vector<mint> a(n);vi len(n);for(int i=0;i<n;++i) {string s; cin >> s;len[i]=s.size();a[i]=stoll(s);}vvi adj(n);for(int i=1;i<n;++i) {int u,v; cin >> u >> v;--u,--v;adj[u].push_back(v);adj[v].push_back(u);}vector<mint> up(n);vector<mint> pw(max(22,n+1),1);vi sz(n,1);for(int i=1;i<pw.size();++i) pw[i]=pw[i-1]*10;auto dfs = [&](auto&& self, int at, int from) -> void {up[at]=1;for(int to : adj[at]) if(to!=from) {self(self,to,at);up[at]+=up[to]*pw[len[to]];sz[at]+=sz[to];}};dfs(dfs,0,-1);vector<mint> down(n);mint ans=0;auto dfs2 = [&](auto&& self, int at, int from) -> void {if(from!=-1) {auto cur1 = up[from]-up[at]*pw[len[at]];auto cur2 = down[from];// debug(at);// debug(cur1);// debug(cur2);down[at] =(cur1+cur2)*pw[len[from]];} else down[at]=0;ans+=a[at]*n;ans+=(down[at]*sz[at])*a[at];for(int to : adj[at]) if(to!=from) {ans+=up[to]*pw[len[to]]*(n-sz[to])*a[at];self(self,to,at);}};dfs2(dfs2,0,-1);cout << ans << '\n';}