oj.uz

Submission #148091

# Submission time Handle Problem Language Result Execution time Memory
148091 2019-08-31T13:47:45 Z WhipppedCream Cloud Computing (CEOI18_clo) C++17
100 / 100
 396 ms 1400 KB 
#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;

const int lim = 1e5+5;

ll dp[lim];

struct node
{
	int c, v, f, t;
	node(int _c, int _v, int _f, int _t)
	{
		c = _c; v = _v; f = _f; t = _t;
	}
	bool operator < (node other) const
	{
		if(f != other.f) return f> other.f;
		return t< other.t;
	}
};

vector<node> items;
int n, m;

int main()
{
	scanf("%d", &n);
	for(int i = 1; i<= n; i++)
	{
		int c, v, f; scanf("%d %d %d", &c, &f, &v);
		items.pb(node(c, v, f, -1));
	}
	scanf("%d", &m);
	for(int i = 1; i<= m; i++)
	{
		int c, v, f; scanf("%d %d %d", &c, &f, &v);
		items.pb(node(c, v, f, 1));
	}
	sort(items.begin(), items.end());
	for(int i = 1; i<= 1e5; i++) dp[i] = -1e15;
	dp[0] = 0;
	for(auto pong : items)
	{
		int w = -pong.c*pong.t;
		int v = pong.v*pong.t;
		//printf("%d %d\n", w, v);
		if(w> 0)
		{
			//buy
			for(int i = 1e5; i>= w; i--)
			{
				dp[i] = max(dp[i], v+dp[i-w]);
			}
		}
		else
		{
			//sell
			for(int i = 0; i<= ((int)1e5+w); i++)
			{
				dp[i] = max(dp[i], v+dp[i-w]);
			}
		}
		//printf("dp[1] = %lld\n", dp[1]);
	}
	ll best = 0;
	for(int i = 0; i<= 1e5; i++) best = max(best, dp[i]);
	printf("%lld\n", best);
	//for(int i = 0; i<= 1e5; i++) if(dp[i] == best) printf("%d\n", i);
	return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
clo.cpp:35:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int c, v, f; scanf("%d %d %d", &c, &f, &v);
                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:38:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &m);
  ~~~~~^~~~~~~~~~
clo.cpp:41:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int c, v, f; scanf("%d %d %d", &c, &f, &v);
                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1272 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 14 ms 1144 KB Output is correct
4 Correct 23 ms 1020 KB Output is correct
5 Correct 189 ms 1372 KB Output is correct
6 Correct 191 ms 1272 KB Output is correct
7 Correct 200 ms 1400 KB Output is correct
8 Correct 198 ms 1272 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 4 ms 1064 KB Output is correct
3 Correct 13 ms 1156 KB Output is correct
4 Correct 13 ms 1144 KB Output is correct
5 Correct 92 ms 1144 KB Output is correct
6 Correct 92 ms 1144 KB Output is correct
7 Correct 199 ms 1144 KB Output is correct
8 Correct 199 ms 1272 KB Output is correct
9 Correct 192 ms 1144 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1020 KB Output is correct
2 Correct 6 ms 1144 KB Output is correct
3 Correct 20 ms 1144 KB Output is correct
4 Correct 20 ms 1144 KB Output is correct
5 Correct 38 ms 1144 KB Output is correct
6 Correct 38 ms 1144 KB Output is correct
7 Correct 51 ms 1144 KB Output is correct
8 Correct 52 ms 1144 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1144 KB Output is correct
2 Correct 4 ms 1144 KB Output is correct
3 Correct 149 ms 1208 KB Output is correct
4 Correct 179 ms 1272 KB Output is correct
5 Correct 368 ms 1324 KB Output is correct
6 Correct 391 ms 1344 KB Output is correct
7 Correct 389 ms 1312 KB Output is correct
8 Correct 387 ms 1400 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1144 KB Output is correct
2 Correct 18 ms 1144 KB Output is correct
3 Correct 82 ms 1144 KB Output is correct
4 Correct 199 ms 1220 KB Output is correct
5 Correct 388 ms 1328 KB Output is correct
6 Correct 396 ms 1400 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1272 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 14 ms 1144 KB Output is correct
4 Correct 23 ms 1020 KB Output is correct
5 Correct 189 ms 1372 KB Output is correct
6 Correct 191 ms 1272 KB Output is correct
7 Correct 200 ms 1400 KB Output is correct
8 Correct 198 ms 1272 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 4 ms 1064 KB Output is correct
11 Correct 13 ms 1156 KB Output is correct
12 Correct 13 ms 1144 KB Output is correct
13 Correct 92 ms 1144 KB Output is correct
14 Correct 92 ms 1144 KB Output is correct
15 Correct 199 ms 1144 KB Output is correct
16 Correct 199 ms 1272 KB Output is correct
17 Correct 192 ms 1144 KB Output is correct
18 Correct 6 ms 1020 KB Output is correct
19 Correct 6 ms 1144 KB Output is correct
20 Correct 20 ms 1144 KB Output is correct
21 Correct 20 ms 1144 KB Output is correct
22 Correct 38 ms 1144 KB Output is correct
23 Correct 38 ms 1144 KB Output is correct
24 Correct 51 ms 1144 KB Output is correct
25 Correct 52 ms 1144 KB Output is correct
26 Correct 4 ms 1144 KB Output is correct
27 Correct 4 ms 1144 KB Output is correct
28 Correct 149 ms 1208 KB Output is correct
29 Correct 179 ms 1272 KB Output is correct
30 Correct 368 ms 1324 KB Output is correct
31 Correct 391 ms 1344 KB Output is correct
32 Correct 389 ms 1312 KB Output is correct
33 Correct 387 ms 1400 KB Output is correct
34 Correct 4 ms 1144 KB Output is correct
35 Correct 18 ms 1144 KB Output is correct
36 Correct 82 ms 1144 KB Output is correct
37 Correct 199 ms 1220 KB Output is correct
38 Correct 388 ms 1328 KB Output is correct
39 Correct 396 ms 1400 KB Output is correct
40 Correct 103 ms 1188 KB Output is correct
41 Correct 193 ms 1272 KB Output is correct
42 Correct 298 ms 1352 KB Output is correct
43 Correct 391 ms 1272 KB Output is correct
44 Correct 392 ms 1400 KB Output is correct
45 Correct 390 ms 1400 KB Output is correct
46 Correct 196 ms 1228 KB Output is correct
47 Correct 295 ms 1300 KB Output is correct
48 Correct 287 ms 1296 KB Output is correct