Submission #983692

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
983692	2024-05-15T23:19:16 Z	Sofiatpc	Jelly Flavours (IOI20_jelly)	C++14	14 / 100	1 ms	600 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();

	sort(a.begin(),a.end());
	int l = 1, r = n;
	while(l!=r){
		int mid = (l+r+1)/2;
		int curx = x, cury = y;
		for(int i = mid-1; i >= 0; i--){
			if(curx > cury)curx -= a[i];
			else cury -= a[i];
		}
		if(curx >= 0 && cury >= 0)l = mid;
		else r = mid-1;
	}

	int curx = x, cury = y;
	for(int i = l-1; i >= 0; i--){
		if(curx > cury)curx -= a[i];
		else cury -= a[i];
	}
	if(curx >= 0 && cury >= 0) return l;
	return 0;
}

Subtask #1

0 / 11.0

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

Subtask #2

0 / 24.0

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

Subtask #3

0 / 9.0

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

Subtask #4

0 / 10.0

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

Subtask #5

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	600 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	1 ms	344 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	1 ms	600 KB	Output is correct
44	Correct	1 ms	344 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	1 ms	348 KB	Output is correct
50	Correct	1 ms	348 KB	Output is correct
51	Correct	1 ms	348 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	1 ms	348 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	1 ms	348 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	1 ms	348 KB	Output is correct
58	Correct	1 ms	348 KB	Output is correct
59	Correct	1 ms	348 KB	Output is correct
60	Correct	1 ms	348 KB	Output is correct
61	Correct	1 ms	472 KB	Output is correct
62	Correct	1 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	1 ms	348 KB	Output is correct
65	Correct	1 ms	348 KB	Output is correct
66	Correct	1 ms	348 KB	Output is correct
67	Correct	1 ms	348 KB	Output is correct
68	Correct	1 ms	348 KB	Output is correct
69	Correct	1 ms	348 KB	Output is correct
70	Correct	1 ms	348 KB	Output is correct
71	Correct	1 ms	472 KB	Output is correct
72	Correct	1 ms	344 KB	Output is correct
73	Correct	1 ms	348 KB	Output is correct
74	Correct	1 ms	348 KB	Output is correct
75	Correct	1 ms	344 KB	Output is correct
76	Correct	1 ms	348 KB	Output is correct
77	Correct	1 ms	452 KB	Output is correct
78	Correct	1 ms	600 KB	Output is correct
79	Correct	1 ms	348 KB	Output is correct
80	Correct	1 ms	348 KB	Output is correct
81	Correct	1 ms	348 KB	Output is correct
82	Correct	1 ms	348 KB	Output is correct
83	Correct	1 ms	348 KB	Output is correct
84	Correct	1 ms	348 KB	Output is correct
85	Correct	1 ms	348 KB	Output is correct
86	Correct	1 ms	344 KB	Output is correct
87	Correct	1 ms	348 KB	Output is correct
88	Correct	1 ms	348 KB	Output is correct
89	Correct	1 ms	348 KB	Output is correct
90	Correct	1 ms	348 KB	Output is correct
91	Correct	1 ms	348 KB	Output is correct
92	Correct	1 ms	352 KB	Output is correct
93	Correct	1 ms	348 KB	Output is correct
94	Correct	1 ms	352 KB	Output is correct
95	Correct	1 ms	352 KB	Output is correct
96	Correct	1 ms	348 KB	Output is correct
97	Correct	1 ms	348 KB	Output is correct
98	Correct	1 ms	360 KB	Output is correct
99	Correct	1 ms	348 KB	Output is correct

Subtask #6

0 / 32.0

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