Submission #170990

#TimeUsernameProblemLanguageResultExecution timeMemory
170990bloopieIce Hockey World Championship (CEOI15_bobek)C++14
40 / 100
1087 ms95988 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN = 41; unordered_map<ll,ll> memo[MAXN]; int n; ll mm; ll a[MAXN]; ll solve(int i,ll m) { if(m > mm) return 0; if(i == n) return 1; if(memo[i].find(m) != memo[i].end()) return memo[i][m]; ll &ret = memo[i][m]; ret = 0; ret = solve(i + 1 , m + a[i]) + solve(i + 1 , m); return ret; } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> mm; for(int i = 0 ; i < n ; i++) cin >> a[i]; cout << solve(0,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...