oj.uz

Submission #563890

# Submission time Handle Problem Language Result Execution time Memory
563890 2022-05-18T08:54:43 Z topovik Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 13 ms 1332 KB 
#include <bits/stdc++.h>
#include "biscuits.h"

#include <cassert>
#include <cstdio>
#define pb push_back

using namespace std;

typedef long long ll;
//
//#ifdef _WIN32
//# define I64 "%I64d"
//#else
//# define I64 "%lld"
//#endif
//
//long long count_tastiness(long long, std::vector<long long>);
//
//int main () {
//	int q;
//	assert(scanf("%d", &q) == 1);
//	vector<int> k(q);
//	vector<long long> x(q);
//	vector<vector<long long>> a(q);
//	vector<long long> results(q);
//	for (int t = 0;  t < q;  t++) {
//		assert(scanf("%d" I64, &k[t], &x[t]) == 2);
//		a[t] = vector<long long>(k[t]);
//		for (int i = 0;  i < k[t];  i++)
//			assert(scanf(I64, &a[t][i]) == 1);
//	}
//	fclose(stdin);
//
//	for (int t = 0;  t < q;  t++)
//		results[t] = count_tastiness(x[t], a[t]);
//	for (int t = 0;  t < q;  t++)
//		printf(I64 "\n", results[t]);
//	fclose(stdout);
//	return 0;
//}

const int M = 61;

long long count_tastiness(long long x, std::vector<long long> a) {
    while (a.size() < M) a.pb(0);
    vector <ll> b = a;
    for (int i = 1; i < M; i++) b[i] += b[i - 1] / 2ll;
    ll dp[M + 1];
    dp[0] = 1;
    for (int i = 0; i < M; i++)
    {
        if (b[i] < x) {
			dp[i + 1] = dp[i];
			continue;
		}
        dp[i + 1] = dp[i];
        ll need = max(0ll, (x - a[i]) * 2ll);
        for (int j = i - 1; j >= 0; j--)
        {
            if (b[j] >= x + need)
            {
                dp[i + 1] += dp[j];
                need = max((x + need - a[j]) * 2ll, 0ll);
            }
            else need = max((need - a[j]) * 2ll, 0ll);
        }
        if (need == 0) dp[i + 1]++;
    }
    return dp[M];
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 300 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 8 ms 1192 KB Output is correct
3 Correct 9 ms 1108 KB Output is correct
4 Correct 10 ms 1204 KB Output is correct
5 Correct 8 ms 1108 KB Output is correct
6 Correct 8 ms 1080 KB Output is correct
7 Correct 8 ms 1108 KB Output is correct
8 Correct 7 ms 1076 KB Output is correct
9 Correct 8 ms 1108 KB Output is correct
10 Correct 11 ms 1076 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 304 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 8 ms 1192 KB Output is correct
39 Correct 9 ms 1108 KB Output is correct
40 Correct 10 ms 1204 KB Output is correct
41 Correct 8 ms 1108 KB Output is correct
42 Correct 8 ms 1080 KB Output is correct
43 Correct 8 ms 1108 KB Output is correct
44 Correct 7 ms 1076 KB Output is correct
45 Correct 8 ms 1108 KB Output is correct
46 Correct 11 ms 1076 KB Output is correct
47 Correct 3 ms 340 KB Output is correct
48 Correct 13 ms 1332 KB Output is correct
49 Correct 5 ms 340 KB Output is correct
50 Correct 11 ms 1176 KB Output is correct
51 Correct 8 ms 1232 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 7 ms 1080 KB Output is correct
54 Correct 11 ms 1096 KB Output is correct
55 Correct 11 ms 1124 KB Output is correct
56 Correct 10 ms 1108 KB Output is correct
57 Correct 10 ms 1236 KB Output is correct