oj.uz

Submission #807996

# Submission time Handle Problem Language Result Execution time Memory
807996 2023-08-05T04:19:34 Z gun_gan Cloud Computing (CEOI18_clo) C++17
100 / 100
 1156 ms 3632 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX = 4005, C = 50;
int N, M;
vector<array<int,3>> a;

ll dp[2][MX * C];

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

      for(int i = 0; i < MX * C; i++) 
            dp[0][i] = dp[1][i] = -1e18;
      
      cin >> N;
      for(int i = 1; i <= N; i++) {
            int c, f, v;
            cin >> c >> f >> v;
            a.push_back({f, c, -v});
      }

      cin >> M;

      for(int i = 1; i <= M; i++) {
            int c, f, v;
            cin >> c >> f >> v;
            a.push_back({f, -c, v});
      }

      sort(a.rbegin(), a.rend());

      dp[0][0] = 0;
      for(int i = 0; i < N + M; i++) {
            auto [f, c, v] = a[i];
            int k = i & 1;
            for(int j = 0; j < MX * C; j++) {
                  dp[k ^ 1][j] = dp[k][j];
                  if(j - c >= 0 && j - c < MX * C)
                        dp[k ^ 1][j] = max(dp[k ^ 1][j], dp[k][j - c] + v);
            }
      }

      cout << *max_element(dp[(N + M) & 1], dp[(N + M) & 1] + C * MX) << '\n';
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 3 ms 3440 KB Output is correct
3 Correct 32 ms 3460 KB Output is correct
4 Correct 60 ms 3444 KB Output is correct
5 Correct 457 ms 3484 KB Output is correct
6 Correct 466 ms 3484 KB Output is correct
7 Correct 489 ms 3484 KB Output is correct
8 Correct 482 ms 3484 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3412 KB Output is correct
2 Correct 4 ms 3412 KB Output is correct
3 Correct 27 ms 3456 KB Output is correct
4 Correct 28 ms 3412 KB Output is correct
5 Correct 228 ms 3456 KB Output is correct
6 Correct 223 ms 3464 KB Output is correct
7 Correct 506 ms 3484 KB Output is correct
8 Correct 499 ms 3484 KB Output is correct
9 Correct 497 ms 3480 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 3412 KB Output is correct
2 Correct 9 ms 3456 KB Output is correct
3 Correct 46 ms 3444 KB Output is correct
4 Correct 45 ms 3448 KB Output is correct
5 Correct 94 ms 3412 KB Output is correct
6 Correct 90 ms 3448 KB Output is correct
7 Correct 136 ms 3444 KB Output is correct
8 Correct 122 ms 3444 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3412 KB Output is correct
2 Correct 5 ms 3412 KB Output is correct
3 Correct 383 ms 3480 KB Output is correct
4 Correct 483 ms 3488 KB Output is correct
5 Correct 958 ms 3540 KB Output is correct
6 Correct 1034 ms 3540 KB Output is correct
7 Correct 1037 ms 3540 KB Output is correct
8 Correct 1018 ms 3580 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3412 KB Output is correct
2 Correct 40 ms 3412 KB Output is correct
3 Correct 204 ms 3464 KB Output is correct
4 Correct 512 ms 3480 KB Output is correct
5 Correct 1046 ms 3540 KB Output is correct
6 Correct 1077 ms 3540 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 3 ms 3440 KB Output is correct
3 Correct 32 ms 3460 KB Output is correct
4 Correct 60 ms 3444 KB Output is correct
5 Correct 457 ms 3484 KB Output is correct
6 Correct 466 ms 3484 KB Output is correct
7 Correct 489 ms 3484 KB Output is correct
8 Correct 482 ms 3484 KB Output is correct
9 Correct 3 ms 3412 KB Output is correct
10 Correct 4 ms 3412 KB Output is correct
11 Correct 27 ms 3456 KB Output is correct
12 Correct 28 ms 3412 KB Output is correct
13 Correct 228 ms 3456 KB Output is correct
14 Correct 223 ms 3464 KB Output is correct
15 Correct 506 ms 3484 KB Output is correct
16 Correct 499 ms 3484 KB Output is correct
17 Correct 497 ms 3480 KB Output is correct
18 Correct 9 ms 3412 KB Output is correct
19 Correct 9 ms 3456 KB Output is correct
20 Correct 46 ms 3444 KB Output is correct
21 Correct 45 ms 3448 KB Output is correct
22 Correct 94 ms 3412 KB Output is correct
23 Correct 90 ms 3448 KB Output is correct
24 Correct 136 ms 3444 KB Output is correct
25 Correct 122 ms 3444 KB Output is correct
26 Correct 6 ms 3412 KB Output is correct
27 Correct 5 ms 3412 KB Output is correct
28 Correct 383 ms 3480 KB Output is correct
29 Correct 483 ms 3488 KB Output is correct
30 Correct 958 ms 3540 KB Output is correct
31 Correct 1034 ms 3540 KB Output is correct
32 Correct 1037 ms 3540 KB Output is correct
33 Correct 1018 ms 3580 KB Output is correct
34 Correct 3 ms 3412 KB Output is correct
35 Correct 40 ms 3412 KB Output is correct
36 Correct 204 ms 3464 KB Output is correct
37 Correct 512 ms 3480 KB Output is correct
38 Correct 1046 ms 3540 KB Output is correct
39 Correct 1077 ms 3540 KB Output is correct
40 Correct 319 ms 3480 KB Output is correct
41 Correct 519 ms 3508 KB Output is correct
42 Correct 751 ms 3564 KB Output is correct
43 Correct 1018 ms 3584 KB Output is correct
44 Correct 1030 ms 3540 KB Output is correct
45 Correct 1156 ms 3632 KB Output is correct
46 Correct 526 ms 3504 KB Output is correct
47 Correct 800 ms 3564 KB Output is correct
48 Correct 739 ms 3572 KB Output is correct