oj.uz

Submission #242960

# Submission time Handle Problem Language Result Execution time Memory
242960 2020-06-30T02:42:43 Z Lawliet Cloud Computing (CEOI18_clo) C++17
100 / 100
 648 ms 2168 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long int lli;

const int MAXS = 2000*50 + 10;

struct event
{
	int type, cmp;
	int qtd, price;

	event(int t, int q, int p, int c)
		: type(t), qtd(q), price(p), cmp(c) {}

	bool operator < (event a)
	{
		if( cmp != a.cmp ) return cmp < a.cmp;
		return type > a.type;
	}
};

int n, m;

lli dp[2][MAXS];

vector<event> v;

int main()
{
	scanf("%d",&n);

	int sum = 0;

	for(int i = 1 ; i <= n ; i++)
	{
		int q, c, p;
		scanf("%d %d %d",&q,&c,&p);

		sum += q;

		v.push_back( event( 0 , q , p , c ) );
	}

	scanf("%d",&m);

	for(int i = 1 ; i <= m ; i++)
	{
		int q, c, p;
		scanf("%d %d %d",&q,&c,&p);

		v.push_back( event( 1 , q , p , c ) );
	}

	sort( v.begin() , v.end() );

	for(int i = 1 ; i <= n + m ; i++)
	{
		int qtd = v[i - 1].qtd;
		int type = v[i - 1].type;
		int price = v[i - 1].price;

		for(int j = 0 ; j <= sum ; j++)
		{
			lli& ans = dp[i%2][j];
			ans = dp[1 - i%2][j];

			if( type == 0 ) ans = max( ans , dp[1 - i%2][j + qtd] - price );
			else if( j >= qtd ) ans = max( ans , dp[1 - i%2][j - qtd] + price );
		}
	}

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

Compilation message

clo.cpp: In constructor 'event::event(int, int, int, int)':
clo.cpp:11:11: warning: 'event::price' will be initialized after [-Wreorder]
  int qtd, price;
           ^~~~~
clo.cpp:10:12: warning:   'int event::cmp' [-Wreorder]
  int type, cmp;
            ^~~
clo.cpp:13:2: warning:   when initialized here [-Wreorder]
  event(int t, int q, int p, int c)
  ^~~~~
clo.cpp: In function 'int main()':
clo.cpp:31:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
clo.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&q,&c,&p);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~
clo.cpp:45:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&m);
  ~~~~~^~~~~~~~~
clo.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&q,&c,&p);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 38 ms 768 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 167 ms 1152 KB Output is correct
8 Correct 35 ms 512 KB Output is correct
9 Correct 260 ms 1792 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 16 ms 512 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 322 ms 1400 KB Output is correct
6 Correct 589 ms 1952 KB Output is correct
7 Correct 584 ms 2040 KB Output is correct
8 Correct 552 ms 2040 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 38 ms 888 KB Output is correct
4 Correct 12 ms 384 KB Output is correct
5 Correct 556 ms 1912 KB Output is correct
6 Correct 573 ms 1912 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 38 ms 768 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 167 ms 1152 KB Output is correct
16 Correct 35 ms 512 KB Output is correct
17 Correct 260 ms 1792 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 4 ms 256 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 416 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 16 ms 512 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 322 ms 1400 KB Output is correct
31 Correct 589 ms 1952 KB Output is correct
32 Correct 584 ms 2040 KB Output is correct
33 Correct 552 ms 2040 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 38 ms 888 KB Output is correct
37 Correct 12 ms 384 KB Output is correct
38 Correct 556 ms 1912 KB Output is correct
39 Correct 573 ms 1912 KB Output is correct
40 Correct 42 ms 768 KB Output is correct
41 Correct 108 ms 896 KB Output is correct
42 Correct 14 ms 512 KB Output is correct
43 Correct 627 ms 2168 KB Output is correct
44 Correct 642 ms 2048 KB Output is correct
45 Correct 648 ms 2144 KB Output is correct
46 Correct 8 ms 384 KB Output is correct
47 Correct 13 ms 512 KB Output is correct
48 Correct 13 ms 512 KB Output is correct