제출 #950475

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
950475		ALTAKEXE	Jelly Flavours (IOI20_jelly)	C++14	24 / 100	38 ms	960 KiB

jelly

#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<ll, ll>
ll const INF = LLONG_MAX;
using namespace std;
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b)
{
    ll n = a.size();
    vector<pii> v(n);
    for (ll i = 0; i < n; i++)
        v[i] = make_pair(a[i], b[i]);
    sort(v.begin(), v.end());
    vector<ll> dp;
    vector<ll> umn(x + 1, 0);
    umn[0] = 0;
    ll i;
    for (i = 0; i < n; i++)
    {
        ll ok = 0;
        dp = vector<ll>(x + 1, INF);
        ll A = v[i].f, B = v[i].s;
        for (ll j = 0; j <= x; j++)
        {
            dp[j] = umn[j] + B;
            if (j - A >= 0)
                dp[j] = min(dp[j], umn[j - A]);
            ok |= (dp[j] <= y);
        }
        if (!ok)
            break;
        swap(dp, umn);
    }
    return i;
}

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