Submission #317915

# Submission time Handle Problem Language Result Execution time Memory
317915 2020-10-30T19:50:56 Z ivan_tudor Jelly Flavours (IOI20_jelly) C++14
9 / 100
147 ms 78456 KB
#include "jelly.h"
#include <bits/stdc++.h>
using namespace std;
struct jelly{
	int a, b;
};
const int N = 2005;
const int INF = INT_MAX;
jelly v[N];
bool cmpj(jelly a, jelly b){
	return a.a < b.a;
}
bool cmpb(jelly a, jelly b){
	return a.b < b.b;
}
int dp[N][10005];
int cost[N];
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
	int n = a.size();
	for(int i=1;i<=n;i++){
		v[i] = {a[i-1], b[i-1]};
	}
	sort(v+ 1, v+n+1, cmpj);
	for(int i =0; i <= n;i++){
		for(int j = 0; j <= y;j++)
			dp[i][j] = INF;
	}
	dp[0][0] = 0;
	for(int i = 1; i<=n;i++){
		for(int j = 0; j<=y; j++){
			if(dp[i-1][j] == INF)
				continue;
			dp[i][j] = min(dp[i][j], dp[i-1][j] + v[i].a);
			if(j + v[i].b <=y)
				dp[i][j + v[i].b] = min(dp[i][j+v[i].b], dp[i-1][j]);
		}
	}
	cost[0] =  0;
	for(int i=1; i<=n; i++){
		cost[i] = INF;
		for(int j = 0;j<=y;j++){
			if(dp[i][j] <= x){
				cost[i] = j;
				break;
			}
		}
	}
	int ans = 0;
	for(int i= n ;i>=0;i--){
		if(cost[i] == INF)
			continue;
		int ramas =  y - cost[i];
		sort(v+i+1,v+n+1,cmpb);
		int j = i + 1;
		int cnt = 0;
		while(j <= n && ramas >= 0){
			cnt++;
			ramas -= v[j].b;
			j++;
		}
		ans = max(ans, i + cnt -1);
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Incorrect 1 ms 384 KB 1st lines differ - on the 1st token, expected: '12', found: '11'
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Incorrect 1 ms 384 KB 1st lines differ - on the 1st token, expected: '12', found: '11'
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 8 ms 8320 KB Output is correct
2 Correct 8 ms 8320 KB Output is correct
3 Correct 8 ms 8320 KB Output is correct
4 Correct 27 ms 8192 KB Output is correct
5 Correct 37 ms 8192 KB Output is correct
6 Correct 8 ms 8448 KB Output is correct
7 Correct 8 ms 8320 KB Output is correct
8 Correct 9 ms 8192 KB Output is correct
9 Correct 39 ms 8480 KB Output is correct
10 Correct 40 ms 8320 KB Output is correct
11 Correct 8 ms 8448 KB Output is correct
12 Correct 9 ms 8320 KB Output is correct
13 Correct 8 ms 8352 KB Output is correct
14 Correct 33 ms 8192 KB Output is correct
15 Correct 40 ms 8320 KB Output is correct
16 Correct 8 ms 8320 KB Output is correct
17 Correct 8 ms 8320 KB Output is correct
18 Correct 8 ms 8320 KB Output is correct
19 Correct 38 ms 8320 KB Output is correct
20 Correct 33 ms 8320 KB Output is correct
21 Correct 8 ms 8320 KB Output is correct
22 Correct 8 ms 8320 KB Output is correct
23 Correct 8 ms 8320 KB Output is correct
24 Correct 27 ms 8192 KB Output is correct
25 Correct 37 ms 8192 KB Output is correct
26 Correct 8 ms 8448 KB Output is correct
27 Correct 8 ms 8320 KB Output is correct
28 Correct 9 ms 8192 KB Output is correct
29 Correct 39 ms 8448 KB Output is correct
30 Correct 39 ms 8320 KB Output is correct
31 Correct 8 ms 8448 KB Output is correct
32 Correct 9 ms 8320 KB Output is correct
33 Correct 8 ms 8320 KB Output is correct
34 Correct 33 ms 8192 KB Output is correct
35 Correct 38 ms 8320 KB Output is correct
36 Correct 8 ms 8320 KB Output is correct
37 Correct 9 ms 8320 KB Output is correct
38 Correct 9 ms 8320 KB Output is correct
39 Correct 38 ms 8320 KB Output is correct
40 Correct 33 ms 8320 KB Output is correct
41 Correct 8 ms 8320 KB Output is correct
42 Correct 8 ms 8320 KB Output is correct
43 Correct 8 ms 8320 KB Output is correct
44 Correct 27 ms 8192 KB Output is correct
45 Correct 37 ms 8192 KB Output is correct
46 Correct 8 ms 8448 KB Output is correct
47 Correct 8 ms 8352 KB Output is correct
48 Correct 8 ms 8192 KB Output is correct
49 Correct 39 ms 8448 KB Output is correct
50 Correct 40 ms 8320 KB Output is correct
51 Correct 8 ms 8448 KB Output is correct
52 Correct 8 ms 8320 KB Output is correct
53 Correct 7 ms 8320 KB Output is correct
54 Correct 33 ms 8192 KB Output is correct
55 Correct 38 ms 8320 KB Output is correct
56 Correct 8 ms 8320 KB Output is correct
57 Correct 8 ms 8320 KB Output is correct
58 Correct 8 ms 8320 KB Output is correct
59 Correct 38 ms 8320 KB Output is correct
60 Correct 34 ms 8320 KB Output is correct
61 Correct 8 ms 8320 KB Output is correct
62 Correct 8 ms 8320 KB Output is correct
63 Correct 8 ms 8320 KB Output is correct
64 Correct 27 ms 8192 KB Output is correct
65 Correct 37 ms 8192 KB Output is correct
66 Correct 8 ms 8448 KB Output is correct
67 Correct 8 ms 8320 KB Output is correct
68 Correct 8 ms 8192 KB Output is correct
69 Correct 39 ms 8448 KB Output is correct
70 Correct 43 ms 8440 KB Output is correct
71 Correct 8 ms 8448 KB Output is correct
72 Correct 9 ms 8320 KB Output is correct
73 Correct 8 ms 8320 KB Output is correct
74 Correct 33 ms 8192 KB Output is correct
75 Correct 39 ms 8320 KB Output is correct
76 Correct 8 ms 8320 KB Output is correct
77 Correct 9 ms 8320 KB Output is correct
78 Correct 8 ms 8320 KB Output is correct
79 Correct 38 ms 8320 KB Output is correct
80 Correct 34 ms 8320 KB Output is correct
81 Correct 8 ms 8320 KB Output is correct
82 Correct 8 ms 8320 KB Output is correct
83 Correct 8 ms 8320 KB Output is correct
84 Correct 27 ms 8192 KB Output is correct
85 Correct 44 ms 8192 KB Output is correct
86 Correct 10 ms 8448 KB Output is correct
87 Correct 8 ms 8320 KB Output is correct
88 Correct 8 ms 8192 KB Output is correct
89 Correct 39 ms 8448 KB Output is correct
90 Correct 40 ms 8320 KB Output is correct
91 Correct 9 ms 8576 KB Output is correct
92 Correct 9 ms 8320 KB Output is correct
93 Correct 8 ms 8320 KB Output is correct
94 Correct 33 ms 8192 KB Output is correct
95 Correct 38 ms 8448 KB Output is correct
96 Correct 9 ms 8320 KB Output is correct
97 Correct 9 ms 8320 KB Output is correct
98 Correct 8 ms 8320 KB Output is correct
99 Correct 38 ms 8320 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 20 ms 18688 KB Output is correct
2 Correct 80 ms 78072 KB Output is correct
3 Correct 81 ms 78456 KB Output is correct
4 Incorrect 106 ms 75128 KB 1st lines differ - on the 1st token, expected: '1906', found: '1905'
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 24 ms 16640 KB Output is correct
2 Correct 116 ms 75256 KB Output is correct
3 Correct 114 ms 77432 KB Output is correct
4 Incorrect 147 ms 77048 KB 1st lines differ - on the 1st token, expected: '1956', found: '1955'
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Incorrect 1 ms 384 KB 1st lines differ - on the 1st token, expected: '12', found: '11'
5 Halted 0 ms 0 KB -