結果

問題 No.623 fudan no modulus to tigau
ユーザー ふっぴー
提出日時 2017-12-24 13:03:10
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 2,042 bytes
コンパイル時間 1,802 ms
コンパイル使用メモリ 170,716 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-12-17 18:32:20
合計ジャッジ時間 2,188 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 12
権限があれば一括ダウンロードができます

ソースコード

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

#include "bits/stdc++.h"
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
const int inf = 1000000001;
const ll INF = 2e18 * 2;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
struct Modint {
    ll n;
    static const ll Mod = 998244353;
    Modint(int n = 0) : n(n) {}
};
Modint operator+(Modint a, Modint b) { return Modint((a.n += b.n) >= mod ? a.n - a.Mod : a.n); }
Modint operator-(Modint a, Modint b) { return Modint((a.n -= b.n) < 0 ? a.n + a.Mod : a.n); }
Modint operator*(Modint a, Modint b) { return Modint(1LL * a.n * b.n % a.Mod); }
Modint &operator+=(Modint &a, Modint b) { return a = a + b; }
Modint &operator-=(Modint &a, Modint b) { return a = a - b; }
Modint &operator*=(Modint &a, Modint b) { return a = a * b; }
int n;
vector<Modint> memo(51);
vi t(51), a(51), b(51);
Modint f(int i, Modint x) {
    if (memo[i].n >= 0) {
        return memo[i];
    }
    else {
        if (t[i] == 1) {
            memo[i] = f(a[i], x) + f(b[i], x);
            return f(a[i], x) + f(b[i], x);
        }
        else if (t[i] == 2) {
            memo[i] = Modint(a[i]) * f(b[i], x);
            return Modint(a[i]) * f(b[i], x);
        }
        else {
            memo[i] = f(a[i], x)*f(b[i], x);
            return f(a[i], x)*f(b[i], x);
        }
    }
}
int main() {
    int i, j;
    cin >> n;
    for (i = 2; i <= n; i++) {
        cin >> t[i] >> a[i] >> b[i];
    }
    int q;
    cin >> q;
    for (int unko = 0; unko < q; unko++) {
        fill(memo.begin(), memo.end(), Modint(-1));
        int x;
        cin >> x;
        memo[0] = Modint(1);
        memo[1] = Modint(x);
        cout << f(n, Modint(x)).n << endl;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0