oj.uz

Submission #493287

# Submission time Handle Problem Language Result Execution time Memory
493287 2021-12-10T19:04:09 Z Alex_tz307 Cloud Computing (CEOI18_clo) C++17
100 / 100
 1089 ms 1868 KB 
#include <bits/stdc++.h>

using namespace std;

const int kN = 4e3;
const int64_t INF = 1e18L;

struct transaction {
  int c, f, v;

  void read() {
    cin >> c >> f >> v;
  }

  bool operator < (const transaction &rhs) const {
    if (f != rhs.f) {
      return f > rhs.f;
    }
    return c > rhs.c;
  }
} a[kN];

void maxSelf(int64_t &x, int64_t y) {
  if (x < y) {
    x = y;
  }
}

void testCase() {
  int n;
  cin >> n;
  int N = 0;
  for (int i = 0; i < n; ++i) {
    a[i].read();
    a[i].v = -a[i].v;
    N += a[i].c;
  }
  int m;
  cin >> m;
  for (int i = n; i < n + m; ++i) {
    a[i].read();
    a[i].c = -a[i].c;
  }
  n += m;
  sort(a, a + n);
  vector<int64_t> dp(N + 1, -INF);
  dp[0] = 0;
  for (int i = 0; i < n; ++i) {
    vector<int64_t> newDp = dp;
    for (int j = 0; j <= N; ++j) {
      if (dp[j] != -INF) {
        int k = j + a[i].c;
        if (0 <= k && k <= N) {
          maxSelf(newDp[k], dp[j] + a[i].v);
        }
      }
    }
    dp = newDp;
  }
  cout << *max_element(dp.begin(), dp.end()) << '\n';
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 332 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 57 ms 656 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 215 ms 1100 KB Output is correct
8 Correct 38 ms 460 KB Output is correct
9 Correct 398 ms 1696 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 11 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 496 ms 1100 KB Output is correct
6 Correct 726 ms 1740 KB Output is correct
7 Correct 1089 ms 1740 KB Output is correct
8 Correct 1012 ms 1700 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 43 ms 716 KB Output is correct
4 Correct 10 ms 368 KB Output is correct
5 Correct 673 ms 1740 KB Output is correct
6 Correct 599 ms 1740 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 57 ms 656 KB Output is correct
14 Correct 3 ms 332 KB Output is correct
15 Correct 215 ms 1100 KB Output is correct
16 Correct 38 ms 460 KB Output is correct
17 Correct 398 ms 1696 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 11 ms 332 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 496 ms 1100 KB Output is correct
31 Correct 726 ms 1740 KB Output is correct
32 Correct 1089 ms 1740 KB Output is correct
33 Correct 1012 ms 1700 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 43 ms 716 KB Output is correct
37 Correct 10 ms 368 KB Output is correct
38 Correct 673 ms 1740 KB Output is correct
39 Correct 599 ms 1740 KB Output is correct
40 Correct 54 ms 664 KB Output is correct
41 Correct 137 ms 844 KB Output is correct
42 Correct 11 ms 332 KB Output is correct
43 Correct 616 ms 1868 KB Output is correct
44 Correct 581 ms 1868 KB Output is correct
45 Correct 619 ms 1868 KB Output is correct
46 Correct 5 ms 332 KB Output is correct
47 Correct 10 ms 376 KB Output is correct
48 Correct 10 ms 332 KB Output is correct