Submission #430097

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
430097	2021-06-16T11:28:26 Z	alishahali1382	Packing Biscuits (IOI20_biscuits)	C++14	100 / 100	116 ms	1332 KB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define debug(x) {cerr<<#x<<"="<<x<<"\n";}
#define debug2(x, y) {cerr<<"{"<<#x<<", "<<#y<<"}={"<<x<<", "<<y<<"}\n";}
#define debugp(p) {cerr<<#p<<"={"<<p.first<<", "<<p.second<<"}\n";}
#define debugv(abcd) {cerr<<#abcd<<": "; for (auto dcba:abcd) cerr<<dcba<<", ";cerr<<"\n";}
#define pb push_back
#define all(x) x.begin(), x.end()
#define SZ(x) ((int)x.size())

const int inf=1000000100; // 1e9
const ll INF=10000000001000000; // 1e16
const int mod=1000000007;
const int N=61;

ll n, m, k, x, y, u, v, t, a, b;
ll A[N];
map<ll, ll> dp;

ll Solve(ll n){
	// #y<=n
	if (n<0) return 0;
	if (!n) return 1;
	if (dp.count(n)) return dp[n];
	int k=0;
	while ((2ll<<k)<=n) k++;
	dp[n]=Solve((1ll<<k)-1);
	dp[n]+=Solve(min(n-(1ll<<k), A[k]-(1ll<<k)));
	return dp[n];
}

ll count_tastiness(ll x, vector<ll> _A){
	_A.resize(N, 0);
	for (int i=0; i<N; i++) A[i]=_A[i];
	for (int i=1; i<N; i++) A[i]=(A[i]<<i)+A[i-1];
	for (int i=0; i<N; i++) A[i]=(A[i])/x;
	dp.clear();
	ll ans=Solve((1ll<<N)-1);
	/*
	for (ll y=0; y<=A[N-1]; y++){
		int ok=1;
		for (int i=0; i<N && ok; i++) if ((y&((1ll<<(i+1))-1))>A[i]) ok=0;
		ans+=ok;
	}*/
	// debug(Solve(24))
	// debug(Solve(15))
	// debug(Solve(8))
	// debug(Solve(7))
	// debug(Solve())

	return ans;
}

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	256 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	272 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

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	2 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	2 ms	204 KB	Output is correct
12	Correct	2 ms	204 KB	Output is correct
13	Correct	2 ms	204 KB	Output is correct

Subtask #4
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	332 KB	Output is correct
2	Correct	35 ms	1176 KB	Output is correct
3	Correct	41 ms	1172 KB	Output is correct
4	Correct	34 ms	1100 KB	Output is correct
5	Correct	33 ms	1100 KB	Output is correct
6	Correct	44 ms	1120 KB	Output is correct
7	Correct	43 ms	1136 KB	Output is correct
8	Correct	58 ms	1100 KB	Output is correct
9	Correct	41 ms	1192 KB	Output is correct
10	Correct	30 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	256 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	272 KB	Output is correct
16	Correct	1 ms	204 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	204 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	2 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	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	2 ms	204 KB	Output is correct
35	Correct	2 ms	204 KB	Output is correct
36	Correct	2 ms	204 KB	Output is correct
37	Correct	13 ms	332 KB	Output is correct
38	Correct	35 ms	1176 KB	Output is correct
39	Correct	41 ms	1172 KB	Output is correct
40	Correct	34 ms	1100 KB	Output is correct
41	Correct	33 ms	1100 KB	Output is correct
42	Correct	44 ms	1120 KB	Output is correct
43	Correct	43 ms	1136 KB	Output is correct
44	Correct	58 ms	1100 KB	Output is correct
45	Correct	41 ms	1192 KB	Output is correct
46	Correct	30 ms	1100 KB	Output is correct
47	Correct	16 ms	384 KB	Output is correct
48	Correct	44 ms	1300 KB	Output is correct
49	Correct	29 ms	404 KB	Output is correct
50	Correct	32 ms	1164 KB	Output is correct
51	Correct	19 ms	1332 KB	Output is correct
52	Correct	13 ms	412 KB	Output is correct
53	Correct	21 ms	1084 KB	Output is correct
54	Correct	116 ms	1164 KB	Output is correct
55	Correct	106 ms	1196 KB	Output is correct
56	Correct	94 ms	1180 KB	Output is correct
57	Correct	77 ms	1208 KB	Output is correct

Submission #430097

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