oj.uz

Submission #448749

# Submission time Handle Problem Language Result Execution time Memory
448749 2021-08-01T11:28:33 Z CaoHuuKhuongDuy Cloud Computing (CEOI18_clo) C++14
100 / 100
 1022 ms 2036 KB 
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
#define int long long
const int N=2e5+9;
const int oo=1e17;
int f[2][N];
struct computer
{
	int c,f,val;
}a[N];
bool compa(computer a,computer b)
{
	if (a.f==b.f) return a.c>b.c;
	return a.f>b.f;
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	//freopen("test.inp","r",stdin);
	int n,m;
	cin>>n;
	int sum=0;
	for (int i=1;i<=n;i++)
	  {
	    cin>>a[i].c>>a[i].f>>a[i].val;
	    a[i].val=-a[i].val;
	    sum+=a[i].c;
	  }
	cin>>m;
	for (int i=n+1;i<=n+m;i++)
	  {
	    cin>>a[i].c>>a[i].f>>a[i].val;
	    a[i].c=-a[i].c;
	  }
	n+=m;
	sort(a+1,a+1+n,compa);
	for (int j=0;j<=sum+52;j++)
	 f[0][j]=-oo;
	f[0][0]=0;
	int res=0;
	for (int i=1;i<=n;i++)
	  {
	  	int now=i&1;
	  	int past=(i-1)&1;
	  	for (int j=0;j<=sum+52;j++)
	  	  f[now][j]=-oo;
	    for (int j=0;j<=sum;j++)
	      {
	        f[now][j]=f[past][j];
	        if (j-a[i].c>=0) f[now][j]=max(f[now][j],f[past][j-a[i].c]+a[i].val);
	        if (i==n) res=max(res,f[now][j]);
	      }
	  }  
	cout<<res;
	return 0;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 55 ms 716 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 253 ms 1172 KB Output is correct
8 Correct 53 ms 460 KB Output is correct
9 Correct 449 ms 1740 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 22 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 469 ms 1204 KB Output is correct
6 Correct 904 ms 1812 KB Output is correct
7 Correct 932 ms 1812 KB Output is correct
8 Correct 845 ms 1764 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 53 ms 728 KB Output is correct
4 Correct 11 ms 412 KB Output is correct
5 Correct 896 ms 1860 KB Output is correct
6 Correct 922 ms 1860 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 7 ms 392 KB Output is correct
8 Correct 5 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 55 ms 716 KB Output is correct
14 Correct 3 ms 332 KB Output is correct
15 Correct 253 ms 1172 KB Output is correct
16 Correct 53 ms 460 KB Output is correct
17 Correct 449 ms 1740 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 22 ms 332 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 469 ms 1204 KB Output is correct
31 Correct 904 ms 1812 KB Output is correct
32 Correct 932 ms 1812 KB Output is correct
33 Correct 845 ms 1764 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 53 ms 728 KB Output is correct
37 Correct 11 ms 412 KB Output is correct
38 Correct 896 ms 1860 KB Output is correct
39 Correct 922 ms 1860 KB Output is correct
40 Correct 73 ms 696 KB Output is correct
41 Correct 166 ms 888 KB Output is correct
42 Correct 13 ms 428 KB Output is correct
43 Correct 983 ms 1972 KB Output is correct
44 Correct 977 ms 2036 KB Output is correct
45 Correct 1022 ms 1996 KB Output is correct
46 Correct 8 ms 332 KB Output is correct
47 Correct 13 ms 468 KB Output is correct
48 Correct 13 ms 468 KB Output is correct