답안 #828839

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
828839	2023-08-17T17:14:55 Z	Abrar_Al_Samit	비스킷 담기 (IOI20_biscuits)	C++17	21 / 100	1000 ms	63208 KB

biscuits

#include <bits/stdc++.h>
#include "biscuits.h"

using namespace std;

int k = 122;
vector<long long>a;

long long x;
map<long long, long long>dp[125];

long long solve(int i, long long j) {
	if(i>=k) return 1;

	if(dp[i].find(j)!=dp[i].end()) return dp[i][j];
	long long &ret = dp[i][j];

	long long cr = a[i] + j;

	ret = solve(i+1, cr/2);
	if(cr>=x) ret += solve(i+1, (cr-x)/2);
	return ret;
}
long long count_tastiness(long long X, vector<long long> A) {
	A.resize(122);
	a = A, x = X;

	for(int i=0; i<k-1; ++i) {
		if(a[i]<=x) continue;
		long long take = max(0LL, a[i] - x);
		a[i] -= take - (take & 1);
		a[i+1] += take / 2;
	}
	for(int i=0; i<125; ++i) dp[i].clear();
	return solve(0, 0);
}

Subtask #1

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	352 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct

Subtask #3

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	152 ms	21964 KB	Output is correct
2	Correct	325 ms	11140 KB	Output is correct
3	Correct	552 ms	17956 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	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Execution timed out	1082 ms	22456 KB	Time limit exceeded
9	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1062 ms	63208 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	352 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	152 ms	21964 KB	Output is correct
25	Correct	325 ms	11140 KB	Output is correct
26	Correct	552 ms	17956 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	340 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Execution timed out	1082 ms	22456 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-