Submission #983683

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
983683	2024-05-15T23:07:50 Z	Sofiatpc	Jelly Flavours (IOI20_jelly)	C++14	10 / 100	48 ms	78808 KB

jelly

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

using namespace std;

const int MAXN = 2005, MAX = 1e4+5;
int dp[MAXN][MAX];

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
	int n = a.size();

	for(int i = n; i >= 1; i--)
		for(int j = 0; j <= x; j++){
			dp[i][j] = dp[i+1][j];
			if(j >= a[i-1])dp[i][j] = max(dp[i+1][j], dp[i+1][j-a[i-1]]+1);
		}
	int qtd;
	if(b[0] == 0)qtd = n;
	else qtd = y/b[0];
	return dp[1][x] + min(qtd,n-dp[1][x]);
}

Subtask #1

0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	348 KB	1st lines differ - on the 1st token, expected: '8', found: '9'
2	Halted	0 ms	0 KB	-

Subtask #2

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	348 KB	1st lines differ - on the 1st token, expected: '8', found: '9'
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	14 ms	76380 KB	1st lines differ - on the 1st token, expected: '689', found: '1949'
2	Halted	0 ms	0 KB	-

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	32 ms	76116 KB	Output is correct
2	Correct	30 ms	77908 KB	Output is correct
3	Correct	31 ms	78428 KB	Output is correct
4	Correct	34 ms	75100 KB	Output is correct
5	Correct	36 ms	77652 KB	Output is correct
6	Correct	29 ms	74788 KB	Output is correct
7	Correct	30 ms	77392 KB	Output is correct
8	Correct	31 ms	75252 KB	Output is correct
9	Correct	39 ms	75092 KB	Output is correct
10	Correct	34 ms	76192 KB	Output is correct
11	Correct	10 ms	76380 KB	Output is correct
12	Correct	8 ms	74332 KB	Output is correct
13	Correct	9 ms	76376 KB	Output is correct
14	Correct	9 ms	74588 KB	Output is correct
15	Correct	10 ms	76368 KB	Output is correct
16	Correct	9 ms	74332 KB	Output is correct
17	Correct	31 ms	78548 KB	Output is correct
18	Correct	29 ms	74840 KB	Output is correct
19	Correct	48 ms	76564 KB	Output is correct
20	Correct	36 ms	77136 KB	Output is correct
21	Correct	30 ms	76116 KB	Output is correct
22	Correct	30 ms	77912 KB	Output is correct
23	Correct	31 ms	78240 KB	Output is correct
24	Correct	33 ms	75100 KB	Output is correct
25	Correct	42 ms	77652 KB	Output is correct
26	Correct	30 ms	74844 KB	Output is correct
27	Correct	29 ms	77396 KB	Output is correct
28	Correct	30 ms	75348 KB	Output is correct
29	Correct	34 ms	75092 KB	Output is correct
30	Correct	34 ms	76380 KB	Output is correct
31	Correct	10 ms	76380 KB	Output is correct
32	Correct	9 ms	74324 KB	Output is correct
33	Correct	9 ms	76380 KB	Output is correct
34	Correct	10 ms	74588 KB	Output is correct
35	Correct	10 ms	76380 KB	Output is correct
36	Correct	8 ms	74452 KB	Output is correct
37	Correct	33 ms	78528 KB	Output is correct
38	Correct	30 ms	74836 KB	Output is correct
39	Correct	35 ms	76580 KB	Output is correct
40	Correct	33 ms	77140 KB	Output is correct
41	Correct	30 ms	76112 KB	Output is correct
42	Correct	30 ms	77908 KB	Output is correct
43	Correct	32 ms	78428 KB	Output is correct
44	Correct	34 ms	74940 KB	Output is correct
45	Correct	34 ms	77652 KB	Output is correct
46	Correct	29 ms	74836 KB	Output is correct
47	Correct	30 ms	77396 KB	Output is correct
48	Correct	38 ms	75380 KB	Output is correct
49	Correct	34 ms	75096 KB	Output is correct
50	Correct	40 ms	76368 KB	Output is correct
51	Correct	10 ms	76380 KB	Output is correct
52	Correct	8 ms	74308 KB	Output is correct
53	Correct	9 ms	76376 KB	Output is correct
54	Correct	9 ms	74588 KB	Output is correct
55	Correct	10 ms	76380 KB	Output is correct
56	Correct	9 ms	74332 KB	Output is correct
57	Correct	35 ms	78808 KB	Output is correct
58	Correct	31 ms	74844 KB	Output is correct
59	Correct	35 ms	76628 KB	Output is correct
60	Correct	32 ms	77136 KB	Output is correct
61	Correct	30 ms	76380 KB	Output is correct
62	Correct	30 ms	78140 KB	Output is correct
63	Correct	30 ms	78428 KB	Output is correct
64	Correct	33 ms	75344 KB	Output is correct
65	Correct	36 ms	77652 KB	Output is correct
66	Correct	32 ms	74840 KB	Output is correct
67	Correct	30 ms	77396 KB	Output is correct
68	Correct	31 ms	75200 KB	Output is correct
69	Correct	34 ms	75420 KB	Output is correct
70	Correct	34 ms	76152 KB	Output is correct
71	Correct	11 ms	76376 KB	Output is correct
72	Correct	8 ms	74332 KB	Output is correct
73	Correct	9 ms	76380 KB	Output is correct
74	Correct	10 ms	74840 KB	Output is correct
75	Correct	12 ms	76376 KB	Output is correct
76	Correct	9 ms	74332 KB	Output is correct
77	Correct	30 ms	78684 KB	Output is correct
78	Correct	29 ms	74800 KB	Output is correct
79	Correct	34 ms	76548 KB	Output is correct
80	Correct	33 ms	77148 KB	Output is correct
81	Correct	30 ms	76144 KB	Output is correct
82	Correct	32 ms	77924 KB	Output is correct
83	Correct	33 ms	78308 KB	Output is correct
84	Correct	34 ms	75092 KB	Output is correct
85	Correct	34 ms	77712 KB	Output is correct
86	Correct	29 ms	74836 KB	Output is correct
87	Correct	30 ms	77396 KB	Output is correct
88	Correct	30 ms	75208 KB	Output is correct
89	Correct	34 ms	75092 KB	Output is correct
90	Correct	34 ms	76256 KB	Output is correct
91	Correct	10 ms	76380 KB	Output is correct
92	Correct	8 ms	74332 KB	Output is correct
93	Correct	9 ms	76380 KB	Output is correct
94	Correct	9 ms	74588 KB	Output is correct
95	Correct	11 ms	76380 KB	Output is correct
96	Correct	9 ms	74332 KB	Output is correct
97	Correct	30 ms	78580 KB	Output is correct
98	Correct	30 ms	74844 KB	Output is correct
99	Correct	35 ms	76736 KB	Output is correct

Subtask #5

0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	32 ms	77140 KB	1st lines differ - on the 1st token, expected: '154', found: '147'
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	348 KB	1st lines differ - on the 1st token, expected: '8', found: '9'
2	Halted	0 ms	0 KB	-