Submission #413542

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
413542	2021-05-28 21:43:35	nxteru	Jelly Flavours (IOI20_jelly)	C++14	100 / 100	189 ms	78740 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
#include "jelly.h"
#include <algorithm>
using namespace std;
void chmax(int &x,int y){
  if(x<y)x=y;
}
int dp[2005][10005],dp2[20005],ans;
int find_maximum_unique(int x, int y,vector<int> a,vector<int> b) {
  int n=a.size();
  vector<pair<int,int>>v;
  for(int i=0;i<n;i++){
    v.push_back(make_pair(a[i],b[i]));
  }
  sort(v.begin(),v.end());
  for(int i=0;i<=n;i++)for(int j=0;j<=y;j++)dp[i][j]=-1;
  dp[0][y]=x;
  for(int i=0;i<n;i++){
    for(int j=0;j<=y;j++){
      if(dp[i][j]>=v[i].first)chmax(dp[i+1][j],dp[i][j]-v[i].first);
      if(j>=v[i].second)chmax(dp[i+1][j-v[i].second],dp[i][j]);
    }
  }
  for(int i=n;i>=0;i--){
    for(int j=0;j<=y;j++){
      if(dp[i][j]>=0)chmax(ans,i+dp2[j]);
    }
    if(i==0)break;
    for(int j=y;j>=0;j--)chmax(dp2[j+v[i-1].second],dp2[j]+1);
  }
  return ans;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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