Submission #484837

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
484837	2021-11-05 15:18:52	Soumya1	Cloud Computing (CEOI18_clo)	C++17	100 / 100	799 ms	2116 KiB

clo

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 18 / 18
• Subtask 2: 18 / 18
• Subtask 3: 18 / 18
• Subtask 4: 18 / 18
• Subtask 5: 18 / 18
• Subtask 6: 10 / 10