답안 #416522

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
416522	2021-06-02T14:38:59 Z	SuhaibSawalha1	비스킷 담기 (IOI20_biscuits)	C++17	21 / 100	1000 ms	63300 KB

biscuits

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

vector<long long> a;
long long x;
map<long long, long long> dp[60];

long long calc (int i = 0, long long hv = 0) {
	if (i == 60) {
		return 1;
	}
	hv = (hv / 2) + a[i];
	if (dp[i].count(hv)) {
		return dp[i][hv];
	}
	long long ret = calc(i + 1, hv);
	if (hv >= x) {
		ret += calc(i + 1, hv - x);
	}
	return dp[i][hv] = ret;
}

long long count_tastiness(long long x, vector<long long> t) {
	::a = t;
	::x = x;
	for (int i = 0; i < 60; ++i) {
		dp[i].clear();
	}
	while (a.size() < 60) {
		a.push_back(0);
	}
	return calc();
}

Subtask #1

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	332 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	2 ms	332 KB	Output is correct

Subtask #2

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 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	300 KB	Output is correct
6	Correct	1 ms	300 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

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	196 ms	21908 KB	Output is correct
2	Correct	464 ms	11208 KB	Output is correct
3	Correct	772 ms	17872 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	Execution timed out	1085 ms	22620 KB	Time limit exceeded
9	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

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

Subtask #5

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	332 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	2 ms	332 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	0 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	300 KB	Output is correct
20	Correct	1 ms	300 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	196 ms	21908 KB	Output is correct
25	Correct	464 ms	11208 KB	Output is correct
26	Correct	772 ms	17872 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	Execution timed out	1085 ms	22620 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-