제출 #1255342

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1255342		_filya_	Cloud Computing (CEOI18_clo)	C++20	100 / 100	657 ms	2104 KiB

clo

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;

const int C = 1e5;

int main()
{
// 	ifstream cin("input.txt");
//     ofstream cout("output.txt");
	ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
	int n; cin >> n;
    vector<array<int, 3>> items;
    for (int i = 0; i < n; i++) {
        int c, f, v; cin >> c >> f >> v;
        items.push_back({f, c, -v});
    }
    int m; cin >> m;
    for (int i = 0; i < m; i++) {
        int c, f, v; cin >> c >> f >> v;
        items.push_back({f, -c, v});
    }
    sort(items.begin(), items.end());
    reverse(items.begin(), items.end());
    vector<ll> dp(C + 1, -1e18);
    dp[0] = 0;
    for (int i = 0; i < n + m; i++) {
        vector<ll> ndp(C + 1, -1e18);
        for (int cc = 0; cc <= C; cc++) {
            if (dp[cc] == -1e18) continue;
            ndp[cc] = max(ndp[cc], dp[cc]);
            if (cc + items[i][1] >= 0) ndp[cc + items[i][1]] = max(ndp[cc + items[i][1]], dp[cc] + items[i][2]);
        }
        swap(dp, ndp);
    }
    ll ans = 0;
    for (int cc = 0; cc <= C; cc++) ans = max(ans, dp[cc]);
    cout << ans << '\n';
}

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