提出 #28322862

---

ソースコード 拡げる

// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
// using P = pair<ll,ll>;


const ll INF = (ll)1e18;
// const int INF = (int)1e9+7;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

template<typename T>
void print(vector<T> v) {
    int n = v.size();
    rep(i,n) {
        if (i == 0) cout << v[i];
        else cout << ' ' << v[i];
    }
    cout << endl;
}

void solve() {
    int n;
    cin >> n;
    vector<ll> a(n), b(n);
    const ll MAX = 3005;
    rep(i,n) cin >> a[i];
    rep(i,n) cin >> b[i];
    const ll MOD = 998244353;

    vector<vector<ll>> dp(n, vector<ll>(MAX, 0));
    rep2(x,a[0],b[0]+1) dp[0][x] = 1;
    rep2(i,1,n) {
        rep2(x,a[i],b[i]+1) {
            if (x == a[i]) {
                rep2(k,a[i-1],x+1) {
                    dp[i][x] += dp[i-1][k];
                    dp[i][x] %= MOD;
                }
            } else {
                dp[i][x] = (dp[i-1][x] + dp[i][x-1]) % MOD;
            }
        }
    }

    ll ans = 0;
    rep(i,MAX) {
        ans += dp[n-1][i];
        ans %= MOD;
    }
    cout << ans << endl;

}

int main() {
    solve();
    return 0;
}

提出情報

ジャッジ結果