結果
問題 | No.2305 [Cherry 5th Tune N] Until That Day... |
ユーザー |
![]() |
提出日時 | 2023-05-20 00:19:00 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3,803 ms / 10,000 ms |
コード長 | 40,367 bytes |
コンパイル時間 | 11,503 ms |
コンパイル使用メモリ | 358,184 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-12-20 03:28:02 |
合計ジャッジ時間 | 25,956 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 21 |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"#if defined(LOCAL)#include <my_template_compiled.hpp>#else#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;template <class T>constexpr T infty = 0;template <>constexpr int infty<int> = 1'000'000'000;template <>constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;template <>constexpr u32 infty<u32> = infty<int>;template <>constexpr u64 infty<u64> = infty<ll>;template <>constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;template <>constexpr double infty<double> = infty<ll>;template <>constexpr long double infty<long double> = infty<ll>;using pi = pair<ll, ll>;using vi = vector<ll>;template <class T>using vc = vector<T>;template <class T>using vvc = vector<vc<T>>;template <class T>using vvvc = vector<vvc<T>>;template <class T>using vvvvc = vector<vvvc<T>>;template <class T>using vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) \vector<vector<vector<type>>> name( \h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name( \a, vector<vector<vector<type>>>( \b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))// https://trap.jp/post/1224/#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)#define overload4(a, b, c, d, e, ...) e#define overload3(a, b, c, d, ...) d#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)#define FOR_subset(t, s) \for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))#define all(x) x.begin(), x.end()#define len(x) ll(x.size())#define elif else if#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define stoi stollint popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T, typename U>T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}template <typename T, typename U>T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}template <typename T, typename U>pair<T, T> divmod(T x, U y) {T q = floor(x, y);return {q, x - q * y};}template <typename T, typename U>T SUM(const vector<U> &A) {T sum = 0;for (auto &&a: A) sum += a;return sum;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) \sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()template <typename T>T POP(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T POP(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(pqg<T> &que) {assert(!que.empty());T a = que.top();que.pop();return a;}template <typename T>T POP(vc<T> &que) {assert(!que.empty());T a = que.back();que.pop_back();return a;}template <typename F>ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {if (check_ok) assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));}return ok;}template <typename F>double binary_search_real(F check, double ok, double ng, int iter = 100) {FOR(iter) {double x = (ok + ng) / 2;tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));}return (ok + ng) / 2;}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}// ? は -1vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }return A;}template <typename T, typename U>vector<T> cumsum(vector<U> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}// stable sorttemplate <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(len(A));iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {vc<T> B(len(I));FOR(i, len(I)) B[i] = A[I[i]];return B;}#endif#line 1 "/home/maspy/compro/library/other/io.hpp"// based on yosupo's fastio#include <unistd.h>namespace fastio {#define FASTIO// クラスが read(), print() を持っているかを判定するメタ関数struct has_write_impl {template <class T>static auto check(T &&x) -> decltype(x.write(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_write : public decltype(has_write_impl::check<T>(std::declval<T>())) {};struct has_read_impl {template <class T>static auto check(T &&x) -> decltype(x.read(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_read : public decltype(has_read_impl::check<T>(std::declval<T>())) {};struct Scanner {FILE *fp;char line[(1 << 15) + 1];size_t st = 0, ed = 0;void reread() {memmove(line, line + st, ed - st);ed -= st;st = 0;ed += fread(line + ed, 1, (1 << 15) - ed, fp);line[ed] = '\0';}bool succ() {while (true) {if (st == ed) {reread();if (st == ed) return false;}while (st != ed && isspace(line[st])) st++;if (st != ed) break;}if (ed - st <= 50) {bool sep = false;for (size_t i = st; i < ed; i++) {if (isspace(line[i])) {sep = true;break;}}if (!sep) reread();}return true;}template <class T, enable_if_t<is_same<T, string>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;while (true) {size_t sz = 0;while (st + sz < ed && !isspace(line[st + sz])) sz++;ref.append(line + st, sz);st += sz;if (!sz || st != ed) break;reread();}return true;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;bool neg = false;if (line[st] == '-') {neg = true;st++;}ref = T(0);while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }if (neg) ref = -ref;return true;}template <typename T,typename enable_if<has_read<T>::value>::type * = nullptr>inline bool read_single(T &x) {x.read();return true;}bool read_single(double &ref) {string s;if (!read_single(s)) return false;ref = std::stod(s);return true;}bool read_single(char &ref) {string s;if (!read_single(s) || s.size() != 1) return false;ref = s[0];return true;}template <class T>bool read_single(vector<T> &ref) {for (auto &d: ref) {if (!read_single(d)) return false;}return true;}template <class T, class U>bool read_single(pair<T, U> &p) {return (read_single(p.first) && read_single(p.second));}template <size_t N = 0, typename T>void read_single_tuple(T &t) {if constexpr (N < std::tuple_size<T>::value) {auto &x = std::get<N>(t);read_single(x);read_single_tuple<N + 1>(t);}}template <class... T>bool read_single(tuple<T...> &tpl) {read_single_tuple(tpl);return true;}void read() {}template <class H, class... T>void read(H &h, T &... t) {bool f = read_single(h);assert(f);read(t...);}Scanner(FILE *fp) : fp(fp) {}};struct Printer {Printer(FILE *_fp) : fp(_fp) {}~Printer() { flush(); }static constexpr size_t SIZE = 1 << 15;FILE *fp;char line[SIZE], small[50];size_t pos = 0;void flush() {fwrite(line, 1, pos, fp);pos = 0;}void write(const char val) {if (pos == SIZE) flush();line[pos++] = val;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>void write(T val) {if (pos > (1 << 15) - 50) flush();if (val == 0) {write('0');return;}if (val < 0) {write('-');val = -val; // todo min}size_t len = 0;while (val) {small[len++] = char(0x30 | (val % 10));val /= 10;}for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }pos += len;}void write(const string s) {for (char c: s) write(c);}void write(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) write(s[i]);}void write(const double x) {ostringstream oss;oss << fixed << setprecision(15) << x;string s = oss.str();write(s);}void write(const long double x) {ostringstream oss;oss << fixed << setprecision(15) << x;string s = oss.str();write(s);}template <typename T,typename enable_if<has_write<T>::value>::type * = nullptr>inline void write(T x) {x.write();}template <class T>void write(const vector<T> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}template <class T, class U>void write(const pair<T, U> val) {write(val.first);write(' ');write(val.second);}template <size_t N = 0, typename T>void write_tuple(const T t) {if constexpr (N < std::tuple_size<T>::value) {if constexpr (N > 0) { write(' '); }const auto x = std::get<N>(t);write(x);write_tuple<N + 1>(t);}}template <class... T>bool write(tuple<T...> tpl) {write_tuple(tpl);return true;}template <class T, size_t S>void write(const array<T, S> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}void write(i128 val) {string s;bool negative = 0;if (val < 0) {negative = 1;val = -val;}while (val) {s += '0' + int(val % 10);val /= 10;}if (negative) s += "-";reverse(all(s));if (len(s) == 0) s = "0";write(s);}};Scanner scanner = Scanner(stdin);Printer printer = Printer(stdout);void flush() { printer.flush(); }void print() { printer.write('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {printer.write(head);if (sizeof...(Tail)) printer.write(' ');print(forward<Tail>(tail)...);}void read() {}template <class Head, class... Tail>void read(Head &head, Tail &... tail) {scanner.read(head);read(tail...);}} // namespace fastiousing fastio::print;using fastio::flush;using fastio::read;#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define DBL(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 3 "main.cpp"#line 2 "/home/maspy/compro/library/mod/modint_common.hpp"struct has_mod_impl {template <class T>static auto check(T &&x) -> decltype(x.get_mod(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_mod : public decltype(has_mod_impl::check<T>(std::declval<T>())) {};template <typename mint>mint inv(int n) {static const int mod = mint::get_mod();static vector<mint> dat = {0, 1};assert(0 <= n);if (n >= mod) n %= mod;while (len(dat) <= n) {int k = len(dat);int q = (mod + k - 1) / k;dat.eb(dat[k * q - mod] * mint(q));}return dat[n];}template <typename mint>mint fact(int n) {static const int mod = mint::get_mod();assert(0 <= n);if (n >= mod) return 0;static vector<mint> dat = {1, 1};while (len(dat) <= n) dat.eb(dat[len(dat) - 1] * mint(len(dat)));return dat[n];}template <typename mint>mint fact_inv(int n) {static const int mod = mint::get_mod();assert(-1 <= n && n < mod);static vector<mint> dat = {1, 1};if (n == -1) return mint(0);while (len(dat) <= n) dat.eb(dat[len(dat) - 1] * inv<mint>(len(dat)));return dat[n];}template <class mint, class... Ts>mint fact_invs(Ts... xs) {return (mint(1) * ... * fact_inv<mint>(xs));}template <typename mint, class Head, class... Tail>mint multinomial(Head &&head, Tail &&... tail) {return fact<mint>(head) * fact_invs<mint>(std::forward<Tail>(tail)...);}template <typename mint>mint C_dense(int n, int k) {static vvc<mint> C;static int H = 0, W = 0;auto calc = [&](int i, int j) -> mint {if (i == 0) return (j == 0 ? mint(1) : mint(0));return C[i - 1][j] + (j ? C[i - 1][j - 1] : 0);};if (W <= k) {FOR(i, H) {C[i].resize(k + 1);FOR(j, W, k + 1) { C[i][j] = calc(i, j); }}W = k + 1;}if (H <= n) {C.resize(n + 1);FOR(i, H, n + 1) {C[i].resize(W);FOR(j, W) { C[i][j] = calc(i, j); }}H = n + 1;}return C[n][k];}template <typename mint, bool large = false, bool dense = false>mint C(ll n, ll k) {assert(n >= 0);if (k < 0 || n < k) return 0;if (dense) return C_dense<mint>(n, k);if (!large) return multinomial<mint>(n, k, n - k);k = min(k, n - k);mint x(1);FOR(i, k) x *= mint(n - i);return x * fact_inv<mint>(k);}template <typename mint, bool large = false>mint C_inv(ll n, ll k) {assert(n >= 0);assert(0 <= k && k <= n);if (!large) return fact_inv<mint>(n) * fact<mint>(k) * fact<mint>(n - k);return mint(1) / C<mint, 1>(n, k);}// [x^d] (1-x) ^ {-n} の計算template <typename mint, bool large = false, bool dense = false>mint C_negative(ll n, ll d) {assert(n >= 0);if (d < 0) return mint(0);if (n == 0) { return (d == 0 ? mint(1) : mint(0)); }return C<mint, large, dense>(n + d - 1, d);}#line 3 "/home/maspy/compro/library/mod/modint.hpp"template <int mod>struct modint {static_assert(mod < (1 << 30));int val;constexpr modint(const ll val = 0) noexcept: val(val >= 0 ? val % mod : (mod - (-val) % mod) % mod) {}bool operator<(const modint &other) const {return val < other.val;} // To use std::mapmodint &operator+=(const modint &p) {if ((val += p.val) >= mod) val -= mod;return *this;}modint &operator-=(const modint &p) {if ((val += mod - p.val) >= mod) val -= mod;return *this;}modint &operator*=(const modint &p) {val = (int)(1LL * val * p.val % mod);return *this;}modint &operator/=(const modint &p) {*this *= p.inverse();return *this;}modint operator-() const { return modint(-val); }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; }bool operator==(const modint &p) const { return val == p.val; }bool operator!=(const modint &p) const { return val != p.val; }modint inverse() const {int a = val, 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(ll n) const {assert(n >= 0);modint ret(1), mul(val);while (n > 0) {if (n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}#ifdef FASTIOvoid write() { fastio::printer.write(val); }void read() { fastio::scanner.read(val); }#endifstatic constexpr int get_mod() { return mod; }// (n, r), r は 1 の 2^n 乗根static constexpr pair<int, int> ntt_info() {if (mod == 167772161) return {25, 17};if (mod == 469762049) return {26, 30};if (mod == 754974721) return {24, 362};if (mod == 880803841) return {23, 211};if (mod == 998244353) return {23, 31};if (mod == 1045430273) return {20, 363};if (mod == 1051721729) return {20, 330};if (mod == 1053818881) return {20, 2789};return {-1, -1};}static constexpr bool can_ntt() { return ntt_info().fi != -1; }};using modint107 = modint<1000000007>;using modint998 = modint<998244353>;#line 2 "/home/maspy/compro/library/seq/find_linear_rec.hpp"template <typename mint>vector<mint> find_linear_rec(vector<mint>& A) {int N = len(A);vc<mint> B = {1}, C = {1};int l = 0, m = 1;mint p = 1;FOR(i, N) {mint d = A[i];FOR3(j, 1, l + 1) { d += C[j] * A[i - j]; }if (d == 0) {++m;continue;}auto tmp = C;mint q = d / p;if (len(C) < len(B) + m) C.insert(C.end(), len(B) + m - len(C), 0);FOR(j, len(B)) C[j + m] -= q * B[j];if (l + l <= i) {B = tmp;l = i + 1 - l, m = 1;p = d;} else {++m;}}return C;}#line 2 "/home/maspy/compro/library/random/base.hpp"u64 RNG_64() {static uint64_t x_= uint64_t(chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count())* 10150724397891781847ULL;x_ ^= x_ << 7;return x_ ^= x_ >> 9;}u64 RNG(u64 lim) { return RNG_64() % lim; }ll RNG(ll l, ll r) { return l + RNG_64() % (r - l); }#line 3 "/home/maspy/compro/library/linalg/spmat_min_poly.hpp"template <typename mint>vc<mint> spmat_min_poly(int N, vc<tuple<int, int, mint>> dat) {vc<mint> S(N + N + 10);vc<mint> c(N);vc<mint> v(N);FOR(i, N) c[i] = RNG(0, mint::get_mod());FOR(i, N) v[i] = RNG(0, mint::get_mod());FOR(k, N + N + 10) {FOR(i, N) S[k] += c[i] * v[i];vc<mint> w(N);for (auto&& [i, j, x]: dat) w[j] += x * v[i];swap(v, w);}return find_linear_rec(S);}#line 2 "/home/maspy/compro/library/graph/base.hpp"template <typename T>struct Edge {int frm, to;T cost;int id;};template <typename T = int, bool directed = false>struct Graph {int N, M;using cost_type = T;using edge_type = Edge<T>;vector<edge_type> edges;vector<int> indptr;vector<edge_type> csr_edges;vc<int> vc_deg, vc_indeg, vc_outdeg;bool prepared;class OutgoingEdges {public:OutgoingEdges(const Graph* G, int l, int r) : G(G), l(l), r(r) {}const edge_type* begin() const {if (l == r) { return 0; }return &G->csr_edges[l];}const edge_type* end() const {if (l == r) { return 0; }return &G->csr_edges[r];}private:const Graph* G;int l, r;};bool is_prepared() { return prepared; }constexpr bool is_directed() { return directed; }Graph() : N(0), M(0), prepared(0) {}Graph(int N) : N(N), M(0), prepared(0) {}void build(int n) {N = n, M = 0;prepared = 0;edges.clear();indptr.clear();csr_edges.clear();vc_deg.clear();vc_indeg.clear();vc_outdeg.clear();}void add(int frm, int to, T cost = 1, int i = -1) {assert(!prepared);assert(0 <= frm && 0 <= to && to < N);if (i == -1) i = M;auto e = edge_type({frm, to, cost, i});edges.eb(e);++M;}// wt, offvoid read_tree(bool wt = false, int off = 1) { read_graph(N - 1, wt, off); }void read_graph(int M, bool wt = false, int off = 1) {for (int m = 0; m < M; ++m) {INT(a, b);a -= off, b -= off;if (!wt) {add(a, b);} else {T c;read(c);add(a, b, c);}}build();}void build() {assert(!prepared);prepared = true;indptr.assign(N + 1, 0);for (auto&& e: edges) {indptr[e.frm + 1]++;if (!directed) indptr[e.to + 1]++;}for (int v = 0; v < N; ++v) { indptr[v + 1] += indptr[v]; }auto counter = indptr;csr_edges.resize(indptr.back() + 1);for (auto&& e: edges) {csr_edges[counter[e.frm]++] = e;if (!directed)csr_edges[counter[e.to]++] = edge_type({e.to, e.frm, e.cost, e.id});}}OutgoingEdges operator[](int v) const {assert(prepared);return {this, indptr[v], indptr[v + 1]};}vc<int> deg_array() {if (vc_deg.empty()) calc_deg();return vc_deg;}pair<vc<int>, vc<int>> deg_array_inout() {if (vc_indeg.empty()) calc_deg_inout();return {vc_indeg, vc_outdeg};}int deg(int v) {if (vc_deg.empty()) calc_deg();return vc_deg[v];}int in_deg(int v) {if (vc_indeg.empty()) calc_deg_inout();return vc_indeg[v];}int out_deg(int v) {if (vc_outdeg.empty()) calc_deg_inout();return vc_outdeg[v];}void debug() {print("Graph");if (!prepared) {print("frm to cost id");for (auto&& e: edges) print(e.frm, e.to, e.cost, e.id);} else {print("indptr", indptr);print("frm to cost id");FOR(v, N) for (auto&& e: (*this)[v]) print(e.frm, e.to, e.cost, e.id);}}// G における頂点 V[i] が、新しいグラフで i になるようにするGraph<T, directed> rearrange(vc<int> V) {int n = len(V);map<int, int> MP;FOR(i, n) MP[V[i]] = i;set<int> used;Graph<T, directed> G(n);FOR(i, n) {for (auto&& e: (*this)[V[i]]) {if (used.count(e.id)) continue;int a = e.frm, b = e.to;if (MP.count(a) && MP.count(b)) {used.insert(e.id);G.add(MP[a], MP[b], e.cost);}}}G.build();return G;}private:void calc_deg() {assert(vc_deg.empty());vc_deg.resize(N);for (auto&& e: edges) vc_deg[e.frm]++, vc_deg[e.to]++;}void calc_deg_inout() {assert(vc_indeg.empty());vc_indeg.resize(N);vc_outdeg.resize(N);for (auto&& e: edges) { vc_indeg[e.to]++, vc_outdeg[e.frm]++; }}};#line 2 "/home/maspy/compro/library/poly/count_terms.hpp"template<typename mint>int count_terms(const vc<mint>& f){int t = 0;FOR(i, len(f)) if(f[i] != mint(0)) ++t;return t;}#line 2 "/home/maspy/compro/library/mod/mod_inv.hpp"// long でも大丈夫ll mod_inv(ll val, ll mod) {val %= mod;if (val < 0) val += mod;ll a = val, b = mod, u = 1, v = 0, t;while (b > 0) {t = a / b;swap(a -= t * b, b), swap(u -= t * v, v);}if (u < 0) u += mod;return u;}#line 1 "/home/maspy/compro/library/poly/convolution_naive.hpp"template <class T>vector<T> convolution_naive(const vector<T>& a, const vector<T>& b) {int n = int(a.size()), m = int(b.size());vector<T> ans(n + m - 1);if (n < m) {FOR(j, m) FOR(i, n) ans[i + j] += a[i] * b[j];} else {FOR(i, n) FOR(j, m) ans[i + j] += a[i] * b[j];}return ans;}#line 2 "/home/maspy/compro/library/poly/ntt.hpp"template <class mint>void ntt(vector<mint>& a, bool inverse) {assert(mint::can_ntt());const int rank2 = mint::ntt_info().fi;const int mod = mint::get_mod();static array<mint, 30> root, iroot;static array<mint, 30> rate2, irate2;static array<mint, 30> rate3, irate3;static bool prepared = 0;if (!prepared) {prepared = 1;root[rank2] = mint::ntt_info().se;iroot[rank2] = mint(1) / root[rank2];FOR_R(i, rank2) {root[i] = root[i + 1] * root[i + 1];iroot[i] = iroot[i + 1] * iroot[i + 1];}mint prod = 1, iprod = 1;for (int i = 0; i <= rank2 - 2; i++) {rate2[i] = root[i + 2] * prod;irate2[i] = iroot[i + 2] * iprod;prod *= iroot[i + 2];iprod *= root[i + 2];}prod = 1, iprod = 1;for (int i = 0; i <= rank2 - 3; i++) {rate3[i] = root[i + 3] * prod;irate3[i] = iroot[i + 3] * iprod;prod *= iroot[i + 3];iprod *= root[i + 3];}}int n = int(a.size());int h = topbit(n);assert(n == 1 << h);if (!inverse) {int len = 0;while (len < h) {if (h - len == 1) {int p = 1 << (h - len - 1);mint rot = 1;FOR(s, 1 << len) {int offset = s << (h - len);FOR(i, p) {auto l = a[i + offset];auto r = a[i + offset + p] * rot;a[i + offset] = l + r;a[i + offset + p] = l - r;}rot *= rate2[topbit(~s & -~s)];}len++;} else {int p = 1 << (h - len - 2);mint rot = 1, imag = root[2];for (int s = 0; s < (1 << len); s++) {mint rot2 = rot * rot;mint rot3 = rot2 * rot;int offset = s << (h - len);for (int i = 0; i < p; i++) {u64 mod2 = u64(mod) * mod;u64 a0 = a[i + offset].val;u64 a1 = u64(a[i + offset + p].val) * rot.val;u64 a2 = u64(a[i + offset + 2 * p].val) * rot2.val;u64 a3 = u64(a[i + offset + 3 * p].val) * rot3.val;u64 a1na3imag = (a1 + mod2 - a3) % mod * imag.val;u64 na2 = mod2 - a2;a[i + offset] = a0 + a2 + a1 + a3;a[i + offset + 1 * p] = a0 + a2 + (2 * mod2 - (a1 + a3));a[i + offset + 2 * p] = a0 + na2 + a1na3imag;a[i + offset + 3 * p] = a0 + na2 + (mod2 - a1na3imag);}rot *= rate3[topbit(~s & -~s)];}len += 2;}}} else {mint coef = mint(1) / mint(len(a));FOR(i, len(a)) a[i] *= coef;int len = h;while (len) {if (len == 1) {int p = 1 << (h - len);mint irot = 1;FOR(s, 1 << (len - 1)) {int offset = s << (h - len + 1);FOR(i, p) {u64 l = a[i + offset].val;u64 r = a[i + offset + p].val;a[i + offset] = l + r;a[i + offset + p] = (mod + l - r) * irot.val;}irot *= irate2[topbit(~s & -~s)];}len--;} else {int p = 1 << (h - len);mint irot = 1, iimag = iroot[2];FOR(s, (1 << (len - 2))) {mint irot2 = irot * irot;mint irot3 = irot2 * irot;int offset = s << (h - len + 2);for (int i = 0; i < p; i++) {u64 a0 = a[i + offset + 0 * p].val;u64 a1 = a[i + offset + 1 * p].val;u64 a2 = a[i + offset + 2 * p].val;u64 a3 = a[i + offset + 3 * p].val;u64 x = (mod + a2 - a3) * iimag.val % mod;a[i + offset] = a0 + a1 + a2 + a3;a[i + offset + 1 * p] = (a0 + mod - a1 + x) * irot.val;a[i + offset + 2 * p] = (a0 + a1 + 2 * mod - a2 - a3) * irot2.val;a[i + offset + 3 * p] = (a0 + 2 * mod - a1 - x) * irot3.val;}irot *= irate3[topbit(~s & -~s)];}len -= 2;}}}}#line 1 "/home/maspy/compro/library/poly/fft.hpp"namespace CFFT {using real = double;struct C {real x, y;C() : x(0), y(0) {}C(real x, real y) : x(x), y(y) {}inline C operator+(const C& c) const { return C(x + c.x, y + c.y); }inline C operator-(const C& c) const { return C(x - c.x, y - c.y); }inline C operator*(const C& c) const {return C(x * c.x - y * c.y, x * c.y + y * c.x);}inline C conj() const { return C(x, -y); }};const real PI = acosl(-1);int base = 1;vector<C> rts = {{0, 0}, {1, 0}};vector<int> rev = {0, 1};void ensure_base(int nbase) {if (nbase <= base) return;rev.resize(1 << nbase);rts.resize(1 << nbase);for (int i = 0; i < (1 << nbase); i++) {rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));}while (base < nbase) {real angle = PI * 2.0 / (1 << (base + 1));for (int i = 1 << (base - 1); i < (1 << base); i++) {rts[i << 1] = rts[i];real angle_i = angle * (2 * i + 1 - (1 << base));rts[(i << 1) + 1] = C(cos(angle_i), sin(angle_i));}++base;}}void fft(vector<C>& a, int n) {assert((n & (n - 1)) == 0);int zeros = __builtin_ctz(n);ensure_base(zeros);int shift = base - zeros;for (int i = 0; i < n; i++) {if (i < (rev[i] >> shift)) { swap(a[i], a[rev[i] >> shift]); }}for (int k = 1; k < n; k <<= 1) {for (int i = 0; i < n; i += 2 * k) {for (int j = 0; j < k; j++) {C z = a[i + j + k] * rts[j + k];a[i + j + k] = a[i + j] - z;a[i + j] = a[i + j] + z;}}}}} // namespace CFFT#line 7 "/home/maspy/compro/library/poly/convolution.hpp"template <class mint>vector<mint> convolution_ntt(vector<mint> a, vector<mint> b) {if (a.empty() || b.empty()) return {};int n = int(a.size()), m = int(b.size());int sz = 1;while (sz < n + m - 1) sz *= 2;// sz = 2^k のときの高速化。分割統治的なやつで損しまくるので。if ((n + m - 3) <= sz / 2) {auto a_last = a.back(), b_last = b.back();a.pop_back(), b.pop_back();auto c = convolution(a, b);c.resize(n + m - 1);c[n + m - 2] = a_last * b_last;FOR(i, len(a)) c[i + len(b)] += a[i] * b_last;FOR(i, len(b)) c[i + len(a)] += b[i] * a_last;return c;}a.resize(sz), b.resize(sz);bool same = a == b;ntt(a, 0);if (same) {b = a;} else {ntt(b, 0);}FOR(i, sz) a[i] *= b[i];ntt(a, 1);a.resize(n + m - 1);return a;}template <typename mint>vector<mint> convolution_garner(const vector<mint>& a, const vector<mint>& b) {int n = len(a), m = len(b);if (!n || !m) return {};static const long long nttprimes[] = {754974721, 167772161, 469762049};using mint0 = modint<754974721>;using mint1 = modint<167772161>;using mint2 = modint<469762049>;vc<mint0> a0(n), b0(m);vc<mint1> a1(n), b1(m);vc<mint2> a2(n), b2(m);FOR(i, n) a0[i] = a[i].val, a1[i] = a[i].val, a2[i] = a[i].val;FOR(i, m) b0[i] = b[i].val, b1[i] = b[i].val, b2[i] = b[i].val;auto c0 = convolution_ntt<mint0>(a0, b0);auto c1 = convolution_ntt<mint1>(a1, b1);auto c2 = convolution_ntt<mint2>(a2, b2);static const long long m01 = 1LL * nttprimes[0] * nttprimes[1];static const long long m0_inv_m1 = mint1(nttprimes[0]).inverse().val;static const long long m01_inv_m2 = mint2(m01).inverse().val;const int mod = mint::get_mod();auto garner = [&](mint0 x0, mint1 x1, mint2 x2) -> mint {int r0 = x0.val, r1 = x1.val, r2 = x2.val;int v1 = (m0_inv_m1 * (r1 + nttprimes[1] - r0)) % nttprimes[1];auto v2 = (mint2(r2) - r0 - mint2(nttprimes[0]) * v1) * mint2(m01_inv_m2);return mint(r0 + 1LL * nttprimes[0] * v1 + m01 % mod * v2.val);};vc<mint> c(len(c0));FOR(i, len(c)) c[i] = garner(c0[i], c1[i], c2[i]);return c;}template <typename R>vc<double> convolution_fft(const vc<R>& a, const vc<R>& b) {using C = CFFT::C;int need = (int)a.size() + (int)b.size() - 1;int nbase = 1;while ((1 << nbase) < need) nbase++;CFFT::ensure_base(nbase);int sz = 1 << nbase;vector<C> fa(sz);for (int i = 0; i < sz; i++) {int x = (i < (int)a.size() ? a[i] : 0);int y = (i < (int)b.size() ? b[i] : 0);fa[i] = C(x, y);}CFFT::fft(fa, sz);C r(0, -0.25 / (sz >> 1)), s(0, 1), t(0.5, 0);for (int i = 0; i <= (sz >> 1); i++) {int j = (sz - i) & (sz - 1);C z = (fa[j] * fa[j] - (fa[i] * fa[i]).conj()) * r;fa[j] = (fa[i] * fa[i] - (fa[j] * fa[j]).conj()) * r;fa[i] = z;}for (int i = 0; i < (sz >> 1); i++) {C A0 = (fa[i] + fa[i + (sz >> 1)]) * t;C A1 = (fa[i] - fa[i + (sz >> 1)]) * t * CFFT::rts[(sz >> 1) + i];fa[i] = A0 + A1 * s;}CFFT::fft(fa, sz >> 1);vector<double> ret(need);for (int i = 0; i < need; i++) {ret[i] = (i & 1 ? fa[i >> 1].y : fa[i >> 1].x);}return ret;}vector<ll> convolution(const vector<ll>& a, const vector<ll>& b) {int n = len(a), m = len(b);if (!n || !m) return {};if (min(n, m) <= 60) return convolution_naive(a, b);ll abs_sum_a = 0, abs_sum_b = 0;ll LIM = 1e15;FOR(i, n) abs_sum_a = min(LIM, abs_sum_a + abs(a[i]));FOR(i, n) abs_sum_b = min(LIM, abs_sum_b + abs(b[i]));if (i128(abs_sum_a) * abs_sum_b < 1e15) {vc<double> c = convolution_fft<ll>(a, b);vc<ll> res(len(c));FOR(i, len(c)) res[i] = ll(floor(c[i] + .5));return res;}static constexpr unsigned long long MOD1 = 754974721; // 2^24static constexpr unsigned long long MOD2 = 167772161; // 2^25static constexpr unsigned long long MOD3 = 469762049; // 2^26static constexpr unsigned long long M2M3 = MOD2 * MOD3;static constexpr unsigned long long M1M3 = MOD1 * MOD3;static constexpr unsigned long long M1M2 = MOD1 * MOD2;static constexpr unsigned long long M1M2M3 = MOD1 * MOD2 * MOD3;static const unsigned long long i1 = mod_inv(MOD2 * MOD3, MOD1);static const unsigned long long i2 = mod_inv(MOD1 * MOD3, MOD2);static const unsigned long long i3 = mod_inv(MOD1 * MOD2, MOD3);using mint1 = modint<MOD1>;using mint2 = modint<MOD2>;using mint3 = modint<MOD3>;vc<mint1> a1(n), b1(m);vc<mint2> a2(n), b2(m);vc<mint3> a3(n), b3(m);FOR(i, n) a1[i] = a[i], a2[i] = a[i], a3[i] = a[i];FOR(i, m) b1[i] = b[i], b2[i] = b[i], b3[i] = b[i];auto c1 = convolution_ntt<mint1>(a1, b1);auto c2 = convolution_ntt<mint2>(a2, b2);auto c3 = convolution_ntt<mint3>(a3, b3);vc<ll> c(n + m - 1);FOR(i, n + m - 1) {u64 x = 0;x += (c1[i].val * i1) % MOD1 * M2M3;x += (c2[i].val * i2) % MOD2 * M1M3;x += (c3[i].val * i3) % MOD3 * M1M2;ll diff = c1[i].val - ((long long)(x) % (long long)(MOD1));if (diff < 0) diff += MOD1;static constexpr unsigned long long offset[5]= {0, 0, M1M2M3, 2 * M1M2M3, 3 * M1M2M3};x -= offset[diff % 5];c[i] = x;}return c;}template <typename mint>vc<mint> convolution(const vc<mint>& a, const vc<mint>& b) {int n = len(a), m = len(b);if (!n || !m) return {};if (mint::can_ntt()) {if (min(n, m) <= 50) return convolution_naive(a, b);return convolution_ntt(a, b);}if (min(n, m) <= 200) return convolution_naive(a, b);return convolution_garner(a, b);}#line 4 "/home/maspy/compro/library/poly/fps_inv.hpp"template <typename mint>vc<mint> fps_inv_sparse(const vc<mint>& f) {int N = len(f);vc<pair<int, mint>> dat;FOR(i, 1, N) if (f[i] != mint(0)) dat.eb(i, f[i]);vc<mint> g(N);mint g0 = mint(1) / f[0];g[0] = g0;FOR(n, 1, N) {mint rhs = 0;for (auto&& [k, fk]: dat) {if (k > n) break;rhs -= fk * g[n - k];}g[n] = rhs * g0;}return g;}template <typename mint>vc<mint> fps_inv_dense_ntt(const vc<mint>& F) {vc<mint> G = {mint(1) / F[0]};ll N = len(F), n = 1;G.reserve(N);while (n < N) {vc<mint> f(2 * n), g(2 * n);FOR(i, min(N, 2 * n)) f[i] = F[i];FOR(i, n) g[i] = G[i];ntt(f, false), ntt(g, false);FOR(i, 2 * n) f[i] *= g[i];ntt(f, true);FOR(i, n) f[i] = 0;ntt(f, false);FOR(i, 2 * n) f[i] *= g[i];ntt(f, true);FOR(i, n, min(N, 2 * n)) G.eb(-f[i]);n *= 2;}return G;}template <typename mint>vc<mint> fps_inv_dense(const vc<mint>& F) {if (mint::can_ntt()) return fps_inv_dense_ntt(F);const int N = len(F);vc<mint> R = {mint(1) / F[0]};vc<mint> p;int m = 1;while (m < N) {p = convolution(R, R);p.resize(m + m);vc<mint> f = {F.begin(), F.begin() + min(m + m, N)};p = convolution(p, f);R.resize(m + m);FOR(i, m + m) R[i] = R[i] + R[i] - p[i];m += m;}R.resize(N);return R;}template <typename mint>vc<mint> fps_inv(const vc<mint>& f) {assert(f[0] != mint(0));int n = count_terms(f);int t = (mint::can_ntt() ? 160 : 820);return (n <= t ? fps_inv_sparse<mint>(f) : fps_inv_dense<mint>(f));}#line 2 "/home/maspy/compro/library/poly/poly_divmod.hpp"template <typename mint>pair<vc<mint>, vc<mint>> poly_divmod(vc<mint> f, vc<mint> g) {assert(g.back() != 0);if (len(f) < len(g)) { return {{}, f}; }auto rf = f, rg = g;reverse(all(rf)), reverse(all(rg));ll deg = len(rf) - len(rg) + 1;rf.resize(deg), rg.resize(deg);rg = fps_inv(rg);auto q = convolution(rf, rg);q.resize(deg);reverse(all(q));auto h = convolution(q, g);FOR(i, len(f)) f[i] -= h[i];while (len(f) > 0 && f.back() == 0) f.pop_back();return {q, f};}#line 8 "main.cpp"using mint = modint998;void solve() {LL(N);++N;vc<int> par(N, -1);vc<mint> W(N, -1);FOR(i, 1, N) { read(par[i]); }FOR(i, 1, N) read(W[i]);Graph<mint, 0> G(N);FOR(i, 1, N) { G.add(par[i], i, W[i]); }G.build();// sparse matrixusing T = tuple<int, int, mint>;vc<T> dat;FOR(v, N) {vc<int> TO;vc<mint> WT;for (auto&& e: G[v]) {if (e.to == par[v]) continue;TO.eb(e.to), WT.eb(e.cost);}if (!TO.empty()) {mint cf = SUM<mint>(WT);cf = mint(1) / cf;FOR(i, len(TO)) dat.eb(v, TO[i], WT[i] * cf);} else {dat.eb(v, 0, 1);}}auto apply = [&](vc<mint> X) -> vc<mint> {vc<mint> Y(N);for (auto&& [a, b, c]: dat) Y[b] += X[a] * c;return Y;};using poly = vc<mint>;poly F = spmat_min_poly<mint>(N, dat);reverse(all(F));{vc<mint> X(N);FOR(i, N) X[i] = RNG(0, mint::get_mod());vc<mint> A(N);FOR(d, len(F)) {FOR(i, N) A[i] += F[d] * X[i];X = apply(X);}}auto mul = [&](poly f, poly g) -> poly {f = convolution(f, g);return poly_divmod(f, F).se;};auto pow = [&](auto& pow, ll n) -> pair<poly, poly> {// x^n, 1+x+...+x^{n-1}if (n == 0) {poly f = {1};poly g = {};return {f, g};}auto [f, g] = pow(pow, n / 2);f[0] += mint(1);g = mul(f, g);f[0] -= mint(1);f = mul(f, f);if (n % 2 == 1) {poly h = {0, 1};f = mul(f, h);g = mul(g, h);if (g.empty()) g.resize(1);g[0] += mint(1);}return {f, g};};// FOR(n, 3) print(n, ",", pow(pow, n).fi, ",", pow(pow, n).se);LL(Q);FOR(Q) {LL(v, K);poly f = pow(pow, K + 1).se;vc<mint> X(N), Y(N);Y[0] = mint(1);FOR(d, len(f)) {FOR(i, N) X[i] += f[d] * Y[i];Y = apply(Y);}X[0] -= mint(1);print(X[v]);}}signed main() {int T = 1;// INT(T);FOR(T) solve();return 0;}