Submission #1169445

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1169445	2025-03-18 18:19:12	owieczka	Jelly Flavours (IOI20_jelly)	C++20	10 / 100	54 ms	78664 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 <bits/stdc++.h>
using namespace std;
int dp[2'002][10'010];
pair<int, int> tab[2'002];
pair<int, int> tb[2'002];
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
  int n = a.size();
  for (int i = 0; i < n; i++)
  {
    tab[i+1] = {a[i], b[i]};
    tb[i+1] = {b[i], i+1};
  }
  sort(tab+1, tab + n+1);
  sort(tb+1,  tb+ n + 1);
  int ans = 0;
  for (int i = 1; i <= n; i++)
  {
    int m = INT_MAX;
    for (int a = 0; a <= x; a++)
    {
      dp[i][a] = dp[i-1][a] + tab[i].second;
      if (a >= tab[i].first) dp[i][a] = min(dp[i][a], dp[i-1][a-tab[i].first]);
      m = min(dp[i][a], m);
    }
    int left = y - m;
    m = i;
    if (left < 0)continue;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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