제출 #392747

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
392747	2021-04-21 14:39:31	phathnv	Jelly Flavours (IOI20_jelly)	C++14	100 / 100	199 ms	154696 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 <bits/stdc++.h>
#include "jelly.h"
using namespace std;
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b){
    int n = a.size();
    vector<int> ind(n);
    for(int i = 0; i < n; i++)
        ind[i] = i;
    sort(ind.begin(), ind.end(), [&](const int &x, const int &y){
            return b[x] < b[y];
         });
    pair<int, int> dp[n + 1][x + 1];
    for(int i = 0; i <= n; i++)
        for(int j = 0; j <= x; j++)
            dp[i][j] = {0, 0};
    dp[0][x] = {0, y};
    for(int i = 0; i < n; i++)
        for(int j = 0; j <= x; j++){
            if (j >= a[ind[i]])
                dp[i + 1][j - a[ind[i]]] = max(dp[i + 1][j - a[ind[i]]], {dp[i][j].first + 1, dp[i][j].second});
            if (dp[i][j].second >= b[ind[i]])
                dp[i + 1][j] = max(dp[i + 1][j], {dp[i][j].first + 1, dp[i][j].second - b[ind[i]]});
            dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
        }
    int res = 0;
    for(int j = 0; j <= x; j++)
        res = max(res, dp[n][j].first);
  return res;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

jelly.cpp: In function 'int find_maximum_unique(int, int, std::vector<int>, std::vector<int>)':
jelly.cpp:27:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   27 |     for(int j = 0; j <= x; j++)
      |     ^~~
jelly.cpp:29:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   29 |  return res;
      |  ^~~~~~

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