#637626 (C++17) No.1457 ツブ消ししとるなHard

• 問題: No.1457 ツブ消ししとるなHard
• ユーザー: Example0911
• 提出日時: 2021-03-31 21:54:32
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 29 ms / 2,000 ms
• コード長: 2,283 bytes
• コンパイル時間: 2,528 ms
• コンパイル使用メモリ: 198,568 KB
• 最終ジャッジ日時: 2025-01-20 03:24:14
• ジャッジサーバーID （参考情報）: judge2 / judge2

ファイルパターン	結果
sample	AC * 4
other	AC * 17

ソースコード

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
92
93
94
95
96
97
98
99
100
101
102
103
#include "bits/stdc++.h"
#define int long long
using namespace std;
using ll = long long;
using P = pair<ll, pair<ll, ll>>;
const ll INF = (1LL << 61);
ll mod = 1000000007;
struct mint {
    ll x; // typedef long long ll;
    mint(ll x = 0) :x((x%mod + mod) % mod) {}
    mint operator-() const { return mint(-x); }
    mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += mod - a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator*=(const mint a) {
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res *= a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t >> 1);
        a *= a;
        if (t & 1) a *= *this;
        return a;
    }
    // for prime mod
    mint inv() const {
        return pow(mod - 2);
    }
    mint& operator/=(const mint a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint a) const {
        mint res(*this);
        return res /= a;
    }
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
long long dp[55][3000][55];
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, M, X, Y; cin >> N >> M >> X >> Y;
    int Z; cin >> Z;
    vector<int>A(N); for (int i = 0; i < N; i++)cin >> A[i];
    sort(A.begin(), A.end());
    int cnt = 0;
    for (int i = 0; i < N; i++) {
        if (A[i] >= X)cnt++;
    }
    bool ok = false;
    if (cnt == 0)ok = true;
    if (N - cnt < N - M) {
        
        cout << "Handicapped" << endl; return 0;
    }
    int cnt2 = 0;
    for (int i = 0; i < N; i++) {
        if (A[i] <= Y)cnt2++;
    }
    int sum = 0;
    for (int i = 0; i < N; i++) {
        if(A[i] >= X) sum += A[i];
    } 
    dp[0][0][0] = 1;
    for (int i = 0; i < N - cnt2; ++i) {
        for (int s = 0; s <= 2500; ++s) {
            for (int k = 0; k <= N; ++k) {
                if (dp[i][s][k] == 0) continue;
                if(A[cnt2 + i] < X)dp[i + 1][s][k] += dp[i][s][k];
                dp[i + 1][s + A[cnt2 + i]][k + 1] += dp[i][s][k];
            }
        }
    }
    long long res = 0;
    for (int k = 1; k <= M; ++k) {
        //if (N - cnt2 == M && k == M)continue;
        res += dp[N - cnt2][Z*k][k];
    }
    cout << res << endl;
    
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX