Submission #1121653

#TimeUsernameProblemLanguageResultExecution timeMemory
1121653vjudge1Ice Hockey World Championship (CEOI15_bobek)C++17
50 / 100
46 ms16464 KiB
#include <bits/stdc++.h> using namespace std; # define int long long const int maxn = 1e6 + 5; void solve() { int n, k, cnt = 0; cin >> n >> k; vector < int > a(n); multiset < int > st; vector < int > dp(maxn, 0); for(int i = 0; i < n; i++){ cin >> a[i]; } dp[0] = 1; for(int i = 0; i < n; i++) { for(int j = k; j >= 0; j--) { if(j - a[i] >= 0) dp[j] += dp[j - a[i]]; } } for(int i = 0; i <= k; i++) cnt += dp[i]; cout << cnt << endl; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int tt = 1; // cin >> tt; while(tt--) solve(); }
#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...