# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
915636 | 2024-01-24T12:17:12 Z | pan | Cloud Computing (CEOI18_clo) | C++17 | 647 ms | 2336 KB |
#include <bits/stdc++.h> //#include "bits_stdc++.h" #define mp make_pair #define pb push_back #define lb lower_bound #define ub upper_bound #define input(x) scanf("%lld", &x); #define print(x, y) printf("%lld%c", x, y); #define show(x) cerr << #x << " is " << x << endl; #define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl; #define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl; using namespace std; typedef long long ll; typedef long double ld; typedef pair<ld, ll> pd; typedef pair<string, ll> psl; typedef pair<ll, ll> pi; typedef pair<ll, pi> pii; ll n, m;; struct order { ll c, f, v; }; ll const INF = 1e15; bool compare(order a, order b) { if (a.f==b.f) return a.c>0; return a.f>b.f; } int main() { input(n); vector<order> orders(n); ll maxc = 0; for (ll i=0; i<n; ++i) {input(orders[i].c); input(orders[i].f); input(orders[i].v); orders[i].v=-orders[i].v; maxc += orders[i].c;} input(m); orders.resize(n+m); for (ll i=n; i<n+m; ++i) {input(orders[i].c); input(orders[i].f); input(orders[i].v); orders[i].c=-orders[i].c; } sort(orders.begin(), orders.end(), compare); //for (ll i=0; i<n+m; ++i){ cout << orders[i].c << endl;} ll size1 = maxc; vector<ll> prevv(maxc+5, -INF); prevv[0] = 0; ll ans = 0; for (ll i=0; i<n+m; ++i) { //show(i); vector<ll> dp(maxc+5, -INF); for (ll j=0; j<=size1; ++j) { dp[j] = prevv[j]; if (j-orders[i].c>=0 && j-orders[i].c<=size1 && prevv[j-orders[i].c]!=-INF) dp[j] = max(dp[j], prevv[j-orders[i].c] + orders[i].v); ans = max(ans, dp[j]); //show2(j, dp[j]); //show(j-orders[i].c); } swap(dp, prevv); } cout << ans << endl; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 2 ms | 484 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 4 ms | 492 KB | Output is correct |
8 | Correct | 4 ms | 600 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 35 ms | 860 KB | Output is correct |
6 | Correct | 2 ms | 348 KB | Output is correct |
7 | Correct | 181 ms | 1324 KB | Output is correct |
8 | Correct | 30 ms | 600 KB | Output is correct |
9 | Correct | 278 ms | 1884 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 1 ms | 344 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 15 ms | 576 KB | Output is correct |
4 | Correct | 2 ms | 344 KB | Output is correct |
5 | Correct | 332 ms | 1372 KB | Output is correct |
6 | Correct | 641 ms | 2236 KB | Output is correct |
7 | Correct | 621 ms | 2004 KB | Output is correct |
8 | Correct | 609 ms | 1972 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 36 ms | 860 KB | Output is correct |
4 | Correct | 8 ms | 344 KB | Output is correct |
5 | Correct | 605 ms | 1956 KB | Output is correct |
6 | Correct | 634 ms | 1956 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 2 ms | 484 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 4 ms | 492 KB | Output is correct |
8 | Correct | 4 ms | 600 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 1 ms | 348 KB | Output is correct |
13 | Correct | 35 ms | 860 KB | Output is correct |
14 | Correct | 2 ms | 348 KB | Output is correct |
15 | Correct | 181 ms | 1324 KB | Output is correct |
16 | Correct | 30 ms | 600 KB | Output is correct |
17 | Correct | 278 ms | 1884 KB | Output is correct |
18 | Correct | 1 ms | 344 KB | Output is correct |
19 | Correct | 0 ms | 348 KB | Output is correct |
20 | Correct | 0 ms | 348 KB | Output is correct |
21 | Correct | 0 ms | 348 KB | Output is correct |
22 | Correct | 1 ms | 344 KB | Output is correct |
23 | Correct | 1 ms | 344 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 | 348 KB | Output is correct |
27 | Correct | 0 ms | 348 KB | Output is correct |
28 | Correct | 15 ms | 576 KB | Output is correct |
29 | Correct | 2 ms | 344 KB | Output is correct |
30 | Correct | 332 ms | 1372 KB | Output is correct |
31 | Correct | 641 ms | 2236 KB | Output is correct |
32 | Correct | 621 ms | 2004 KB | Output is correct |
33 | Correct | 609 ms | 1972 KB | Output is correct |
34 | Correct | 0 ms | 344 KB | Output is correct |
35 | Correct | 1 ms | 344 KB | Output is correct |
36 | Correct | 36 ms | 860 KB | Output is correct |
37 | Correct | 8 ms | 344 KB | Output is correct |
38 | Correct | 605 ms | 1956 KB | Output is correct |
39 | Correct | 634 ms | 1956 KB | Output is correct |
40 | Correct | 41 ms | 756 KB | Output is correct |
41 | Correct | 113 ms | 1028 KB | Output is correct |
42 | Correct | 13 ms | 604 KB | Output is correct |
43 | Correct | 592 ms | 2140 KB | Output is correct |
44 | Correct | 544 ms | 2172 KB | Output is correct |
45 | Correct | 647 ms | 2336 KB | Output is correct |
46 | Correct | 5 ms | 344 KB | Output is correct |
47 | Correct | 9 ms | 344 KB | Output is correct |
48 | Correct | 9 ms | 348 KB | Output is correct |