Submission #442356

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
442356	2021-07-07T13:59:01 Z	DmitryGrigorev	Packing Biscuits (IOI20_biscuits)	C++14	100 / 100	62 ms	1352 KB

biscuits

#include <bits/stdc++.h>
#define ll long long
#define db long double
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()

using namespace std;

const int mod = 1000000007;

void add(int& a, int b) {
  a += b;
  if (a >= mod) a -= mod;
  if (a < 0) a += mod;
}

int mult(int a, int b) {
  return a * (ll)b % mod;
}

int bp(int a, int b) {
  int res = 1;
  while (b > 0) {
    if (b & 1) res = mult(res, a);
    a = mult(a, a);
    b >>= 1;
  }
  return res;
}

ll dp[61][61];

ll count_tastiness(ll x, vector<ll> a) {

  int k = a.size();

  vector<ll> bounds;
  ll sum = 0;

  for (int i = 0; i < 60; ++i) {
    if (i < k) sum += (1LL<<i)*a[i];
    bounds.pb(sum / x);
  }

  for (int i = 0; i < 61; ++i) for (int j = 0; j < 61; ++j) dp[i][j] = 0;
  dp[60][0] = 1;

  for (int i = 60; i > 0; --i) {
    for (int j = 0; j < 61; ++j) {

      ll R = (1LL<<i) - 1;
      if (j > 0) R = bounds[j - 1] % (1LL<<i);
      ll C = bounds[i - 1];

      //////////////////////////////// ZERO TRANSITION


      if (R >= (1LL<<(i-1)) && C >= (1LL<<(i-1))) {
        dp[i - 1][0] += dp[i][j];
      }
      else if (R <= C) {
        dp[i - 1][j] += dp[i][j];
      }
      else {
        dp[i - 1][i] += dp[i][j];
      }

      ////////////////////////////////

      if (R < (1LL<<(i-1)) || C < (1LL<<(i-1))) {
        continue;
      }
      else if (R <= C) {
        dp[i - 1][j] += dp[i][j];
      }
      else {
        dp[i - 1][i] += dp[i][j];
      }

    }


  }

  ll ans = 0;
  for (int j = 0; j < 61; ++j) ans += dp[0][j];
  return ans;
}


#ifdef LOCAL
int main(){
	freopen("A_input.txt", "r", stdin);
	//freopen("A_output.txt", "w", stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0);

  int k;
  ll x;

  cin >> k >> x;

  vector<ll> v(k);
  for (auto &x : v) cin >> x;

  cout << count_tastiness(x, v) << endl;

}

#endif

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	296 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	292 KB	Output is correct

Subtask #4
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	332 KB	Output is correct
2	Correct	37 ms	1196 KB	Output is correct
3	Correct	37 ms	1100 KB	Output is correct
4	Correct	38 ms	1100 KB	Output is correct
5	Correct	38 ms	1200 KB	Output is correct
6	Correct	43 ms	1132 KB	Output is correct
7	Correct	38 ms	1148 KB	Output is correct
8	Correct	45 ms	1100 KB	Output is correct
9	Correct	40 ms	1164 KB	Output is correct
10	Correct	38 ms	1100 KB	Output is correct

Subtask #5
23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	296 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	204 KB	Output is correct
36	Correct	1 ms	292 KB	Output is correct
37	Correct	24 ms	332 KB	Output is correct
38	Correct	37 ms	1196 KB	Output is correct
39	Correct	37 ms	1100 KB	Output is correct
40	Correct	38 ms	1100 KB	Output is correct
41	Correct	38 ms	1200 KB	Output is correct
42	Correct	43 ms	1132 KB	Output is correct
43	Correct	38 ms	1148 KB	Output is correct
44	Correct	45 ms	1100 KB	Output is correct
45	Correct	40 ms	1164 KB	Output is correct
46	Correct	38 ms	1100 KB	Output is correct
47	Correct	28 ms	424 KB	Output is correct
48	Correct	62 ms	1336 KB	Output is correct
49	Correct	36 ms	412 KB	Output is correct
50	Correct	55 ms	1148 KB	Output is correct
51	Correct	33 ms	1352 KB	Output is correct
52	Correct	22 ms	436 KB	Output is correct
53	Correct	30 ms	1100 KB	Output is correct
54	Correct	38 ms	1164 KB	Output is correct
55	Correct	37 ms	1204 KB	Output is correct
56	Correct	41 ms	1204 KB	Output is correct
57	Correct	37 ms	1228 KB	Output is correct

Submission #442356

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 21.0 / 21.0

Subtask #4 35.0 / 35.0

Subtask #5 23.0 / 23.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
21.0 / 21.0

Subtask #4
35.0 / 35.0

Subtask #5
23.0 / 23.0