結果

問題 No.2360 Path to Integer
ユーザー ecottea
提出日時 2023-06-24 02:03:08
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 135 ms / 2,500 ms
コード長 10,058 bytes
コンパイル時間 4,280 ms
コンパイル使用メモリ 266,564 KB
最終ジャッジ日時 2025-02-15 01:50:28
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

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

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, 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 vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620;
double EPS = 1e-15;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define YES(b) {cout << ((b) ? "YES\n" : "NO\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
//
template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T get(T set, int i) { return (set >> i) & T(1); }
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define gcd __gcd
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
//O(n + m)
/*
* (, ) n m
*
* n :
* m : n-1
* undirected : true
* one_indexed : 1-indexed true
*/
Graph read_Graph(int n, int m = -1, bool undirected = true, bool one_indexed = true) {
// verify : https://codeforces.com/contest/764/problem/C
Graph g(n);
if (m == -1) m = n - 1;
rep(i, m) {
int a, b;
cin >> a >> b;
if (one_indexed) { --a; --b; }
g[a].push_back(b);
if (undirected) g[b].push_back(a);
}
return g;
}
// DPO(n)
/*
* s∈[0..n) r g
* s
*
* void merge(T& x, T y, int s) :
* s 2 x, y
* x y s
*
* T e() :
* merge()
*
* T leaf(int s) :
* s
*
* T apply(T x, int p, int s) :
* s x
* p→s p
*/
template <class T, void(*merge)(T&, const T&, int), T(*e)(int), T(*leaf)(int), T(*apply)(const T&, int, int)>
vector<T> tree_getDP_vmerge(const Graph& g, int r) {
// verify : https://atcoder.jp/contests/dp/tasks/dp_p
//
// s apply p→s dp[s]
// 2
// verify : https://atcoder.jp/contests/arc029/tasks/arc029_4
int n = sz(g);
vector<T> dp(n);
// s p : s
function<void(int, int)> dfs = [&](int s, int p) {
dp[s] = e(s);
// s
bool is_leef = true;
repe(t, g[s]) {
if (t == p) continue;
is_leef = false;
// t
dfs(t, s);
// t s→t s
T sub = apply(dp[t], s, t);
// s
merge(dp[s], sub, s);
}
// s
if (is_leef) dp[s] = leaf(s);
};
dfs(r, -1);
return dp;
/*
using T = int;
void merge(T& x, const T& y, int s) { chmax(x, y); }
T e() { return 0; }
T leaf(int s) { return 0; }
T apply(const T& x, int p, int s) { return x + 1; }
vector<T> solve_by_tree_getDP(const Graph& g, int r) {
return tree_getDP_vmerge<T, merge, e, leaf, apply>(g, r);
}
*/
};
//O(log n)
/*
* n b
*
* |b| >= 2
*/
vi integer_digits(ll n, int b = 10) {
// verify : https://atcoder.jp/contests/abc105/tasks/abc105_c
Assert(abs(b) >= 2);
// n = 0
if (n == 0) return vi{ 0 };
// mod |b|
vi ds;
while (n != 0) {
int d = smod(n, abs(b));
ds.push_back(d);
n = (n - d) / b;
}
//
reverse(all(ds));
return ds;
}
using T = tuple<mint, mint, mint, mint, mint, mint, mint>;
vector<T> v;
void merge(T& x, const T& y, int s) {
dump("x:", x); dump("y:", y);
auto& [ax, bx, cx, dx, ex, fx, gx] = x;
auto [ay, by, cy, dy, ey, fy, gy] = y;
auto [as, bs, cs, ds, es, fs, gs] = v[s];
mint a = ax + ay - as;
mint b = bx + by - bs;
mint c = cx + cy - 1;
mint d = dx + dy;
mint e = ex + ey;
mint f = fx + fy - 1;
mint g = gx + gy + (ax * fy + bx * dy) + (ay * fx + by * dx)
- ax - (dy * bs + as * fy) - ay - (dx * bs + as * fx) + as;
dump(gx, gy, (ax * fy + bx * dy), (ay * fx + by * dx),
ax, (dy * bs + as * fy), ay, (dx * bs + as * fx), as);
x = { a, b, c, d, e, f, g };
}
T e(int s){return v[s];}
T leaf(int s) { return v[s]; }
T apply(const T& x, int p, int s) {
auto& [ax, bx, cx, dx, ex, fx, gx] = x;
auto [ap, bp, cp, dp, ep, fp, gp] = v[p];
auto [as, bs, cs, ds, es, fs, gs] = v[s];
mint a = ax * 1 + bx * ap + ap;
mint b = bx * bp + bp;
mint c = cx + 1;
mint d = dx * bs + as * fx;
mint e = ex * bs + 1;
mint f = fx + 1;
mint g = gx + a + (d * bp + ap * f) - ap;
dump(gx, a, (d * bp + ap * f), ap);
return { a, b, c, d, e, f, g };
}
vector<T> solve_by_tree_getDP(const Graph& g, int r) {
return tree_getDP_vmerge<T, merge, e, leaf, apply>(g, r);
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int n;
cin >> n;
vl a(n);
cin >> a;
auto g = read_Graph(n);
v.resize(n);
rep(i, n) {
auto ds = integer_digits(a[i]);
v[i] = { a[i], pow(10, sz(ds)), 1, 0, 1, 1, a[i]};
}
auto dp = solve_by_tree_getDP(g, 0);
dumpel(dp);
auto& [ax, bx, cx, dx, ex, fx, gx] = dp[0];
cout << gx << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0