제출 #646433

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
646433		iulia13	Cloud Computing (CEOI18_clo)	C++14	72 / 100	593 ms	1796 KiB

clo

#include <bits/stdc++.h>

using namespace std;
#define ll long long
const int N = 4005;
const ll inf = 2e15;
struct ura{
    ll c, f, v;
} a[N];
bool cmp (ura x, ura y)
{
    return x.f > y.f;
}
ll n, m, mc;
ll dp[2][N * 50];
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].v *= -1;
        mc += a[i].c;
    }
    cin >> m;
    for (int i = n + 1; i <= n + m; i++)
    {
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].c *= -1;
    }
    sort(a + 1, a + n + m + 1, cmp);
    for (int i = 1; i <= mc; i++)
        dp[0][i] = -inf;
    for (int i = 1; i <= n + m; i++)
    {
        for (int j = 0; j <= mc; j++)
        {
            dp[i % 2][j] = dp[1 - i % 2][j];
            int pc = j - a[i].c;
            if (0 <= pc && pc <= mc && dp[1 - i % 2][pc] != inf) {
				dp[i % 2][j] = max(dp[i % 2][j], dp[1 - i % 2][pc] + a[i].v);
			}
        }
    }
    ll ans = 0;
    for (int i = 0; i <= mc; i++)
        ans = max(ans, dp[(n + m) % 2][i]);
    cout << ans;
    return 0;
}

• Subtask 1: 18 / 18
• Subtask 2: 18 / 18
• Subtask 3: 18 / 18
• Subtask 4: 0 / 18
• Subtask 5: 18 / 18
• Subtask 6: 0 / 10