Submission #304295

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
304295	2020-09-21 05:52:28	shenxy	Packing Biscuits (IOI20_biscuits)	C++17	100 / 100	18 ms	896 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
#include "biscuits.h"
#include <algorithm>
#include <vector>
using namespace std;
long long count_tastiness(long long x, vector<long long> a) {
  while (a.size() < 60) a.push_back(0);
  vector<long long> b;
  for (long long i: a) b.push_back(i);
  for (int i = 1; i < 60; ++i) b[i] += b[i - 1] / 2;
  long long dp[61];
  dp[0] = 1;
  for (int i = 0; i < 60; ++i) {
    if (b[i] < x) {
      dp[i + 1] = dp[i];
      continue;
    }
    long long dpv = 0, k = max(0LL, x - a[i]) * 2;
    for (int j = i; j > 0; --j) {
      if (b[j - 1] >= k + x) dpv += dp[j - 1], k = max(0LL, k + x - a[j - 1]) * 2;
      else k = max(0LL, k - a[j - 1]) * 2;
    }
    if (k == 0) ++dpv;
    dp[i + 1] = dp[i] + dpv;
  }
  return dp[60];
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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