oj.uz

답안 #634790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
634790 2022-08-25T04:21:30 Z Zian_Jacobson Cloud Computing (CEOI18_clo) C++17
100 / 100
 583 ms 2132 KB 
#include<bits/stdc++.h>
using namespace std;
#define cIO ios_base::sync_with_stdio(0);cin.tie(0)
#define fileIO(x) ifstream fin(string(x)+".in"); ofstream fout(string(x)+".out")
#define cont(container, object) (container.find(object)!=container.end())
#define sz(x) (int) (x).size()
#define ll long long
#define v vector
#define purc tuple<ll, bool, ll, ll>//clock rate, whether the order is a computer, number of cores, cost>
const ll NEG_INF = LLONG_MIN / 2;
ll n, m;
int main()
{
	vector<purc> pcs;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		ll ci, fi, vi;
		cin >> ci >> fi >> vi;
		pcs.emplace_back(fi, true, ci, vi);
	}
	cin >> m;
	for (int i = 1; i <= m; i++)
	{
		ll Ci, Fi, Vi;
		cin >> Ci >> Fi >> Vi;
		pcs.emplace_back(Fi, false, Ci, Vi);
	}
	sort(pcs.begin(), pcs.end());
	reverse(pcs.begin(), pcs.end());
	vector<ll> dp1(50ll * n+1, NEG_INF);
	dp1[0] = 0;
	for (purc z : pcs)
	{
		vector<ll> dp2 = dp1;
		ll ci = get<2>(z), fi = get<0>(z), vi = get<3>(z);
		if (get<1>(z))// a computer
		{
			for (int d = ci; d <= 50ll * n; d++)
			{
				dp2[d] = max(dp2[d], dp1[d - ci] - vi);
			}
		}
		else// an order
		{
			for (int d = 0; d + ci <= 50ll * n; d++)
			{
				dp2[d] = max(dp2[d], dp1[d + ci] + vi);
			}
		}
		dp1 = dp2;
	}
	ll max_prof = 0;
	for (int i = 0; i <= 50ll * n; i++) max_prof = max(max_prof, dp1[i]);
	cout << max_prof << "\n";
	return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:36:22: warning: unused variable 'fi' [-Wunused-variable]
   36 |   ll ci = get<2>(z), fi = get<0>(z), vi = get<3>(z);
      |                      ^~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 304 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 4 ms 340 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 59 ms 1012 KB Output is correct
6 Correct 61 ms 1012 KB Output is correct
7 Correct 270 ms 1972 KB Output is correct
8 Correct 290 ms 2004 KB Output is correct
9 Correct 261 ms 1884 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 300 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 6 ms 468 KB Output is correct
6 Correct 6 ms 432 KB Output is correct
7 Correct 9 ms 468 KB Output is correct
8 Correct 9 ms 468 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 151 ms 1584 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 541 ms 2132 KB Output is correct
6 Correct 519 ms 2132 KB Output is correct
7 Correct 530 ms 2132 KB Output is correct
8 Correct 534 ms 2004 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 34 ms 756 KB Output is correct
4 Correct 111 ms 1080 KB Output is correct
5 Correct 552 ms 2132 KB Output is correct
6 Correct 583 ms 2132 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 304 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 59 ms 1012 KB Output is correct
14 Correct 61 ms 1012 KB Output is correct
15 Correct 270 ms 1972 KB Output is correct
16 Correct 290 ms 2004 KB Output is correct
17 Correct 261 ms 1884 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2 ms 300 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 6 ms 468 KB Output is correct
23 Correct 6 ms 432 KB Output is correct
24 Correct 9 ms 468 KB Output is correct
25 Correct 9 ms 468 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 151 ms 1584 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 541 ms 2132 KB Output is correct
31 Correct 519 ms 2132 KB Output is correct
32 Correct 530 ms 2132 KB Output is correct
33 Correct 534 ms 2004 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 34 ms 756 KB Output is correct
37 Correct 111 ms 1080 KB Output is correct
38 Correct 552 ms 2132 KB Output is correct
39 Correct 583 ms 2132 KB Output is correct
40 Correct 35 ms 780 KB Output is correct
41 Correct 96 ms 980 KB Output is correct
42 Correct 348 ms 1716 KB Output is correct
43 Correct 527 ms 2132 KB Output is correct
44 Correct 518 ms 2132 KB Output is correct
45 Correct 536 ms 2104 KB Output is correct
46 Correct 132 ms 1236 KB Output is correct
47 Correct 333 ms 1748 KB Output is correct
48 Correct 342 ms 1748 KB Output is correct