oj.uz

Submission #522071

# Submission time Handle Problem Language Result Execution time Memory
522071 2022-02-03T18:06:49 Z LucaDantas Cloud Computing (CEOI18_clo) C++17
100 / 100
 1057 ms 1960 KB 
#include <cstdio>
#include <algorithm>
#include <cstring>

constexpr int maxn = 2010;
constexpr int maxn2 = 100010;
constexpr long long inf = 0x3f3f3f3f3f3f3f3f;

struct Order { int c, f, v; bool operator<(Order o) const { if(f != o.f) return f < o.f; return c > o.c; } };

Order td[maxn<<1];

long long dp[2][maxn2];

void max_self(long long& a, long long b) { a = std::max(a, b); }

int main() {
	int n; scanf("%d", &n);
	for(int i = 0, c, f, v; i < n; i++)
		scanf("%d %d %d", &c, &f, &v), td[i] = {-c, f, -v};

	int m, sum = 0; scanf("%d", &m);
	for(int i = n, c, f, v; i < n+m; i++)
		scanf("%d %d %d", &c, &f, &v), td[i] = {c, f, v}, sum += c;

	std::sort(td, td+n+m);

	for(int i = 0; i < 2; i++)
		for(int j = 0; j < maxn2; j++)
			dp[i][j] = -inf;

	dp[0][0] = 0;

	for(int i = 0; i < n+m; i++) {
		for(int abertas = 0; abertas <= sum; abertas++)
			if(abertas + td[i].c <= sum)
				max_self(dp[i&1^1][std::max(0, abertas + td[i].c)], dp[i&1][abertas] + td[i].v),
				max_self(dp[i&1^1][abertas], dp[i&1][abertas]);

		/* for(int abertas = 0; abertas <= sum; abertas++)
			printf("%lld ", dp[i&1][abertas] <= -inf/2 ? -1 : dp[i&1][abertas]);
		puts(""); */
	}

	printf("%lld\n", dp[(n+m)&1][0]);
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:37:18: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   37 |     max_self(dp[i&1^1][std::max(0, abertas + td[i].c)], dp[i&1][abertas] + td[i].v),
      |                 ~^~
clo.cpp:38:18: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   38 |     max_self(dp[i&1^1][abertas], dp[i&1][abertas]);
      |                 ~^~
clo.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |  int n; scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
clo.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |   scanf("%d %d %d", &c, &f, &v), td[i] = {-c, f, -v};
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:22:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |  int m, sum = 0; scanf("%d", &m);
      |                  ~~~~~^~~~~~~~~~
clo.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   scanf("%d %d %d", &c, &f, &v), td[i] = {c, f, v}, sum += c;
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1740 KB Output is correct
2 Correct 2 ms 1740 KB Output is correct
3 Correct 1 ms 1740 KB Output is correct
4 Correct 2 ms 1740 KB Output is correct
5 Correct 238 ms 1740 KB Output is correct
6 Correct 75 ms 1740 KB Output is correct
7 Correct 457 ms 1868 KB Output is correct
8 Correct 458 ms 1740 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1740 KB Output is correct
2 Correct 1 ms 1740 KB Output is correct
3 Correct 1 ms 1740 KB Output is correct
4 Correct 1 ms 1740 KB Output is correct
5 Correct 2 ms 1788 KB Output is correct
6 Correct 2 ms 1740 KB Output is correct
7 Correct 5 ms 1868 KB Output is correct
8 Correct 4 ms 1740 KB Output is correct
9 Correct 5 ms 1860 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1740 KB Output is correct
2 Correct 1 ms 1860 KB Output is correct
3 Correct 3 ms 1804 KB Output is correct
4 Correct 42 ms 1828 KB Output is correct
5 Correct 410 ms 1924 KB Output is correct
6 Correct 882 ms 1908 KB Output is correct
7 Correct 872 ms 1912 KB Output is correct
8 Correct 864 ms 1904 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1740 KB Output is correct
2 Correct 3 ms 1740 KB Output is correct
3 Correct 3 ms 1740 KB Output is correct
4 Correct 16 ms 1740 KB Output is correct
5 Correct 884 ms 1864 KB Output is correct
6 Correct 941 ms 1868 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1740 KB Output is correct
2 Correct 2 ms 1740 KB Output is correct
3 Correct 1 ms 1740 KB Output is correct
4 Correct 2 ms 1740 KB Output is correct
5 Correct 238 ms 1740 KB Output is correct
6 Correct 75 ms 1740 KB Output is correct
7 Correct 457 ms 1868 KB Output is correct
8 Correct 458 ms 1740 KB Output is correct
9 Correct 1 ms 1740 KB Output is correct
10 Correct 1 ms 1740 KB Output is correct
11 Correct 1 ms 1740 KB Output is correct
12 Correct 1 ms 1740 KB Output is correct
13 Correct 2 ms 1788 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 5 ms 1868 KB Output is correct
16 Correct 4 ms 1740 KB Output is correct
17 Correct 5 ms 1860 KB Output is correct
18 Correct 1 ms 1740 KB Output is correct
19 Correct 1 ms 1740 KB Output is correct
20 Correct 1 ms 1740 KB Output is correct
21 Correct 1 ms 1740 KB Output is correct
22 Correct 2 ms 1740 KB Output is correct
23 Correct 1 ms 1740 KB Output is correct
24 Correct 2 ms 1740 KB Output is correct
25 Correct 1 ms 1740 KB Output is correct
26 Correct 1 ms 1740 KB Output is correct
27 Correct 1 ms 1860 KB Output is correct
28 Correct 3 ms 1804 KB Output is correct
29 Correct 42 ms 1828 KB Output is correct
30 Correct 410 ms 1924 KB Output is correct
31 Correct 882 ms 1908 KB Output is correct
32 Correct 872 ms 1912 KB Output is correct
33 Correct 864 ms 1904 KB Output is correct
34 Correct 1 ms 1740 KB Output is correct
35 Correct 3 ms 1740 KB Output is correct
36 Correct 3 ms 1740 KB Output is correct
37 Correct 16 ms 1740 KB Output is correct
38 Correct 884 ms 1864 KB Output is correct
39 Correct 941 ms 1868 KB Output is correct
40 Correct 58 ms 1816 KB Output is correct
41 Correct 243 ms 1872 KB Output is correct
42 Correct 14 ms 1816 KB Output is correct
43 Correct 1057 ms 1916 KB Output is correct
44 Correct 962 ms 1920 KB Output is correct
45 Correct 973 ms 1960 KB Output is correct
46 Correct 6 ms 1860 KB Output is correct
47 Correct 13 ms 1828 KB Output is correct
48 Correct 12 ms 1896 KB Output is correct