oj.uz

Submission #637846

# Submission time Handle Problem Language Result Execution time Memory
637846 2022-09-03T12:08:16 Z Neos Cloud Computing (CEOI18_clo) C++14
100 / 100
 2058 ms 4044 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

template <class T>
bool minimize(T &a, const T &b) {
    if(a > b) {a = b; return 1;}
    return 0;
}
template <class T>
bool maximize(T &a, const T &b) {
    if(a < b) {a = b; return 1;}
    return 0;
}

const int N = 4e3 + 7, M = 50 + 7, MOD = 1e9 + 7;	

int n, m;
ll dp[N * M + M], prv[N * M + M];

struct item {
	int c, f, v;
	item() {}
	item(int c, int f, int v):
		c(c), f(f), v(v) {}
	bool operator<(const item &other) const {
		return (f == other.f ? c > other.c : f > other.f);
	}
} a[N];

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	if (fopen("test.inp", "r"))
		freopen("test.inp", "r", stdin);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].c >> a[i].f >> a[i].v;
		a[i].v = -a[i].v;
	}
	cin >> m;
	for (int i = 1; i <= m; i++) {
		cin >> a[i + n].c >> a[i + n].f >> a[i + n].v;
		a[i + n].c = -a[i + n].c;
	}
	
	sort(a + 1, a + n + m + 1);	
	fill(prv, prv + N * M + M + 1, -1e18);
	prv[M] = 0;

	int st = 0;
	while (st + 1 < n + m && a[st + 1].c < 0 && a[st + 1].f > a[st + 2].f) ++st;
	for (int i = st; i < n + m; i++) {
		fill(dp, dp + N * M + M + 1, -1e18);
		for (int j = 0; j <= 50 * n; j++) if (prv[j + M] != -1e18) {
			// choose
			if (j + a[i + 1].c <= 50 * n) {
				maximize(dp[M + j + a[i + 1].c], prv[j + M] + a[i + 1].v);
			}
			// not choose
			maximize(dp[M + j], prv[j + M]);
		}
		swap(dp, prv);
	}
	ll ans = 0;
	for (int i = 0; i <= 50 * n; i++) {
		maximize(ans, prv[i + M]);
	}
	cout << ans;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:36:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |   freopen("test.inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:49:6: warning: array subscript 228457 is outside array bounds of 'long long int [228456]' [-Warray-bounds]
   49 |  fill(prv, prv + N * M + M + 1, -1e18);
      |  ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:21:19: note: while referencing 'prv'
   21 | ll dp[N * M + M], prv[N * M + M];
      |                   ^~~
clo.cpp:55:7: warning: array subscript 228457 is outside array bounds of 'long long int [228456]' [-Warray-bounds]
   55 |   fill(dp, dp + N * M + M + 1, -1e18);
      |   ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:21:4: note: while referencing 'dp'
   21 | ll dp[N * M + M], prv[N * M + M];
      |    ^~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Correct 29 ms 3892 KB Output is correct
4 Correct 52 ms 3876 KB Output is correct
5 Correct 422 ms 3900 KB Output is correct
6 Correct 488 ms 3796 KB Output is correct
7 Correct 528 ms 3904 KB Output is correct
8 Correct 490 ms 3916 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 4 ms 3796 KB Output is correct
3 Correct 39 ms 3876 KB Output is correct
4 Correct 34 ms 3796 KB Output is correct
5 Correct 313 ms 3896 KB Output is correct
6 Correct 286 ms 3888 KB Output is correct
7 Correct 824 ms 3796 KB Output is correct
8 Correct 708 ms 3904 KB Output is correct
9 Correct 933 ms 3900 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3784 KB Output is correct
2 Correct 8 ms 3884 KB Output is correct
3 Correct 28 ms 3796 KB Output is correct
4 Correct 26 ms 3796 KB Output is correct
5 Correct 93 ms 3880 KB Output is correct
6 Correct 97 ms 3796 KB Output is correct
7 Correct 146 ms 3880 KB Output is correct
8 Correct 135 ms 3884 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3796 KB Output is correct
2 Correct 5 ms 3796 KB Output is correct
3 Correct 556 ms 3796 KB Output is correct
4 Correct 444 ms 3916 KB Output is correct
5 Correct 1700 ms 3988 KB Output is correct
6 Correct 1782 ms 3972 KB Output is correct
7 Correct 2058 ms 3972 KB Output is correct
8 Correct 1995 ms 3976 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3796 KB Output is correct
2 Correct 26 ms 3896 KB Output is correct
3 Correct 249 ms 3916 KB Output is correct
4 Correct 627 ms 3904 KB Output is correct
5 Correct 1765 ms 3924 KB Output is correct
6 Correct 1802 ms 3928 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Correct 29 ms 3892 KB Output is correct
4 Correct 52 ms 3876 KB Output is correct
5 Correct 422 ms 3900 KB Output is correct
6 Correct 488 ms 3796 KB Output is correct
7 Correct 528 ms 3904 KB Output is correct
8 Correct 490 ms 3916 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 4 ms 3796 KB Output is correct
11 Correct 39 ms 3876 KB Output is correct
12 Correct 34 ms 3796 KB Output is correct
13 Correct 313 ms 3896 KB Output is correct
14 Correct 286 ms 3888 KB Output is correct
15 Correct 824 ms 3796 KB Output is correct
16 Correct 708 ms 3904 KB Output is correct
17 Correct 933 ms 3900 KB Output is correct
18 Correct 11 ms 3784 KB Output is correct
19 Correct 8 ms 3884 KB Output is correct
20 Correct 28 ms 3796 KB Output is correct
21 Correct 26 ms 3796 KB Output is correct
22 Correct 93 ms 3880 KB Output is correct
23 Correct 97 ms 3796 KB Output is correct
24 Correct 146 ms 3880 KB Output is correct
25 Correct 135 ms 3884 KB Output is correct
26 Correct 6 ms 3796 KB Output is correct
27 Correct 5 ms 3796 KB Output is correct
28 Correct 556 ms 3796 KB Output is correct
29 Correct 444 ms 3916 KB Output is correct
30 Correct 1700 ms 3988 KB Output is correct
31 Correct 1782 ms 3972 KB Output is correct
32 Correct 2058 ms 3972 KB Output is correct
33 Correct 1995 ms 3976 KB Output is correct
34 Correct 3 ms 3796 KB Output is correct
35 Correct 26 ms 3896 KB Output is correct
36 Correct 249 ms 3916 KB Output is correct
37 Correct 627 ms 3904 KB Output is correct
38 Correct 1765 ms 3924 KB Output is correct
39 Correct 1802 ms 3928 KB Output is correct
40 Correct 291 ms 3924 KB Output is correct
41 Correct 615 ms 3936 KB Output is correct
42 Correct 1014 ms 3956 KB Output is correct
43 Correct 1419 ms 3980 KB Output is correct
44 Correct 1485 ms 3992 KB Output is correct
45 Correct 1453 ms 4044 KB Output is correct
46 Correct 592 ms 3932 KB Output is correct
47 Correct 944 ms 3976 KB Output is correct
48 Correct 939 ms 3968 KB Output is correct