oj.uz

답안 #495620

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495620 2021-12-19T13:37:33 Z pooyashams Cloud Computing (CEOI18_clo) C++14
100 / 100
 1664 ms 3656 KB 
#include <algorithm>
#include <numeric>
#include <iostream>
#include <cstring>
#include <numeric>
#include <vector>
#include <bitset>
#include <stack>
#include <queue>
#include <cmath>
#include <set>
#include <map>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 4010;
const int maxs = maxn*50;
const ll inf = 1e17;

struct evnt
{
	int c, f, v;
	evnt(){};
	evnt(int _c, int _f, int _v)
	{
		c = _c;
		f = _f;
		v = _v;
	}
	inline bool operator<(evnt& o)
	{
		if(f == o.f)
			return v < o.v;
		return f > o.f;
	}
} events[maxn];

ll dp[2][maxs];

int32_t main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n; cin >> n;
	for(int i = 0; i < n; i++)
	{
		int c, f, v; cin >> c >> f >> v;
		events[i] = evnt(+c, f, -v);
	}
	int m; cin >> m;
	for(int i = n; i < n+m; i++)
	{
		int c, f, v; cin >> c >> f >> v;
		events[i] = evnt(-c, f, +v);
	}
	sort(events, events+n+m);
	fill(dp[0], dp[0]+maxs, -inf);
	fill(dp[1], dp[1]+maxs, -inf);
	if(events[0].v < 0)
		dp[0][events[0].c] = events[0].v;
	dp[0][0] = 0;
	ll ans = 0;
	for(int i = 1; i < n+m; i++)
	{
		int c = events[i].c;
		int v = events[i].v;
		for(int j = 0; j < maxs; j++)
		{
			dp[i&1][j] = dp[!(i&1)][j];
			if(c <= j and j-c < maxs)
				dp[i&1][j] = max(dp[i&1][j], dp[!(i&1)][j-c]+v);
			ans = max(ans, dp[i&1][j]);
		}
	}
	cout << ans << endl;
	return 0;
}

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3392 KB Output is correct
2 Correct 2 ms 3408 KB Output is correct
3 Correct 44 ms 3440 KB Output is correct
4 Correct 96 ms 3408 KB Output is correct
5 Correct 699 ms 3408 KB Output is correct
6 Correct 705 ms 3408 KB Output is correct
7 Correct 764 ms 3504 KB Output is correct
8 Correct 776 ms 3520 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3408 KB Output is correct
2 Correct 5 ms 3408 KB Output is correct
3 Correct 42 ms 3448 KB Output is correct
4 Correct 44 ms 3444 KB Output is correct
5 Correct 341 ms 3468 KB Output is correct
6 Correct 344 ms 3404 KB Output is correct
7 Correct 750 ms 3508 KB Output is correct
8 Correct 757 ms 3508 KB Output is correct
9 Correct 738 ms 3408 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 3396 KB Output is correct
2 Correct 12 ms 3464 KB Output is correct
3 Correct 68 ms 3396 KB Output is correct
4 Correct 67 ms 3408 KB Output is correct
5 Correct 134 ms 3396 KB Output is correct
6 Correct 140 ms 3452 KB Output is correct
7 Correct 188 ms 3456 KB Output is correct
8 Correct 192 ms 3468 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 3400 KB Output is correct
2 Correct 7 ms 3460 KB Output is correct
3 Correct 558 ms 3468 KB Output is correct
4 Correct 686 ms 3476 KB Output is correct
5 Correct 1447 ms 3540 KB Output is correct
6 Correct 1496 ms 3524 KB Output is correct
7 Correct 1491 ms 3536 KB Output is correct
8 Correct 1474 ms 3524 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3400 KB Output is correct
2 Correct 76 ms 3436 KB Output is correct
3 Correct 315 ms 3452 KB Output is correct
4 Correct 763 ms 3484 KB Output is correct
5 Correct 1583 ms 3536 KB Output is correct
6 Correct 1664 ms 3512 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3392 KB Output is correct
2 Correct 2 ms 3408 KB Output is correct
3 Correct 44 ms 3440 KB Output is correct
4 Correct 96 ms 3408 KB Output is correct
5 Correct 699 ms 3408 KB Output is correct
6 Correct 705 ms 3408 KB Output is correct
7 Correct 764 ms 3504 KB Output is correct
8 Correct 776 ms 3520 KB Output is correct
9 Correct 2 ms 3408 KB Output is correct
10 Correct 5 ms 3408 KB Output is correct
11 Correct 42 ms 3448 KB Output is correct
12 Correct 44 ms 3444 KB Output is correct
13 Correct 341 ms 3468 KB Output is correct
14 Correct 344 ms 3404 KB Output is correct
15 Correct 750 ms 3508 KB Output is correct
16 Correct 757 ms 3508 KB Output is correct
17 Correct 738 ms 3408 KB Output is correct
18 Correct 13 ms 3396 KB Output is correct
19 Correct 12 ms 3464 KB Output is correct
20 Correct 68 ms 3396 KB Output is correct
21 Correct 67 ms 3408 KB Output is correct
22 Correct 134 ms 3396 KB Output is correct
23 Correct 140 ms 3452 KB Output is correct
24 Correct 188 ms 3456 KB Output is correct
25 Correct 192 ms 3468 KB Output is correct
26 Correct 9 ms 3400 KB Output is correct
27 Correct 7 ms 3460 KB Output is correct
28 Correct 558 ms 3468 KB Output is correct
29 Correct 686 ms 3476 KB Output is correct
30 Correct 1447 ms 3540 KB Output is correct
31 Correct 1496 ms 3524 KB Output is correct
32 Correct 1491 ms 3536 KB Output is correct
33 Correct 1474 ms 3524 KB Output is correct
34 Correct 4 ms 3400 KB Output is correct
35 Correct 76 ms 3436 KB Output is correct
36 Correct 315 ms 3452 KB Output is correct
37 Correct 763 ms 3484 KB Output is correct
38 Correct 1583 ms 3536 KB Output is correct
39 Correct 1664 ms 3512 KB Output is correct
40 Correct 418 ms 3468 KB Output is correct
41 Correct 807 ms 3488 KB Output is correct
42 Correct 1198 ms 3512 KB Output is correct
43 Correct 1507 ms 3536 KB Output is correct
44 Correct 1532 ms 3540 KB Output is correct
45 Correct 1519 ms 3656 KB Output is correct
46 Correct 764 ms 3492 KB Output is correct
47 Correct 1184 ms 3536 KB Output is correct
48 Correct 1140 ms 3536 KB Output is correct