#793182 (C++17) No.2062 Sum of Subset mod 999630629

• 問題: No.2062 Sum of Subset mod 999630629
• ユーザー: tamato
• 提出日時: 2022-08-26 23:14:10
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 1,841 bytes
• コンパイル時間: 4,525 ms
• コンパイル使用メモリ: 258,964 KB
• 最終ジャッジ日時: 2025-01-31 05:36:51
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 10 WA * 19

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <bits/stdc++.h>
#include <atcoder/all>
//#define _GLIBCXX_DEBUG
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using namespace atcoder;
using ll = long long;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
long long pow(long long x, long long n, ll mod) {
    long long ret = 1;
    while (n > 0) {
        if (n & 1) ret *= x;  // n の最下位bitが 1 ならば x^(2^i) をかける
        ret %= mod;
        x *= x;
        x %= mod;
        n >>= 1;  // n を1bit 左にずらす
    }
    return ret;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll mod = 998244353;
  ll mod2 = 999630629;
  int N; cin >> N;
  vector<int> A(N);
  rep(i, N) cin >> A[i];
  ll ans = 0;
  ll pow2 = pow(2, N - 1, mod);
  rep(i, N) {
    ans = (ans + (pow2 * A[i]) % mod) % mod;
  }
  ll D = -mod2;
  rep(i, N) {
    D += A[i];
  }
  if (D >= 0) {
    vector<int> cnt(10000 + 1);
    rep(i, N) {
      cnt[A[i]]++;
    }
    vector<ll> dp(D + 1);
    dp[0] = 1;
    rep(i_, 10000) {
      int i = i_ + 1;
      if (cnt[i] == 0) continue;
      vector<int> K(0);
      int j = 0;
      while (true) {
        if (cnt[i] < (1 << j)) break;
        K.push_back(1 << j);
        cnt[i] -= (1 << j);
        j++;
      }
      if (cnt[i] > 0) K.push_back(cnt[i]);
      for (auto k: K) {
        ll ak = A[i] * k;
        if (ak > D) continue;
        vector<ll> dp_new(D + 1);
        rep(j, D + 1) {
          dp_new[j] = (dp_new[j] + dp[j])%mod;
          if (j + ak <= D) {
            dp_new[j + ak] = (dp_new[j + ak] + dp[j])%mod;
          }
        }
        dp = dp_new;
      }
    }
    rep(i, D + 1) {
      ans = (ans - (mod2 * dp[i])%mod) % mod;
    }
  }
  
  cout << ans << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX