Submission #1121633

#TimeUsernameProblemLanguageResultExecution timeMemory
1121633vjudge1Ice Hockey World Championship (CEOI15_bobek)C++17
50 / 100
1063 ms39608 KiB
#include <bits/stdc++.h> using namespace std; int main() { int64_t n, m, x, ans = 0; cin >> n >> m; unordered_multiset<int64_t> prices; for (int64_t i = 0; i < n; i++) { cin >> x; prices.insert(x); } unordered_map<int64_t, int64_t> dp; dp[0] = 1; for (const int64_t &price : prices) { for (int i = m; i >= 0; i--) { if (i - price < 0) { continue; } if (dp.find(i - price) == dp.end()) { continue; } dp[i] += dp[i - price]; } } for (const auto &[a, b] : dp) { ans += b; } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...