Submission #590083

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
590083	2022-07-05T14:06:19 Z	Lucpp	Packing Biscuits (IOI20_biscuits)	C++17	21 / 100	1000 ms	63212 KB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int k = 60;
ll x;
vector<ll> a;

vector<map<ll, ll>> dp;

ll calc(int i, ll cnt){
	if(i == k) return 1;
	if(dp[i].count(cnt)) return dp[i][cnt];
	ll ans = 0;
	if(cnt+a[i] >= x){
		ans += calc(i+1, (cnt+a[i]-x)/2);
	}
	ans += calc(i+1, (cnt+a[i])/2);
	return dp[i][cnt] = ans;
}

ll count_tastiness(ll x_, vector<ll> a_) {
	x = x_; a = a_;
	a.resize(k);
	for(int i = 0; i < k; i++){
		if(a[i] <= x+1) continue;
		ll cnt = (a[i]-x)/2;
		a[i] -= 2*cnt;
		a[i+1] += cnt;
	}
	dp.clear();
	dp.resize(k);
	return calc(0, 0);
}

Subtask #1

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	304 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	236 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 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
14	Correct	1 ms	340 KB	Output is correct

Subtask #2

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	308 KB	Output is correct
2	Correct	1 ms	304 KB	Output is correct
3	Correct	1 ms	300 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	304 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	194 ms	21912 KB	Output is correct
2	Correct	346 ms	11220 KB	Output is correct
3	Correct	593 ms	17872 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Execution timed out	1088 ms	22572 KB	Time limit exceeded
9	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1091 ms	63212 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	304 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	236 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 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
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	308 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	1 ms	300 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	304 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	194 ms	21912 KB	Output is correct
25	Correct	346 ms	11220 KB	Output is correct
26	Correct	593 ms	17872 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	308 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Execution timed out	1088 ms	22572 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-