oj.uz

Submission #953007

# Submission time Handle Problem Language Result Execution time Memory
953007 2024-03-25T10:06:14 Z BF001 Cloud Computing (CEOI18_clo) C++17
72 / 100
 228 ms 1108 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define M 100005
#define N 40005
#define oo 1e18

struct ii{
	int typ, c, f, v;
	bool operator < (ii o){
		if (f == o.f) return typ == 1;
		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;
    }
	
  	ma = N - 1;
    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 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 4 ms 684 KB Output is correct
4 Correct 8 ms 604 KB Output is correct
5 Correct 68 ms 816 KB Output is correct
6 Correct 63 ms 604 KB Output is correct
7 Correct 82 ms 604 KB Output is correct
8 Correct 66 ms 856 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 4 ms 604 KB Output is correct
5 Correct 40 ms 604 KB Output is correct
6 Correct 31 ms 604 KB Output is correct
7 Correct 101 ms 600 KB Output is correct
8 Correct 70 ms 600 KB Output is correct
9 Correct 113 ms 816 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 6 ms 604 KB Output is correct
4 Correct 7 ms 600 KB Output is correct
5 Correct 12 ms 600 KB Output is correct
6 Correct 12 ms 604 KB Output is correct
7 Correct 17 ms 604 KB Output is correct
8 Correct 17 ms 604 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 52 ms 604 KB Output is correct
4 Correct 64 ms 816 KB Output is correct
5 Incorrect 224 ms 860 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 6 ms 720 KB Output is correct
3 Correct 34 ms 804 KB Output is correct
4 Correct 68 ms 604 KB Output is correct
5 Correct 220 ms 1108 KB Output is correct
6 Correct 228 ms 876 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 4 ms 684 KB Output is correct
4 Correct 8 ms 604 KB Output is correct
5 Correct 68 ms 816 KB Output is correct
6 Correct 63 ms 604 KB Output is correct
7 Correct 82 ms 604 KB Output is correct
8 Correct 66 ms 856 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 40 ms 604 KB Output is correct
14 Correct 31 ms 604 KB Output is correct
15 Correct 101 ms 600 KB Output is correct
16 Correct 70 ms 600 KB Output is correct
17 Correct 113 ms 816 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 6 ms 604 KB Output is correct
21 Correct 7 ms 600 KB Output is correct
22 Correct 12 ms 600 KB Output is correct
23 Correct 12 ms 604 KB Output is correct
24 Correct 17 ms 604 KB Output is correct
25 Correct 17 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 52 ms 604 KB Output is correct
29 Correct 64 ms 816 KB Output is correct
30 Incorrect 224 ms 860 KB Output isn't correct
31 Halted 0 ms 0 KB -