Submission #430382

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
430382	2021-06-16 13:17:13	alireza_kaviani	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	32 ms	332 KiB

biscuits

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
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sep ' '
const int MAXN = 62;
ll x , A[MAXN];
map<ll , ll> dp[MAXN];
ll solve(int i , ll j){
  if(i == -1) return (j == 0);
  if(j >= 4 * x)  return 0;
  if(dp[i].find(j) != dp[i].end())  return dp[i][j];
  ll y = max(0ll , j - A[i]) * 2;
  dp[i][j] = solve(i - 1 , y) + solve(i - 1 , x + y);
//  cout << i << sep << j << sep << dp[i][j] << endl;
  return dp[i][j];
}
ll count_tastiness(ll x, vector<ll> a) {
  ::x = x; int n = a.size();
  for(int i = 0 ; i < n ; i++){
    A[i] = a[i];
  }
  for(int i = 0 ; i < MAXN ; i++){
    dp[i] = map<ll , ll>();
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 21
• Subtask 4: 0 / 35
• Subtask 5: 0 / 23