Submission #400340

#	Time	Username	Problem	Language	Result	Execution time	Memory
400340		abdzag	Cloud Computing (CEOI18_clo)	C++17	36 / 100	3076 ms	3268 KiB

clo

#include<bits/stdc++.h>
#include<unordered_map>
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define all(v) v.begin(),v.end()
#define trav(a,v) for(auto&a:v)
#define  sz(a) a.size()
typedef long double ld;
using namespace std;
const long long inf = 1e15;
typedef long long ll;
typedef unsigned long long ull;

int main()
{
    cin.sync_with_stdio(false);
    ll n,m;
    cin >> n;
    vector<pair<pair<ll, ll>, pair<ll, ll>>> v(n);
    rep(i, 0, n) {
        cin >> v[i].second.first >> v[i].first.first >> v[i].second.second;
        v[i].first.first *= -1;
    }
    cin >> m;
    v.resize(n + m);
    rep(i, n, n+m) {
        cin >> v[i].second.first >> v[i].first.first >> v[i].second.second;
        v[i].first.first *= -1;
        v[i].first.second = 1;
    }
    sort(all(v));
    map<ll,ll> dp;
    rep(i, -1000, 10000)if (i)dp[i] = -inf;
    map<ll,ll> dp0=dp;
    map<ll, ll> dp2 = dp;
    map<ll, ll> dp20 = dp;

    rep(i, 0, n+m) {
        rep(j, 0, 10000) {
            if (!v[i].first.second) {
                if (dp0[j] != -inf)dp[v[i].second.first + j] = max(dp0[v[i].second.first + j], dp0[j]-v[i].second.second);
            }
            else {
                if (dp0[j] != -inf)dp[-v[i].second.first + j] = max(dp0[-v[i].second.first + j], dp0[j] + v[i].second.second);

            }
        }
        dp0 = dp;
    }
    ll ans = 0;
    rep(i, 0, 1e4 + 1)ans = max(dp[i], ans);
    cout<<ans;
    return 0;
}

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