oj.uz

Submission #441679

# Submission time Handle Problem Language Result Execution time Memory
441679 2021-07-05T18:57:09 Z linkret Cloud Computing (CEOI18_clo) C++14
100 / 100
 787 ms 2048 KB 
#include <bits/stdc++.h>
using namespace std; long long int dp [2][2010*50];
struct rac {
	int f, ku, v;
};
vector < rac > k;
int cmp (rac a, rac b){
	if (a.f==b.f){
		if (a.ku>b.ku) return 1;
		return 0;
	}
	if (a.f>b.f) return 1;
	return 0;
}
int main(){
	int n,m; cin >> n;
	for (int i=0; i<n; i++) {
		int c,f,v; cin >> c >> f >> v; v=(-v);
		rac x; x.ku=c; x.f=f; x.v=v;
		k.push_back(x);
	}
	cin >> m;
	for (int i=0; i<m; i++) {
		int c,f,v; cin >> c >> f >> v; c=(-c);
		rac x; x.ku=c; x.f=f; x.v=v;
		k.push_back(x);
	}
	long long int sol=0;
	sort (k.begin(), k.end(), cmp);
	for (int j=1; j<2010*50; j++) dp[0][j]=-1e18;
	for (int i=0; i<k.size(); i++) {
		for (int j=0; j<2010*50; j++) {
			if (j<k[i].ku) dp[1][j]=dp[0][j];
			else if (j-k[i].ku>=2010*50) dp[1][j]=dp[0][j];
			else dp [1][j] = max (dp[0][j-k[i].ku]+k[i].v, dp[0][j]);
		}
		for (int j=0; j<2010*50; j++) dp[0][j]=dp[1][j];
	}
	for (int j=0; j<2010*50; j++) sol=max (sol, dp[0][j]);
	cout << sol;
	return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:31:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<rac>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  for (int i=0; i<k.size(); i++) {
      |                ~^~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1740 KB Output is correct
2 Correct 2 ms 1868 KB Output is correct
3 Correct 22 ms 1868 KB Output is correct
4 Correct 42 ms 1864 KB Output is correct
5 Correct 364 ms 1892 KB Output is correct
6 Correct 372 ms 1868 KB Output is correct
7 Correct 383 ms 1844 KB Output is correct
8 Correct 380 ms 1932 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1740 KB Output is correct
2 Correct 3 ms 1740 KB Output is correct
3 Correct 21 ms 1868 KB Output is correct
4 Correct 21 ms 1868 KB Output is correct
5 Correct 176 ms 1868 KB Output is correct
6 Correct 173 ms 1868 KB Output is correct
7 Correct 392 ms 1988 KB Output is correct
8 Correct 384 ms 1888 KB Output is correct
9 Correct 367 ms 1904 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1740 KB Output is correct
2 Correct 4 ms 1868 KB Output is correct
3 Correct 283 ms 1868 KB Output is correct
4 Correct 350 ms 1904 KB Output is correct
5 Correct 728 ms 1936 KB Output is correct
6 Correct 767 ms 1996 KB Output is correct
7 Correct 768 ms 1996 KB Output is correct
8 Correct 745 ms 1996 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1868 KB Output is correct
2 Correct 31 ms 1868 KB Output is correct
3 Correct 159 ms 1988 KB Output is correct
4 Correct 382 ms 1908 KB Output is correct
5 Correct 787 ms 1936 KB Output is correct
6 Correct 763 ms 1988 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1740 KB Output is correct
2 Correct 2 ms 1868 KB Output is correct
3 Correct 22 ms 1868 KB Output is correct
4 Correct 42 ms 1864 KB Output is correct
5 Correct 364 ms 1892 KB Output is correct
6 Correct 372 ms 1868 KB Output is correct
7 Correct 383 ms 1844 KB Output is correct
8 Correct 380 ms 1932 KB Output is correct
9 Correct 2 ms 1740 KB Output is correct
10 Correct 3 ms 1740 KB Output is correct
11 Correct 21 ms 1868 KB Output is correct
12 Correct 21 ms 1868 KB Output is correct
13 Correct 176 ms 1868 KB Output is correct
14 Correct 173 ms 1868 KB Output is correct
15 Correct 392 ms 1988 KB Output is correct
16 Correct 384 ms 1888 KB Output is correct
17 Correct 367 ms 1904 KB Output is correct
18 Correct 7 ms 1868 KB Output is correct
19 Correct 7 ms 1740 KB Output is correct
20 Correct 35 ms 1868 KB Output is correct
21 Correct 35 ms 1868 KB Output is correct
22 Correct 70 ms 1868 KB Output is correct
23 Correct 70 ms 1868 KB Output is correct
24 Correct 98 ms 1868 KB Output is correct
25 Correct 97 ms 1868 KB Output is correct
26 Correct 4 ms 1740 KB Output is correct
27 Correct 4 ms 1868 KB Output is correct
28 Correct 283 ms 1868 KB Output is correct
29 Correct 350 ms 1904 KB Output is correct
30 Correct 728 ms 1936 KB Output is correct
31 Correct 767 ms 1996 KB Output is correct
32 Correct 768 ms 1996 KB Output is correct
33 Correct 745 ms 1996 KB Output is correct
34 Correct 3 ms 1868 KB Output is correct
35 Correct 31 ms 1868 KB Output is correct
36 Correct 159 ms 1988 KB Output is correct
37 Correct 382 ms 1908 KB Output is correct
38 Correct 787 ms 1936 KB Output is correct
39 Correct 763 ms 1988 KB Output is correct
40 Correct 197 ms 1884 KB Output is correct
41 Correct 369 ms 1916 KB Output is correct
42 Correct 579 ms 1976 KB Output is correct
43 Correct 761 ms 1996 KB Output is correct
44 Correct 761 ms 1996 KB Output is correct
45 Correct 768 ms 2048 KB Output is correct
46 Correct 378 ms 1868 KB Output is correct
47 Correct 569 ms 1868 KB Output is correct
48 Correct 560 ms 1868 KB Output is correct