제출 #1275693

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1275693		zhaoxw	Cloud Computing (CEOI18_clo)	C++20	18 / 100	428 ms	1992 KiB

clo

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MAX_N = 4005;
const int INF = -1e9;
int dp[100005],g[100005],c,f,v,n,m,sum,ans,cnt = 1;
struct unionarray
{
    int uc,uf,uv;
    bool operator<(const unionarray &other)
    {
        return this->uf > other.uf;
    }
}a[MAX_N];
signed main()
{
    cin >> n;
    for(int i = 1;i <= n;i++)
    {
        cin >> c >> f >> v;
        sum += c;
        a[cnt++] = {c,f,-v};
    }
    cin >> m;
    for(int i = 1;i <= m;i++)
    {
        cin >> c >> f >> v;
        a[cnt++] = {-c,f,v};
    }
    cnt--;
    sort(a+1,a+cnt+1);
    for(int i = 1;i <= sum;i++)
        g[i] = INF;
    for(int i = 1;i <= cnt;i++)
    {
        for(int j = 0;j <= sum;j++)
        {
            dp[j] = INF;
            if(g[j] != INF) dp[j] = g[j];
            if(j-a[i].uc <= sum && j-a[i].uc >= 0 && g[j-a[i].uc] != INF)
                dp[j] = max(dp[j],g[j-a[i].uc]+a[i].uv);
        }
        for(int j = 0;j <= sum;j++)
            g[j] = dp[j];
    }
    for(int i = 0;i <= sum;i++)
        ans = max(ans,dp[i]);
    cout << ans << '\n';
    return 0;
}

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