oj.uz

Submission #843094

# Submission time Handle Problem Language Result Execution time Memory
843094 2023-09-03T16:32:53 Z asdfgrace Cloud Computing (CEOI18_clo) C++17
100 / 100
 488 ms 1372 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  ios::sync_with_stdio(0); cin.tie(0);
  const int mx = 100005;
  int n;
  cin >> n;
  vector<array<int, 3>> a(n);
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < 3; ++j) {
      cin >> a[i][j];
    }
    a[i][2] = -a[i][2];
  }
  int m;
  cin >> m;
  a.resize(n + m);
  for (int i = 0; i < m; ++i) {
    for (int j = 0; j < 3; ++j) {
      cin >> a[i + n][j];
    }
    a[i + n][0] = -a[i + n][0];
  }
  sort(a.begin(), a.end(), [&] (array<int, 3> a1, array<int, 3> a2) {
    if (a1[1] != a2[1]) {
      return a1[1] > a2[1];
    } else {
      return a1[0] > a2[0];
    }
  });
  vector<long long> dp(mx, -1e18);
  dp[0] = 0;
  for (int i = 0; i < n + m; ++i) {
    if (a[i][0] > 0) {
      for (int j = mx - a[i][0] - 1; j >= 0; --j) {
        if (dp[j] == -1e18) continue;
        dp[j + a[i][0]] = max(dp[j + a[i][0]], dp[j] + a[i][2]);
      }
    } else {
      for (int j = -a[i][0]; j < mx; ++j) {
        if (dp[j] == -1e18) continue;
        dp[j + a[i][0]] = max(dp[j + a[i][0]], dp[j] + a[i][2]);
      }
    }
  }
  cout << *max_element(dp.begin(), dp.end()) << '\n';
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 14 ms 1116 KB Output is correct
5 Correct 125 ms 1116 KB Output is correct
6 Correct 120 ms 1116 KB Output is correct
7 Correct 129 ms 1368 KB Output is correct
8 Correct 130 ms 1112 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 7 ms 1216 KB Output is correct
4 Correct 7 ms 1112 KB Output is correct
5 Correct 72 ms 1116 KB Output is correct
6 Correct 63 ms 1116 KB Output is correct
7 Correct 172 ms 1112 KB Output is correct
8 Correct 136 ms 1116 KB Output is correct
9 Correct 202 ms 1116 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 12 ms 1116 KB Output is correct
4 Correct 13 ms 1116 KB Output is correct
5 Correct 27 ms 1116 KB Output is correct
6 Correct 24 ms 1116 KB Output is correct
7 Correct 32 ms 1116 KB Output is correct
8 Correct 33 ms 1116 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 4 ms 1116 KB Output is correct
3 Correct 97 ms 1112 KB Output is correct
4 Correct 127 ms 1116 KB Output is correct
5 Correct 366 ms 1372 KB Output is correct
6 Correct 480 ms 1116 KB Output is correct
7 Correct 488 ms 1116 KB Output is correct
8 Correct 468 ms 1116 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 11 ms 1116 KB Output is correct
3 Correct 61 ms 1116 KB Output is correct
4 Correct 135 ms 1116 KB Output is correct
5 Correct 396 ms 1116 KB Output is correct
6 Correct 486 ms 1112 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 14 ms 1116 KB Output is correct
5 Correct 125 ms 1116 KB Output is correct
6 Correct 120 ms 1116 KB Output is correct
7 Correct 129 ms 1368 KB Output is correct
8 Correct 130 ms 1112 KB Output is correct
9 Correct 2 ms 1112 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 7 ms 1216 KB Output is correct
12 Correct 7 ms 1112 KB Output is correct
13 Correct 72 ms 1116 KB Output is correct
14 Correct 63 ms 1116 KB Output is correct
15 Correct 172 ms 1112 KB Output is correct
16 Correct 136 ms 1116 KB Output is correct
17 Correct 202 ms 1116 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 2 ms 1116 KB Output is correct
20 Correct 12 ms 1116 KB Output is correct
21 Correct 13 ms 1116 KB Output is correct
22 Correct 27 ms 1116 KB Output is correct
23 Correct 24 ms 1116 KB Output is correct
24 Correct 32 ms 1116 KB Output is correct
25 Correct 33 ms 1116 KB Output is correct
26 Correct 2 ms 1116 KB Output is correct
27 Correct 4 ms 1116 KB Output is correct
28 Correct 97 ms 1112 KB Output is correct
29 Correct 127 ms 1116 KB Output is correct
30 Correct 366 ms 1372 KB Output is correct
31 Correct 480 ms 1116 KB Output is correct
32 Correct 488 ms 1116 KB Output is correct
33 Correct 468 ms 1116 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 11 ms 1116 KB Output is correct
36 Correct 61 ms 1116 KB Output is correct
37 Correct 135 ms 1116 KB Output is correct
38 Correct 396 ms 1116 KB Output is correct
39 Correct 486 ms 1112 KB Output is correct
40 Correct 76 ms 1116 KB Output is correct
41 Correct 151 ms 1112 KB Output is correct
42 Correct 192 ms 1116 KB Output is correct
43 Correct 298 ms 1116 KB Output is correct
44 Correct 289 ms 1372 KB Output is correct
45 Correct 297 ms 1372 KB Output is correct
46 Correct 136 ms 1116 KB Output is correct
47 Correct 191 ms 1280 KB Output is correct
48 Correct 196 ms 1112 KB Output is correct