답안 #1091096

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091096 2024-09-19T19:04:51 Z 4QT0R Cloud Computing (CEOI18_clo) C++17
100 / 100
285 ms 1616 KB
#include <bits/stdc++.h>
using namespace std;
#define ll long long

struct computer{
	ll f;
	ll c;
	ll v;
};

computer wej[4003];
ll dp[100003];
ll oo=1e18;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	ll n,m;
	cin >> n;
	for (ll i = 0; i<n; i++){
		cin >> wej[i].c >> wej[i].f >> wej[i].v;
		wej[i].v=-wej[i].v;
	}
	cin >> m;
	for (ll i = n; i<n+m; i++){
		cin >> wej[i].c >> wej[i].f >> wej[i].v;
		wej[i].c=-wej[i].c;
	}
	sort(wej,wej+n+m,[](computer a, computer b){return (a.f==b.f?a.c>b.c:a.f>b.f);});
	fill(dp,dp+100002,-oo);
	dp[0]=0;
	for (ll i = 0; i<n+m; i++){
		if (wej[i].c>0){
			for (ll j = 100000-wej[i].c; j>=0; j--){
				dp[j+wej[i].c]=max(dp[j+wej[i].c],dp[j]+wej[i].v);
			}
		}
		else{
			for (ll j = -wej[i].c; j<=100000; j++){
				dp[j+wej[i].c]=max(dp[j+wej[i].c],dp[j]+wej[i].v);
			}
		}
	}
	ll ans=0;
	for (ll i = 0; i<=100000; i++)ans=max(ans,dp[i]);
	cout << ans << '\n';
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1124 KB Output is correct
3 Correct 8 ms 1116 KB Output is correct
4 Correct 14 ms 1252 KB Output is correct
5 Correct 127 ms 1296 KB Output is correct
6 Correct 127 ms 1304 KB Output is correct
7 Correct 142 ms 1324 KB Output is correct
8 Correct 133 ms 1112 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1120 KB Output is correct
2 Correct 2 ms 1112 KB Output is correct
3 Correct 8 ms 1116 KB Output is correct
4 Correct 8 ms 1116 KB Output is correct
5 Correct 70 ms 1256 KB Output is correct
6 Correct 61 ms 1260 KB Output is correct
7 Correct 132 ms 1320 KB Output is correct
8 Correct 133 ms 1124 KB Output is correct
9 Correct 129 ms 1120 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1116 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 13 ms 1248 KB Output is correct
4 Correct 12 ms 1248 KB Output is correct
5 Correct 24 ms 1260 KB Output is correct
6 Correct 25 ms 1112 KB Output is correct
7 Correct 33 ms 1116 KB Output is correct
8 Correct 34 ms 1116 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 99 ms 1116 KB Output is correct
4 Correct 123 ms 1112 KB Output is correct
5 Correct 252 ms 1368 KB Output is correct
6 Correct 267 ms 1372 KB Output is correct
7 Correct 265 ms 1368 KB Output is correct
8 Correct 261 ms 1372 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 11 ms 1240 KB Output is correct
3 Correct 54 ms 1116 KB Output is correct
4 Correct 133 ms 1112 KB Output is correct
5 Correct 270 ms 1384 KB Output is correct
6 Correct 271 ms 1352 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1124 KB Output is correct
3 Correct 8 ms 1116 KB Output is correct
4 Correct 14 ms 1252 KB Output is correct
5 Correct 127 ms 1296 KB Output is correct
6 Correct 127 ms 1304 KB Output is correct
7 Correct 142 ms 1324 KB Output is correct
8 Correct 133 ms 1112 KB Output is correct
9 Correct 2 ms 1120 KB Output is correct
10 Correct 2 ms 1112 KB Output is correct
11 Correct 8 ms 1116 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 70 ms 1256 KB Output is correct
14 Correct 61 ms 1260 KB Output is correct
15 Correct 132 ms 1320 KB Output is correct
16 Correct 133 ms 1124 KB Output is correct
17 Correct 129 ms 1120 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 13 ms 1248 KB Output is correct
21 Correct 12 ms 1248 KB Output is correct
22 Correct 24 ms 1260 KB Output is correct
23 Correct 25 ms 1112 KB Output is correct
24 Correct 33 ms 1116 KB Output is correct
25 Correct 34 ms 1116 KB Output is correct
26 Correct 2 ms 1116 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 99 ms 1116 KB Output is correct
29 Correct 123 ms 1112 KB Output is correct
30 Correct 252 ms 1368 KB Output is correct
31 Correct 267 ms 1372 KB Output is correct
32 Correct 265 ms 1368 KB Output is correct
33 Correct 261 ms 1372 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 11 ms 1240 KB Output is correct
36 Correct 54 ms 1116 KB Output is correct
37 Correct 133 ms 1112 KB Output is correct
38 Correct 270 ms 1384 KB Output is correct
39 Correct 271 ms 1352 KB Output is correct
40 Correct 68 ms 1120 KB Output is correct
41 Correct 129 ms 1124 KB Output is correct
42 Correct 206 ms 1372 KB Output is correct
43 Correct 268 ms 1368 KB Output is correct
44 Correct 270 ms 1616 KB Output is correct
45 Correct 285 ms 1368 KB Output is correct
46 Correct 134 ms 1116 KB Output is correct
47 Correct 201 ms 1332 KB Output is correct
48 Correct 193 ms 1336 KB Output is correct