제출 #400893

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
400893		iulia13	Jelly Flavours (IOI20_jelly)	C++14	0 / 100	166 ms	78336 KiB

jelly

#include <iostream>
#include "jelly.h"
#include <algorithm>
#include <vector>
using namespace std;
const int N = 2e3 + 5;
const int V = 1e4 + 5;;
int dp[N][V];
int find_maximum_unique(int x, int y, vector <int> a, vector <int> b)
{
    int i, j, n, m;
    n = a.size();
    m = b.size();
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    for (i = 0; i <= max(n, m); i++)
        for (j = 0; j <= x; j++)
            dp[i][j] = 2e9;
    dp[0][0] = 0;
    for (i = 1; i <= max(n, m); i++)
    {
        for (j = 0; j <= x; j++)
        {
            if (dp[i - 1][j] == 2e9)
                continue;
            if (i <= n)
                dp[i][j + a[i - 1]] = min(dp[i][j], dp[i - 1][j]);
            if (i <= m)
                dp[i][j] = min(dp[i][j], dp[i - 1][j] + b[i - 1]);
        }
    }
    for (i = max(n, m); 0 <= i; i--)
        for (j = x; 0 <= j; j--)
            if (dp[i][j] <= y)
                return i;
}/*
vector <int> A, B;
int main()
{
    int x, y, n, m;
    cin >> x >> y >> n >> m;
    A.resize(n);
    B.resize(m);
    for (int i = 0; i < n; i++)
        cin >> A[i];
    for (int i = 0; i < m; i++)
        cin >> B[i];
    cout << find_maximum_unique(x, y, A, B);
    return 0;
}*/

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

jelly.cpp: In function 'int find_maximum_unique(int, int, std::vector<int>, std::vector<int>)':
jelly.cpp:36:1: warning: control reaches end of non-void function [-Wreturn-type]
   36 | }/*
      | ^

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