Submission #330107

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
330107	2020-11-24 01:13:04	Agnimandur	Jelly Flavours (IOI20_jelly)	Java	100 / 100	319 ms	13428 KiB

jelly

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
import java.util.*;
class jelly {
  int find_maximum_unique(int x, int y, int[] a, int[] b) {
    int N = a.length;
    int[][] vals = new int[N][2];
    for (int i = 0; i < N; i++)
      vals[i] = new int[] {a[i],b[i]};
    sort(vals);
    
    long[] dpX = new long[x+1];
    long[] budget = new long[N];
    for (int i = 0; i < N; i++) {
      long[] dpXnew = new long[x+1];
      for (int j = 0; j <= x; j++) {
        //buy in shop2
        dpXnew[j] = dpX[j]+vals[i][1];
        
        //buy in shop1
        if (j >= vals[i][0])
          dpXnew[j] = Math.min(dpXnew[j],dpX[j-vals[i][0]]);
      }
      dpX = dpXnew;
      budget[i] = y-dpX[x];
    }
    
    int ans = 0;
    int[] dpY = new int[y+1];
    for (int i = N-1; i >= 0; i--) {
      if (budget[i] >= 0)
        ans = Math.max(ans, i+1+dpY[(int)budget[i]]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 24 / 24
• Subtask 3: 9 / 9
• Subtask 4: 10 / 10
• Subtask 5: 14 / 14
• Subtask 6: 32 / 32