結果
問題 | No.2360 Path to Integer |
ユーザー |
|
提出日時 | 2023-06-23 23:25:14 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 136 ms / 2,500 ms |
コード長 | 3,773 bytes |
コンパイル時間 | 4,379 ms |
コンパイル使用メモリ | 247,404 KB |
実行使用メモリ | 30,464 KB |
最終ジャッジ日時 | 2024-07-01 03:14:51 |
合計ジャッジ時間 | 6,363 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 15 |
ソースコード
#include "bits/stdc++.h"#include <stdio.h>#include <math.h>#pragma warning(push)#pragma warning(disable:26498 26450 26451 26812)#include "atcoder/all"#pragma warning(pop)//#include <boost/multiprecision/cpp_int.hpp>//using namespace boost::multiprecision;// std::fixed << std::setprecision(10) <<using namespace std;using namespace atcoder;using ll = long long;using ull = unsigned long long;using mint = modint998244353;using mint2 = modint1000000007;const double eps = 1e-9;#define REP(i, n) for (ll i = 0; i < ll(n); ++i)#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)#define REPD(i, init) for (ll i = init; i >=0; --i)#define REPDI(i, init, n) for (ll i = init; i >=n; --i)#define REPE(i, c) for (const auto& i : c)using vl = vector<ll>;#define VL(a, n) vector<ll> a; a.assign(n, 0);#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;using vvl = vector<vector<ll>>;#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);struct uv { ll u; ll v; ll c; };#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }template <class T = long long> using pql = priority_queue<T>;template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;const char* YES = "Yes";const char* NO = "No";void yn(bool f) { std::cout << (f ? YES : NO) << endl; };template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };ll rk(ll n) {ll ret = 0;while (n > 0) {n /= 10;ret++;}return ret;}vl a;vvl ed;vector<vector<pair<mint, ll>>> tdp;vector<mint> ans;pair<mint, ll> dfs(ll n, ll p) {mint ret = 0;ll c = 1;REPE(x, ed[n]) {if (x == p) {tdp[n].push_back({ 0, 0 });continue;}auto p = dfs(x, n);tdp[n].push_back(p);auto v = p.first;auto ci = p.second;ret += v * mint(10).pow(rk(a[n])) + a[n] * ci;c += ci;}ret += a[n];return { ret, c };}void dfs2(ll n, ll p, mint d, ll cp) {mint sum = d;ll csum = cp;REPE(e, tdp[n]) {sum += e.first;csum += e.second;}ans[n] = sum * mint(10).pow(rk(a[n])) + a[n] * csum;REP(i, ed[n].size()) {ll x = ed[n][i];if (x == p) continue;mint xt = tdp[n][i].first;ll ct = tdp[n][i].second;mint nv = (sum - xt) * mint(10).pow(rk(a[n])) + a[n] * (csum - ct + 1);dfs2(x, n, nv, csum - ct + 1);}}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll n;cin >> n;a.assign(n, 0);REP(i, n)cin >> a[i];VUVI(e, n-1);ed = to_edge_d(n, e);tdp.assign(n, {});ans.assign(n, 0);dfs(0, -1);dfs2(0, -1, 0, 0);mint ao = 0;REP(i, n) {ao += ans[i];ao += a[i];}cout << ao.val() << endl;return 0;}