답안 #605437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
605437	2022-07-25T17:36:11 Z	HamletPetrosyan	비스킷 담기 (IOI20_biscuits)	C++17	42 / 100	1000 ms	72592 KB

biscuits

#include "biscuits.h"
#include <iostream>
#include <map>
using namespace std;

#define ll long long
#define add push_back
#define len(a) ((int)(a).size())
#define fr first
#define sc second

long long count_tastiness(long long x, vector<long long> a) {
	map<ll, ll> dp[70];

	for(int i = len(a); i < 66; i++){
		a.add(0);
	}

	dp[0][0] = 1;
	for(int i = 0; i < len(a); i++){
		for(auto v : dp[i]){
			dp[i + 1][((v.fr + a[i]) / 2)] += v.sc;
			if(a[i] + v.fr >= x) dp[i + 1][(v.fr + a[i] - x) / 2] += v.sc;
		}
	}
	return dp[len(a)][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	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	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	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

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

Subtask #3

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	107 ms	21880 KB	Output is correct
2	Correct	214 ms	11196 KB	Output is correct
3	Correct	358 ms	17816 KB	Output is correct
4	Correct	0 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	989 ms	22520 KB	Output is correct
9	Correct	618 ms	16196 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	8 ms	596 KB	Output is correct
12	Correct	96 ms	3840 KB	Output is correct
13	Correct	910 ms	22508 KB	Output is correct

Subtask #4

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1089 ms	72592 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	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	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	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	212 KB	Output is correct
16	Correct	0 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	212 KB	Output is correct
20	Correct	1 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	0 ms	212 KB	Output is correct
24	Correct	107 ms	21880 KB	Output is correct
25	Correct	214 ms	11196 KB	Output is correct
26	Correct	358 ms	17816 KB	Output is correct
27	Correct	0 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	989 ms	22520 KB	Output is correct
32	Correct	618 ms	16196 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	8 ms	596 KB	Output is correct
35	Correct	96 ms	3840 KB	Output is correct
36	Correct	910 ms	22508 KB	Output is correct
37	Execution timed out	1089 ms	72592 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-