結果
| 問題 | No.623 fudan no modulus to tigau |
| ユーザー |
 hirono999
|
| 提出日時 | 2021-01-01 06:10:59 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 2,000 ms |
| コード長 | 8,770 bytes |
| コンパイル時間 | 11,727 ms |
| コンパイル使用メモリ | 290,436 KB |
| 最終ジャッジ日時 | 2025-01-17 08:50:31 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 12 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>constexpr long long INF = 1LL << 60;double PI = acos(-1.0);#define rep(i, n) for (ll i = 0; i < (n); ++i)#define rep1(i, n) for (ll i = 1; i <= (n); ++i)#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c)))#define ALL(obj) (obj).begin(), (obj).end()#define RALL(obj) (obj).rbegin(), (obj).rend()#define pb push_back#define to_s to_string#define len(v) (ll)v.size()#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())#define print(x) cout << (x) << '\n'#define drop(x) cout << (x) << '\n', exit(0)#define debug(x) cout << #x << ": " << (x) << '\n'using namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair<ll, ll> P;typedef tuple<ll, ll, ll> tpl;typedef vector<ll> vec;typedef vector<vector<ll>> vec2;typedef vector<vector<vector<ll>>> vec3;template<class S, class T> inline bool chmax(S &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class S, class T> inline bool chmin(S &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }inline ll msb(ll v) { return 1 << (31 - __builtin_clzll(v)); }inline ll devc(ll x, ll y) { return (x + y - 1) / y; }inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }inline ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }struct IoSetup {IoSetup() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);}} iosetup;template< typename T1, typename T2 >ostream &operator << (ostream &os, const pair< T1, T2 > &p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator >> (istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;return is;}template< typename T1, typename T2, typename T3 >ostream &operator << (ostream &os, const tuple< T1, T2, T3 > &t) {os << get<0>(t) << " " << get<1>(t) << " " << get<2>(t);return os;}template< typename T1, typename T2, typename T3 >istream &operator >> (istream &is, tuple< T1, T2, T3 > &t) {is >> get<0>(t) >> get<1>(t) >> get<2>(t);return is;}template< typename T >ostream &operator << (ostream &os, const vector< T > &v){for (int i = 0; i < (int)v.size(); ++i) {os << v[i] << (i + 1 != v.size() ? " " : "");}return os;}template< typename T >istream &operator >> (istream &is, vector< T > &v){for(T &in : v) is >> in;return is;}template< typename T >ostream &operator << (ostream &os, const set< T > &st){int ct = 0;for(auto& s : st) cout << s << (++ct != st.size() ? " " : "");return os;}template <typename T>constexpr set<T> &operator|= (set<T> &st1, const set<T> &st2) {for(auto& s : st2) st1.insert(s);return st1;}template <typename T>constexpr set<T> &operator-= (set<T> &st1, const set<T> &st2) {for(auto& s : st2) if(st1.count(s)) st1.erase(s);return st1;}template <typename T>constexpr set<T> &operator&= (set<T> &st1, const set<T> &st2) {auto itr = st1.begin();while(itr != st1.end()){if(!st2.count(*itr)) itr = st1.erase(itr);else ++itr;}return st1;}template <typename T>constexpr set<T> operator| (const set<T> &st1, const set<T> &st2) {set<T> res = st1;res |= st2;return res;}template <typename T>constexpr set<T> operator- (const set<T> &st1, const set<T> &st2) {set<T> res = st1;res -= st2;return res;}template <typename T>constexpr set<T> operator& (const set<T> &st1, const set<T> &st2) {set<T> res = st1;res &= st2;return res;}/*--------------------------------- Tools ------------------------------------------*/template< typename T >vector<T> cumsum(const vector<T> &X){vector<T> res(X.size() + 1, 0);for(int i = 0; i < X.size(); ++i) res[i + 1] += res[i] + X[i];return res;}template< typename S, typename T, typename F>pair<T, T> bisearch(S left, T right, F f) {while(abs(right - left) > 1){T mid = (right + left) / 2;if(f(mid)) right = mid;else left = mid;}return {left, right};}template< typename S, typename T, typename F>double trisearch(S left, T right, F f, int maxLoop = 90){double low = left, high = right;while(maxLoop--){double mid_left = high / 3 + low * 2 / 3;double mid_right = high * 2 / 3 + low / 3;if(f(mid_left) >= f(mid_right)) low = mid_left;else high = mid_right;}return (low + high) * 0.5;}template< typename F >ll ternarySearch(ll L, ll R, F f) { //[L, R)ll lo = L - 1, hi = R - 1;while (lo + 1 != hi) {ll mi = (lo + hi) / 2;if (f(mi) <= f(mi + 1)) hi = mi;else lo = mi;}return hi;}// #include <atcoder/all>// using namespace atcoder;constexpr long long MOD = 998244353;template<int MOD>struct modint {ll val;constexpr modint(ll v = 0) noexcept : val(v % MOD){if(val < 0) val += MOD;}constexpr int getmod() { return MOD; }constexpr modint operator-() const noexcept { return val ? MOD - val : 0; }constexpr modint operator+ (const modint &r) const noexcept { return modint(*this) += r; }constexpr modint operator- (const modint &r) const noexcept { return modint(*this) -= r; }constexpr modint operator* (const modint &r) const noexcept { return modint(*this) *= r; }constexpr modint operator/ (const modint &r) const noexcept { return modint(*this) /= r; }constexpr modint& operator++() noexcept {val += 1;if(val >= MOD) val -= MOD;return *this;}constexpr modint& operator++(int) noexcept {val += 1;if(val >= MOD) val -= MOD;return *this;}constexpr modint& operator--() noexcept {val -= 1;if(val < 0) val += MOD;return *this;}constexpr modint& operator--(int) noexcept {val -= 1;if(val < 0) val += MOD;return *this;}constexpr modint& operator+= (const modint &r) noexcept {val += r.val;if(val >= MOD) val -= MOD;return *this;}constexpr modint& operator-= (const modint &r) noexcept {val -= r.val;if(val < 0) val += MOD;return *this;}constexpr modint& operator*= (const modint &r) noexcept {val = val * r.val % MOD;return *this;}constexpr modint& operator/= (const modint& 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 modint &r) const noexcept {return this->val == r.val;}constexpr bool operator!= (const modint &r) const noexcept {return this->val != r.val;}friend constexpr istream& operator >> (istream &is, modint<MOD>& x) noexcept {is >> x.val;x += 0;return is;}friend constexpr ostream& operator << (ostream &os, const modint<MOD>& x) noexcept {return os << x.val;}friend constexpr modint<MOD> modpow(const modint<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;}};using mint = modint<MOD>;/*------------------------------- Main Code Here -----------------------------------------*/int main(){ll N;cin >> N;vector<tpl> X(N - 1);cin >> X;ll Q;cin >> Q;vector<unordered_map<ll, mint>> dim(N + 1);dim[0][0] = 1;dim[1][1] = 1;rep(i, N - 1){ll idx = i + 2;auto [t, a, b] = X[i];auto& mp1 = dim[a];auto& mp2 = dim[b];if(t == 1){for(auto [k, v] : mp1) dim[idx][k] += v;for(auto [k, v] : mp2) dim[idx][k] += v;}if(t == 2){for(auto [k, v] : mp2) dim[idx][k] += v * a;}if(t == 3){for(auto [k1, v1] : mp1){for(auto [k2, v2] : mp2){dim[idx][k1 + k2] += v1 * v2;}}}}rep(_, Q){mint x;cin >> x;auto& coef = dim[N];mint ans = 0;for(auto [k, v] : coef){ans += v * modpow(x, k);}print(ans);}return 0;}