提出 #75560005

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define int ll

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

mt19937_64 rng(std::chrono::system_clock::now().time_since_epoch().count());

int dp[69][25][220];

const int mod = 998244353;

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int n,s,t;
    cin >> n >> s >> t;
    dp[0][0][0] = 1;
    vector<int>a(n);
    for(int i = 0; i<n; i++){
        cin >> a[i];
    }
    vector<vi>cnt(n+1,vi(405));
    cnt[0][0] = 1;
    for(int i = 0; i<n; i++){
        vector<vi>cnt2 = cnt;
        for(int j = 0; j<n; j++){
            for(int k = 0; k<=200; k++){
                cnt2[j+1][k+a[i]] += cnt[j][k];
            }
        }
        cnt = cnt2;
    }
    for(int i = 0; i<60; i++){
        for(int j = 0; j<=20; j++){
            for(int k = 0; k<=200; k++){
                for(int amt = (s+j)%2; amt<=n; amt+=2){
                    for(int d = (t+k)%2; d<=200; d+=2){
                        dp[i+1][(j+amt)/2][(k+d)/2] += dp[i][j][k] * cnt[amt][d];
                        dp[i+1][(j+amt)/2][(k+d)/2] %= mod;
                    }
                }
            }
        }
        s/=2; t/=2;
    }
    cout << dp[60][0][0] << '\n';
    return 0;
}

提出情報

ジャッジ結果