oj.uz

Submission #552501

# Submission time Handle Problem Language Result Execution time Memory
552501 2022-04-23T08:46:59 Z MilosMilutinovic Cloud Computing (CEOI18_clo) C++14
100 / 100
 621 ms 2040 KB 
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i ++)
#define MP make_pair

using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const LL INF = 1000000000000000000LL;

int n, m, c[2005], f[2005], v[2005], C[2005], F[2005], V[2005];
LL dp[2][200005];
pair<PII, int> ord[4005];
int main()
{
	scanf("%d", &n);
	rep(i, n) {
		scanf("%d%d%d", &c[i], &f[i], &v[i]);
		ord[i] = MP(MP(-f[i], 0), i);
	}
	scanf("%d", &m);
	rep(i, m) {
		scanf("%d%d%d", &C[i], &F[i], &V[i]);
		ord[i + n] = MP(MP(-F[i], 1), i);
	}
	sort(ord, ord + n + m);
	rep(i, 2) rep(j, n * 51) dp[i][j] = -INF;
	dp[1][0] = 0;
	rep(i, n + m) {
		int ii = ((i & 1) ^ 1);
		int id = ord[i].second;
		rep(j, n * 51) dp[i & 1][j] = dp[ii][j];
		if(ord[i].first.second == 0) {
			for(int j = n * 51 - 1; j >= c[id]; j--) {
				dp[i & 1][j] = max(dp[i & 1][j], dp[ii][j - c[id]] - v[id]);
			}
		} else {
			for(int j = n * 51 - 1; j >= C[id]; j--) {
				dp[i & 1][j - C[id]] = max(dp[i & 1][j - C[id]], dp[ii][j] + V[id]);
			}
		}
	}
	LL ans = 0;
	rep(i, 2) rep(j, n * 51) ans = max(ans, dp[i][j]);
	printf("%lld\n", ans);
	return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
clo.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |   scanf("%d%d%d", &c[i], &f[i], &v[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |  scanf("%d", &m);
      |  ~~~~~^~~~~~~~~~
clo.cpp:23:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |   scanf("%d%d%d", &C[i], &F[i], &V[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 65 ms 980 KB Output is correct
6 Correct 63 ms 1076 KB Output is correct
7 Correct 303 ms 2000 KB Output is correct
8 Correct 308 ms 2004 KB Output is correct
9 Correct 288 ms 1916 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 7 ms 468 KB Output is correct
6 Correct 7 ms 468 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 12 ms 536 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 176 ms 1544 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 573 ms 2032 KB Output is correct
6 Correct 620 ms 2024 KB Output is correct
7 Correct 610 ms 2024 KB Output is correct
8 Correct 571 ms 1972 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 35 ms 724 KB Output is correct
4 Correct 118 ms 1100 KB Output is correct
5 Correct 577 ms 2012 KB Output is correct
6 Correct 621 ms 1976 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 65 ms 980 KB Output is correct
14 Correct 63 ms 1076 KB Output is correct
15 Correct 303 ms 2000 KB Output is correct
16 Correct 308 ms 2004 KB Output is correct
17 Correct 288 ms 1916 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 7 ms 468 KB Output is correct
23 Correct 7 ms 468 KB Output is correct
24 Correct 10 ms 468 KB Output is correct
25 Correct 12 ms 536 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 176 ms 1544 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 573 ms 2032 KB Output is correct
31 Correct 620 ms 2024 KB Output is correct
32 Correct 610 ms 2024 KB Output is correct
33 Correct 571 ms 1972 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 35 ms 724 KB Output is correct
37 Correct 118 ms 1100 KB Output is correct
38 Correct 577 ms 2012 KB Output is correct
39 Correct 621 ms 1976 KB Output is correct
40 Correct 38 ms 724 KB Output is correct
41 Correct 110 ms 980 KB Output is correct
42 Correct 351 ms 1708 KB Output is correct
43 Correct 609 ms 2036 KB Output is correct
44 Correct 590 ms 2040 KB Output is correct
45 Correct 582 ms 2004 KB Output is correct
46 Correct 146 ms 1108 KB Output is correct
47 Correct 343 ms 1624 KB Output is correct
48 Correct 330 ms 1620 KB Output is correct