제출 #316951

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
316951	2020-10-28 16:49:57	mihai145	Jelly Flavours (IOI20_jelly)	C++14	100 / 100	243 ms	78840 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 <vector>
#include <algorithm>
const int NMAX = 2000;
const int XMAX = 10000;
const int INF = 10 * XMAX;
std::vector < std::pair <int, int> > pairs;
int dp[NMAX + 2][XMAX + 2];
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
  int n = (int)a.size();
  for(int i = 0; i < n; i++)
        pairs.push_back({a[i], b[i]});
  sort(pairs.begin(), pairs.end());
  for(int i = 1; i <= n; i++)
        for(int bugA = 0; bugA <= x; bugA++)
            dp[i][bugA] = INF;
    for(int i = 0; i < n; i++)
        for(int bugA = 0; bugA <= x; bugA++)
            if(dp[i][bugA] <= y)
            {
                ///cumpar i + 1 din A
                if(bugA + pairs[i].first <= x)
                    dp[i + 1][bugA + pairs[i].first] = std::min(dp[i + 1][bugA + pairs[i].first], dp[i][bugA]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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