Submission #1169388

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1169388	2025-03-18 15:31:40	anteknne	Jelly Flavours (IOI20_jelly)	C++20	100 / 100	148 ms	78732 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;
#define pii pair<int, int>
#define st first
#define nd second
#define pb push_back
const int MAXN = 2000;
const int MAXX = 10 * 1000;
int dp[MAXN + 1][MAXX + 1];
int minn[MAXN + 1];
vector<pii> v;
priority_queue<int> pq;
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
  int n = int(a.size());
    v.pb({-1, -1});
    for (int i = 0; i < n; i ++) {
        v.pb({a[i], b[i]});
    }
    sort(v.begin(), v.end());
    for (int i = 1; i <= n; i ++) {
        minn[i] = INT_MAX;
        for (int j = 0; j <= x; j ++) {
            dp[i][j] = dp[i - 1][j] + v[i].nd;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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