oj.uz

Submission #953018

# Submission time Handle Problem Language Result Execution time Memory
953018 2024-03-25T10:19:01 Z BF001 Cloud Computing (CEOI18_clo) C++17
100 / 100
 493 ms 1436 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define M 100005
#define N 40005
#define oo 1e16
//
struct ii{
	int typ, c, f, v;
	bool operator < (ii o){
		if (f == o.f) return typ < o.typ;
		return f > o.f;
	}
} a[N];

int n, m, ma, dp[M];

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
        
    cin >> n;
    for (int i = 1; i <= n; i++){
    	cin >> a[i].c >> a[i].f >> a[i].v;
    	a[i].typ = 1;
    	ma += a[i].c;
    }
    cin >> m;
    for (int i = n + 1; i <= n + m; i++){
    	cin >> a[i].c >> a[i].f >> a[i].v;
    	a[i].typ = 2;
    }

    n += m;
    for (int i = 0; i <= ma; i++) dp[i] = -oo;
    dp[0] = 0;

    sort(a + 1, a + n + 1);
    int res = 0;

    for (int i = 1; i <= n; i++){
    	if (a[i].typ == 1){
    		for (int j = ma; j >= 0; j--){
    			if (j  < a[i].c) break;
    			if (dp[j - a[i].c] == -oo) continue;
    			dp[j] = max(dp[j], dp[j - a[i].c] - a[i].v);
    			res = max(res, dp[j]);
    		}
    		continue;
    	}
    	for (int j = 0; j <= ma; j++){
    		if (j + a[i].c > ma) break;
    		if (dp[j + a[i].c] == -oo) continue;
    		dp[j] = max(dp[j], dp[j + a[i].c] + a[i].v);
    		res = max(res, dp[j]);
    	}
    }

    cout << res;

    return 0;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 25 ms 604 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 156 ms 852 KB Output is correct
8 Correct 21 ms 536 KB Output is correct
9 Correct 197 ms 1200 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 260 ms 820 KB Output is correct
6 Correct 487 ms 1316 KB Output is correct
7 Correct 493 ms 1328 KB Output is correct
8 Correct 464 ms 1288 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 30 ms 604 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 412 ms 1320 KB Output is correct
6 Correct 485 ms 1300 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 472 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 464 KB Output is correct
13 Correct 25 ms 604 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 156 ms 852 KB Output is correct
16 Correct 21 ms 536 KB Output is correct
17 Correct 197 ms 1200 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 260 ms 820 KB Output is correct
31 Correct 487 ms 1316 KB Output is correct
32 Correct 493 ms 1328 KB Output is correct
33 Correct 464 ms 1288 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 30 ms 604 KB Output is correct
37 Correct 6 ms 344 KB Output is correct
38 Correct 412 ms 1320 KB Output is correct
39 Correct 485 ms 1300 KB Output is correct
40 Correct 28 ms 604 KB Output is correct
41 Correct 76 ms 792 KB Output is correct
42 Correct 8 ms 856 KB Output is correct
43 Correct 365 ms 1396 KB Output is correct
44 Correct 343 ms 1404 KB Output is correct
45 Correct 372 ms 1436 KB Output is correct
46 Correct 3 ms 344 KB Output is correct
47 Correct 7 ms 600 KB Output is correct
48 Correct 6 ms 600 KB Output is correct