oj.uz

Submission #77966

# Submission time Handle Problem Language Result Execution time Memory
77966 2018-10-01T13:41:06 Z aminra Cloud Computing (CEOI18_clo) C++14
100 / 100
 893 ms 8332 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)2e5 + 7;
const int MAXS = (int)100006;
const int infint = (int)1e9;
const ll inf = (ll)1e18;
ll n, dp[MAXS], tmp[MAXS], sz;
struct machine{
	ll c, f, v;
} m[MAXN];
struct person{
	ll C, F, V;
} p[MAXN];
vector<ll> which[MAXN];
bool cmp(person a, person b)
{
	return a.F < b.F;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> m[i].c >> m[i].f >> m[i].v;
	cin >> sz;
	for (int i = 0; i < sz; i++)
		cin >> p[i].C >> p[i].F >> p[i].V;
	sort(p, p + sz, cmp);
	vector<ll> v;
	for (int i = 0; i < sz; i++)
		v.push_back(p[i].F);
	for (int i = 0; i < n; i++)
	{
		int idx = upper_bound(v.begin(), v.end(), m[i].f) - v.begin() - 1;
		if(idx != -1)
			which[idx].push_back(i);
	}
	for (int i = 0; i < MAXS; i++)
		dp[i] = -inf;
	dp[0] = 0;
	for (int i = sz - 1; i >= 0; i--)
	{
		for (auto u : which[i])
		{
			for (int j = 0; j < MAXS; j++)
				tmp[i] = -inf;
			for (int j = 0; j < MAXS; j++)
			{
				tmp[j] = dp[j];
				if(j >= m[u].c)
					tmp[j] = max(tmp[j], dp[j - m[u].c] - m[u].v);
			}
			for (int j = 0; j < MAXS; j++)
				dp[j] = tmp[j];
		}
		for (int j = 0; j < MAXS; j++)
		{
			if(j + p[i].C < MAXS)
				dp[j] = max(dp[j], dp[j + p[i].C] + p[i].V);	
		}		
	}
	ll mx = 0;
	for (int i = 0; i < MAXS; i++)
		mx = max(mx, dp[i]);
	cout << mx;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6648 KB Output is correct
2 Correct 7 ms 6648 KB Output is correct
3 Correct 24 ms 6676 KB Output is correct
4 Correct 40 ms 6756 KB Output is correct
5 Correct 308 ms 6964 KB Output is correct
6 Correct 286 ms 7080 KB Output is correct
7 Correct 299 ms 7116 KB Output is correct
8 Correct 312 ms 7308 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7308 KB Output is correct
2 Correct 8 ms 7308 KB Output is correct
3 Correct 33 ms 7308 KB Output is correct
4 Correct 33 ms 7308 KB Output is correct
5 Correct 253 ms 7308 KB Output is correct
6 Correct 234 ms 7308 KB Output is correct
7 Correct 442 ms 7392 KB Output is correct
8 Correct 493 ms 7440 KB Output is correct
9 Correct 485 ms 7440 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 7440 KB Output is correct
2 Correct 15 ms 7440 KB Output is correct
3 Correct 28 ms 7440 KB Output is correct
4 Correct 27 ms 7440 KB Output is correct
5 Correct 97 ms 7440 KB Output is correct
6 Correct 95 ms 7440 KB Output is correct
7 Correct 102 ms 7440 KB Output is correct
8 Correct 99 ms 7440 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7440 KB Output is correct
2 Correct 10 ms 7440 KB Output is correct
3 Correct 384 ms 7440 KB Output is correct
4 Correct 251 ms 7440 KB Output is correct
5 Correct 802 ms 7552 KB Output is correct
6 Correct 825 ms 7588 KB Output is correct
7 Correct 797 ms 7684 KB Output is correct
8 Correct 787 ms 7728 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7728 KB Output is correct
2 Correct 21 ms 7728 KB Output is correct
3 Correct 198 ms 7728 KB Output is correct
4 Correct 361 ms 7728 KB Output is correct
5 Correct 790 ms 7792 KB Output is correct
6 Correct 893 ms 7792 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6648 KB Output is correct
2 Correct 7 ms 6648 KB Output is correct
3 Correct 24 ms 6676 KB Output is correct
4 Correct 40 ms 6756 KB Output is correct
5 Correct 308 ms 6964 KB Output is correct
6 Correct 286 ms 7080 KB Output is correct
7 Correct 299 ms 7116 KB Output is correct
8 Correct 312 ms 7308 KB Output is correct
9 Correct 8 ms 7308 KB Output is correct
10 Correct 8 ms 7308 KB Output is correct
11 Correct 33 ms 7308 KB Output is correct
12 Correct 33 ms 7308 KB Output is correct
13 Correct 253 ms 7308 KB Output is correct
14 Correct 234 ms 7308 KB Output is correct
15 Correct 442 ms 7392 KB Output is correct
16 Correct 493 ms 7440 KB Output is correct
17 Correct 485 ms 7440 KB Output is correct
18 Correct 14 ms 7440 KB Output is correct
19 Correct 15 ms 7440 KB Output is correct
20 Correct 28 ms 7440 KB Output is correct
21 Correct 27 ms 7440 KB Output is correct
22 Correct 97 ms 7440 KB Output is correct
23 Correct 95 ms 7440 KB Output is correct
24 Correct 102 ms 7440 KB Output is correct
25 Correct 99 ms 7440 KB Output is correct
26 Correct 11 ms 7440 KB Output is correct
27 Correct 10 ms 7440 KB Output is correct
28 Correct 384 ms 7440 KB Output is correct
29 Correct 251 ms 7440 KB Output is correct
30 Correct 802 ms 7552 KB Output is correct
31 Correct 825 ms 7588 KB Output is correct
32 Correct 797 ms 7684 KB Output is correct
33 Correct 787 ms 7728 KB Output is correct
34 Correct 8 ms 7728 KB Output is correct
35 Correct 21 ms 7728 KB Output is correct
36 Correct 198 ms 7728 KB Output is correct
37 Correct 361 ms 7728 KB Output is correct
38 Correct 790 ms 7792 KB Output is correct
39 Correct 893 ms 7792 KB Output is correct
40 Correct 207 ms 7792 KB Output is correct
41 Correct 364 ms 7792 KB Output is correct
42 Correct 592 ms 7916 KB Output is correct
43 Correct 790 ms 7916 KB Output is correct
44 Correct 831 ms 8008 KB Output is correct
45 Correct 762 ms 8068 KB Output is correct
46 Correct 392 ms 8068 KB Output is correct
47 Correct 609 ms 8184 KB Output is correct
48 Correct 558 ms 8332 KB Output is correct