Submission #1196840

#	Time	Username	Problem	Language	Result	Execution time	Memory
1196840		tdkhai	Cloud Computing (CEOI18_clo)	C++20	100 / 100	475 ms	2104 KiB

clo

/*
        _.-- ,.--.
      .'   .'     /
       @       |'..--------._
     /      \._/              '.
    /  .-.-                     \
   (  /    \                     \
   \\      '.                  | #
    \\       \   -.           /
     :\       |    )._____.'   \
      "       |   /  \  |  \    )
              |   |./'  :__ \.-'
              '--'
*/
#include<bits/stdc++.h>
#define ll long long
#define llll pair<int,int>
#define ii pair<int,int>
#define fi first
#define se second
#define FOR(i,l,r) for(int i=l;i<=r;i++)
#define FOD(i,r,l) for(int i=r;i>=l;i--)
#define ull unsigned long long
#define iii pair<int,ii>
#define iv pair<pii,ii>
#define db double
#define ld long double
#define pb push_back


using namespace std;

const int dx[]  = {1, -1, 0, 0};
const int dy[]  = {0, 0, -1, 1};
const int dxx[] = {1, 1, -1, -1, 2, 2, -2, -2};
const int dyy[] = {2, -2, 2, -2, 1, -1, 1, -1};
const ll INF=1e18;


struct str
{
    int rate,price,cnt;
};
bool cmp(str a,str b)
{
    if(a.rate==b.rate) return a.price<b.price;
    return a.rate>b.rate;
}
const int N=2005;
int n,m,mx;
ll dp[N*50],dp1[N*50],ans;
vector<str> comp;
void solve()
{
    cin >> n;
    for(int i=1;i<=n;i++)
    {
        int cnt,rate,price;
        cin >> cnt >> rate >> price;
        price=-price;
        comp.pb({rate,price,cnt});
        mx+=cnt;
    }
    cin >> m;
    for(int i=1;i<=m;i++)
    {
        int cnt,rate,price;
        cin >> cnt >> rate >> price;
        cnt=-cnt;
        comp.pb({rate,price,cnt});
    }
    for(int i=1;i<=mx;i++)
    {
        dp[i]=dp1[i]=-INF;
    }
    dp1[0]=dp[0]=0;
    sort(comp.begin(),comp.end(),cmp);
    for(int i=0;i<comp.size();i++)
    {
        int cnt=comp[i].cnt,rate=comp[i].rate,price=comp[i].price;
//        cout << i << ":::" << cnt << ' ' << rate << ' ' << price << '\n';
        for(int c=0;c<=mx;c++)
        {
            int p=c-cnt;
            if(p>=0 and p<=mx)
            {
//                cout << c << ' '<< p << ' ' << dp1[p] << '\n';
                if(dp1[p]!=-INF)
                {
                    dp[c]=max(dp[c],dp1[p]+price);
//                    cout << c<< ' ';
                }
            }
        }
//        cout << '\n';
        for(int c=0;c<=mx;c++)
        {
            dp1[c]=dp[c];
        }
    }
    for(int i=0;i<=mx;i++)
    {
        ans=max(ans,dp1[i]);
    }
    cout << ans;
}
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//    freopen("tdk.inp","r",stdin);
//    freopen("tdk.out","w",stdout);
    int t=1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}

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