oj.uz

Submission #484837

# Submission time Handle Problem Language Result Execution time Memory
484837 2021-11-05T15:18:52 Z Soumya1 Cloud Computing (CEOI18_clo) C++17
100 / 100
 799 ms 2116 KB 
#include <bits/stdc++.h>
using namespace std;
void testCase() {
  int n, m;
  cin >> n;
  vector<tuple<int, int, int>> t;
  for (int i = 0; i < n; i++) {
    int c, f, v;
    cin >> c >> f >> v;
    t.push_back({f, c, -v});
  }
  cin >> m;
  for (int i = 0; i < m; i++) {
    int c, f, v;
    cin >> c >> f >> v;
    t.push_back({f, c, v});
  }
  sort(t.begin(), t.end(), [&](tuple<int, int, int> a, tuple<int, int, int> b) {
    if (get<0> (a) != get<0> (b)) return get<0> (a) > get<0> (b);
    return get<2> (a) < get<2> (b);
  });
  int s = n * 51;
  vector<long long> dp(s, -1e18);
  vector<long long> ndp;
  dp[0] = 0;
  for (auto [f, c, v] : t) {
    ndp = dp;
    if (v < 0) {
      for (int i = 0; i + c < s; i++) {
        if (dp[i] != -1e18) ndp[i + c] = max(ndp[i + c], dp[i] + v);
      }
    } else {
      for (int i = c; i < s; i++) {
        if (dp[i] != -1e18) ndp[i - c] = max(ndp[i - c], dp[i] + v);
      }
    }
    dp = ndp;
  }
  cout << *max_element(dp.begin(), dp.end()) << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  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 1 ms 308 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 4 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 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 69 ms 972 KB Output is correct
6 Correct 62 ms 1064 KB Output is correct
7 Correct 319 ms 1996 KB Output is correct
8 Correct 307 ms 1996 KB Output is correct
9 Correct 315 ms 1912 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 2 ms 332 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 6 ms 508 KB Output is correct
6 Correct 7 ms 460 KB Output is correct
7 Correct 10 ms 532 KB Output is correct
8 Correct 10 ms 536 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 1 ms 204 KB Output is correct
3 Correct 169 ms 1564 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 644 ms 2052 KB Output is correct
6 Correct 795 ms 2116 KB Output is correct
7 Correct 725 ms 2052 KB Output is correct
8 Correct 694 ms 1996 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 344 KB Output is correct
3 Correct 39 ms 796 KB Output is correct
4 Correct 120 ms 1020 KB Output is correct
5 Correct 656 ms 2040 KB Output is correct
6 Correct 799 ms 2116 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 1 ms 308 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 4 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 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 69 ms 972 KB Output is correct
14 Correct 62 ms 1064 KB Output is correct
15 Correct 319 ms 1996 KB Output is correct
16 Correct 307 ms 1996 KB Output is correct
17 Correct 315 ms 1912 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 1 ms 316 KB Output is correct
22 Correct 6 ms 508 KB Output is correct
23 Correct 7 ms 460 KB Output is correct
24 Correct 10 ms 532 KB Output is correct
25 Correct 10 ms 536 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 169 ms 1564 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 644 ms 2052 KB Output is correct
31 Correct 795 ms 2116 KB Output is correct
32 Correct 725 ms 2052 KB Output is correct
33 Correct 694 ms 1996 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 39 ms 796 KB Output is correct
37 Correct 120 ms 1020 KB Output is correct
38 Correct 656 ms 2040 KB Output is correct
39 Correct 799 ms 2116 KB Output is correct
40 Correct 43 ms 760 KB Output is correct
41 Correct 126 ms 1000 KB Output is correct
42 Correct 346 ms 1612 KB Output is correct
43 Correct 713 ms 1996 KB Output is correct
44 Correct 710 ms 2116 KB Output is correct
45 Correct 710 ms 2104 KB Output is correct
46 Correct 149 ms 1100 KB Output is correct
47 Correct 345 ms 1640 KB Output is correct
48 Correct 326 ms 1644 KB Output is correct