제출 #596012

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
596012		Hanksburger	Cloud Computing (CEOI18_clo)	C++17	54 / 100	1082 ms	1956 KiB

clo

#include <bits/stdc++.h>
using namespace std;
pair<pair<long long, long long>, long long> a[4005];
long long dp[100005], tmp[100005];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long n, m;
    cin >> n;
    for (long long i=1; i<=n; i++)
    {
        cin >> a[i].second >> a[i].first.first >> a[i].first.second;
        a[i].first.second*=-1;
    }
    cin >> m;
    for (long long i=n+1; i<=n+m; i++)
    {
        cin >> a[i].second >> a[i].first.first >> a[i].first.second;
        a[i].second*=-1;
    }
    sort(a+1, a+n+m+1, greater<pair<pair<long long, long long>, long long> >());
    for (long long i=1; i<=1e5; i++)
        dp[i]=-1e18;
    for (long long i=1; i<=n+m; i++)
    {
        for (long long j=0; j<=1e5; j++)
        {
            if (j-a[i].second>=0 && j-a[i].second<=1e5)
                tmp[j]=max(dp[j], dp[j-a[i].second]+a[i].first.second);
            else
                tmp[j]=dp[j];
        }
//        cout << "i=" << i << ": " << a[i].second << ' ' << a[i].first.first << ' ' << a[i].first.second << '\n';
        for (long long j=0; j<=1e5; j++)
        {
            dp[j]=tmp[j];
//            if (j<=15)
//                cout << dp[j] << ' ';
        }
//        cout << '\n';
    }
    long long ans=0;
    for (long long i=0; i<=1e5; i++)
        ans=max(ans, dp[i]);
    cout << ans;
    return 0;
}

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