Submission #426311

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
426311	2021-06-13T17:29:38 Z	Apiram	Jelly Flavours (IOI20_jelly)	C++14	10 / 100	989 ms	2097156 KB

jelly

#include "jelly.h"
#include <cstdio>
#include <cassert>
#include <vector>
#include<bits/stdc++.h>
using namespace std;
int find_maximum_unique(int x, int y, std::vector<int> arr, std::vector<int> brr) {
	int n = arr.size();
	bool ok=true;
	bool okay=true;
	for (int i =0;i<n;++i){
		if (arr[i]!=brr[i]){
			ok=false;break;
		}
		if (i>0){
			if (brr[i]!=brr[i-1])okay=false;
		}
	}
	if (okay){
		vector<pair<int,int>>crr(n);
		for (int i=0;i<n;++i){
			crr[i]={arr[i],brr[i]};
		}
		sort(crr.begin(),crr.end());
		int ans=0;
		n--;
		while(n>=0){
			if (y-crr[n].second>=0){
				y-=crr[n].second;
				--n;
				ans++;
			}
			else break;
		}
		for (int i =0;i<=n;++i){
			if (x-crr[i].first<0)break;
			x-=crr[i].first;
			ans++;
		}
		return ans;
	}
	int dp [n+1][x+1][y+1];
	memset(dp,0,sizeof dp);
	for (int i =1;i<=n;++i){
		for (int j =0;j<=x;++j){
			for (int k =0;k<=y;++k){
				dp[i][j][k] = max({(j-arr[i-1]>=0)?dp[i-1][j-arr[i-1]][k]+1:0,(k-brr[i-1]>=0)?dp[i-1][j][k-brr[i-1]]+1:0,dp[i-1][j][k],dp[i][j][k]});
			}
		}
	}
	return dp[n][x][y];
	

}

Compilation message

jelly.cpp: In function 'int find_maximum_unique(int, int, std::vector<int>, std::vector<int>)':
jelly.cpp:9:7: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
    9 |  bool ok=true;
      |       ^~

Subtask #1
0 / 11.0

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

Subtask #2
0 / 24.0

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

Subtask #3
0 / 9.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	989 ms	2097156 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 32.0

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

Submission #426311

Compilation message

Subtask #1 0 / 11.0

Subtask #2 0 / 24.0

Subtask #3 0 / 9.0

Subtask #4 10.0 / 10.0

Subtask #5 0 / 14.0

Subtask #6 0 / 32.0

Subtask #1
0 / 11.0

Subtask #2
0 / 24.0

Subtask #3
0 / 9.0

Subtask #4
10.0 / 10.0

Subtask #5
0 / 14.0

Subtask #6
0 / 32.0