Submission #170986

#	Time	Username	Problem	Language	Result	Execution time	Memory
170986		bloopie	Ice Hockey World Championship (CEOI15_bobek)	C++14	30 / 100	1083 ms	77992 KiB

bobek

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 50;
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()
{
    cin >> n >> mm;
    for(int i = 0 ; i < n ; i++)
        cin >> a[i];

   cout << solve(0,0);
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 10 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10