제출 #747609

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
747609		bgnbvnbv	Cloud Computing (CEOI18_clo)	C++14	100 / 100	371 ms	1284 KiB

clo

#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=2e5;
const ll inf=1e18;
const ll mod=1e9+7;
ll n;
struct qq
{
    ll c,f,v;
    bool operator<(const qq&o)
    {
        if(f==o.f) return c>o.c;
        return f>o.f;
    }
}p[maxN];
ll m;
ll dp[maxN];
ll ans=0;
void solve()
{
    cin >> n;
    ll sum=0;
    for(int i=1;i<=n;i++)
    {
        cin >> p[i].c >> p[i].f >> p[i].v;
        sum+=p[i].c;
        p[i].v*=-1;
    }
    cin >> m;
    for(int i=n+1;i<=n+m;i++)
    {
        cin >>p[i].c >> p[i].f >> p[i].v;
        p[i].c*=-1;
    }
    sort(p+1,p+m+n+1);
    for(int i=0;i<=sum;i++) dp[i]=-inf;
    dp[0]=0;
    for(int i=1;i<=m+n;i++)
    {
        //cout << p[i].c <<' '<<p[i].f <<' '<<p[i].v<<'\n';
        if(p[i].c<0)
        {
            for(int j=0;j<=sum+p[i].c;j++)
            {
                dp[j]=max(dp[j],dp[j-p[i].c]+p[i].v);
            }
        }
        else
        {
            for(int j=sum;j>=p[i].c;j--)
            {
                dp[j]=max(dp[j],dp[j-p[i].c]+p[i].v);
            }
        }
    }
    for(int j=0;j<=sum;j++) ans=max(ans,dp[j]);
    cout << ans;
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

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