oj.uz

Submission #1064637

# Submission time Handle Problem Language Result Execution time Memory
1064637 2024-08-18T15:57:06 Z sssamui Cloud Computing (CEOI18_clo) C++17
100 / 100
 878 ms 1440 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
using namespace std;
using ll = long long;

const ll NEGINF = -1e18;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	cin >> n;
	vector<pair<int, pair<int, ll>>> transac(0);
	while (n--)
	{
		int a, b;
		ll c;
		cin >> a >> b >> c;
		transac.push_back({ b, {a, -c} });
	}

	cin >> n;
	while (n--)
	{
		int a, b;
		ll c;
		cin >> a >> b >> c;
		transac.push_back({ b, {-a, c} });
	}

	sort(transac.begin(), transac.end());
	vector<ll> dp(1e5 + 1, NEGINF);
	dp[0] = 0;
	while (!transac.empty())
	{
		int numtadd = transac.back().second.first;
		ll ptadd = transac.back().second.second;
		transac.pop_back();
		if (numtadd > 0) for (int inord = 1e5 - numtadd; inord > -1; inord--) dp[numtadd + inord] = fmax(dp[numtadd + inord], dp[inord] + ptadd);
		else for (int inord = -numtadd; inord <= 1e5; inord++) dp[numtadd + inord] = fmax(dp[numtadd + inord], dp[inord] + ptadd);
	}

	ll ans = 0;
	for (int inord = 0; inord <= 1e5; inord++) ans = fmax(ans, dp[inord]);
	cout << ans;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 22 ms 1116 KB Output is correct
4 Correct 42 ms 1116 KB Output is correct
5 Correct 383 ms 1372 KB Output is correct
6 Correct 382 ms 1372 KB Output is correct
7 Correct 405 ms 1368 KB Output is correct
8 Correct 404 ms 1372 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1112 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 26 ms 1116 KB Output is correct
4 Correct 31 ms 1116 KB Output is correct
5 Correct 212 ms 1116 KB Output is correct
6 Correct 209 ms 1112 KB Output is correct
7 Correct 466 ms 1368 KB Output is correct
8 Correct 487 ms 1368 KB Output is correct
9 Correct 456 ms 1112 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1116 KB Output is correct
2 Correct 8 ms 1116 KB Output is correct
3 Correct 39 ms 1116 KB Output is correct
4 Correct 40 ms 1112 KB Output is correct
5 Correct 80 ms 1116 KB Output is correct
6 Correct 79 ms 1116 KB Output is correct
7 Correct 113 ms 1112 KB Output is correct
8 Correct 116 ms 1112 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1116 KB Output is correct
2 Correct 4 ms 1116 KB Output is correct
3 Correct 384 ms 1112 KB Output is correct
4 Correct 364 ms 1116 KB Output is correct
5 Correct 815 ms 1368 KB Output is correct
6 Correct 878 ms 1368 KB Output is correct
7 Correct 865 ms 1368 KB Output is correct
8 Correct 832 ms 1372 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1116 KB Output is correct
2 Correct 34 ms 1116 KB Output is correct
3 Correct 180 ms 1116 KB Output is correct
4 Correct 425 ms 1368 KB Output is correct
5 Correct 846 ms 1368 KB Output is correct
6 Correct 876 ms 1368 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 22 ms 1116 KB Output is correct
4 Correct 42 ms 1116 KB Output is correct
5 Correct 383 ms 1372 KB Output is correct
6 Correct 382 ms 1372 KB Output is correct
7 Correct 405 ms 1368 KB Output is correct
8 Correct 404 ms 1372 KB Output is correct
9 Correct 2 ms 1112 KB Output is correct
10 Correct 3 ms 1116 KB Output is correct
11 Correct 26 ms 1116 KB Output is correct
12 Correct 31 ms 1116 KB Output is correct
13 Correct 212 ms 1116 KB Output is correct
14 Correct 209 ms 1112 KB Output is correct
15 Correct 466 ms 1368 KB Output is correct
16 Correct 487 ms 1368 KB Output is correct
17 Correct 456 ms 1112 KB Output is correct
18 Correct 7 ms 1116 KB Output is correct
19 Correct 8 ms 1116 KB Output is correct
20 Correct 39 ms 1116 KB Output is correct
21 Correct 40 ms 1112 KB Output is correct
22 Correct 80 ms 1116 KB Output is correct
23 Correct 79 ms 1116 KB Output is correct
24 Correct 113 ms 1112 KB Output is correct
25 Correct 116 ms 1112 KB Output is correct
26 Correct 5 ms 1116 KB Output is correct
27 Correct 4 ms 1116 KB Output is correct
28 Correct 384 ms 1112 KB Output is correct
29 Correct 364 ms 1116 KB Output is correct
30 Correct 815 ms 1368 KB Output is correct
31 Correct 878 ms 1368 KB Output is correct
32 Correct 865 ms 1368 KB Output is correct
33 Correct 832 ms 1372 KB Output is correct
34 Correct 3 ms 1116 KB Output is correct
35 Correct 34 ms 1116 KB Output is correct
36 Correct 180 ms 1116 KB Output is correct
37 Correct 425 ms 1368 KB Output is correct
38 Correct 846 ms 1368 KB Output is correct
39 Correct 876 ms 1368 KB Output is correct
40 Correct 225 ms 1116 KB Output is correct
41 Correct 416 ms 1372 KB Output is correct
42 Correct 658 ms 1372 KB Output is correct
43 Correct 851 ms 1372 KB Output is correct
44 Correct 859 ms 1372 KB Output is correct
45 Correct 856 ms 1368 KB Output is correct
46 Correct 433 ms 1116 KB Output is correct
47 Correct 667 ms 1368 KB Output is correct
48 Correct 656 ms 1440 KB Output is correct