Submission #433313

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
433313	2021-06-19 14:08:51	Tiago_Marques	Jelly Flavours (IOI20_jelly)	C++17	100 / 100	268 ms	304752 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;
typedef long long int ll;
typedef pair<ll, ll> ii;
#define REP(i, a, b) for (ll i=a; i<b; i++)
#define fs first
#define sd second
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b)
{
  int n = a.size();
  ii c[n];
  REP(i, 0, n)
  {
        c[i].fs = a[i];
        c[i].sd = b[i];
  }
  sort (c, c+n);
  ll adp[n+1][x+1] = {}, bdp[n+1][y+1] = {};
  REP(i, 1, n+1) REP(j, 0, x+1)
  {
        adp[i][j] = adp[i-1][j] + c[i-1].sd;
        if (j >= c[i-1].fs)
            adp[i][j] = min (adp[i][j], adp[i-1][j - c[i-1].fs]);
  }
  for (ll i=n-1; i>=0; i--) REP(j, 0, y+1)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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