oj.uz

Submission #943514

# Submission time Handle Problem Language Result Execution time Memory
943514 2024-03-11T14:44:31 Z Muaath_5 Cloud Computing (CEOI18_clo) C++17
100 / 100
 366 ms 1372 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long int LL;

const LL INF = 1e15;

struct Event {
  int cores;
  int freq;
  int value;
  int id;

  Event(int cores_, int freq_, int value_, int id_):
    cores(cores_), freq(freq_), value(value_), id(id_) {}

  bool operator<(const Event& other) const {
    if (freq != other.freq) return freq > other.freq;
    return id < other.id;
  }
};

int n, m;
vector<Event> events;
vector<LL> DP;

int main() {
  int cores_available = 0;

  cin >> n;
  for (int i = 0; i < n; i++) {
    int cores, freq, price;
    cin >> cores >> freq >> price;
    cores_available += cores;
    events.push_back(Event(cores, freq, price, -1));
  }
  cin >> m;
  for (int i = 0; i < m; i++) {
    int cores, freq, reward;
    cin >> cores >> freq >> reward;
    events.push_back(Event(cores, freq, reward, i));
  }

  sort(events.begin(), events.end());

  DP.resize(cores_available + 1, -INF);
  DP[0] = 0;

  for (const Event& evt : events) {
    if (evt.id == -1) {
      for (int i = cores_available; i >= evt.cores; i--)
        DP[i] = max(DP[i], DP[i - evt.cores] - evt.value);
    }
    else {
      for (int i = 0; i <= cores_available - evt.cores; i++)
        DP[i] = max(DP[i], DP[i + evt.cores] + evt.value);
    }
  }

  LL result = -1;
  for (int i = 0; i <= cores_available; i++)
    result = max(result, DP[i]);

  cout << result << "\n";

  return 0;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 17 ms 604 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 79 ms 860 KB Output is correct
8 Correct 16 ms 604 KB Output is correct
9 Correct 142 ms 1116 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 144 ms 856 KB Output is correct
6 Correct 266 ms 1112 KB Output is correct
7 Correct 265 ms 1112 KB Output is correct
8 Correct 255 ms 1116 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Correct 16 ms 604 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 260 ms 1312 KB Output is correct
6 Correct 267 ms 1116 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 3 ms 444 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 17 ms 604 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 79 ms 860 KB Output is correct
16 Correct 16 ms 604 KB Output is correct
17 Correct 142 ms 1116 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 2 ms 600 KB Output is correct
30 Correct 144 ms 856 KB Output is correct
31 Correct 266 ms 1112 KB Output is correct
32 Correct 265 ms 1112 KB Output is correct
33 Correct 255 ms 1116 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 432 KB Output is correct
36 Correct 16 ms 604 KB Output is correct
37 Correct 4 ms 348 KB Output is correct
38 Correct 260 ms 1312 KB Output is correct
39 Correct 267 ms 1116 KB Output is correct
40 Correct 19 ms 600 KB Output is correct
41 Correct 55 ms 604 KB Output is correct
42 Correct 5 ms 348 KB Output is correct
43 Correct 366 ms 1304 KB Output is correct
44 Correct 298 ms 1368 KB Output is correct
45 Correct 301 ms 1372 KB Output is correct
46 Correct 3 ms 344 KB Output is correct
47 Correct 6 ms 348 KB Output is correct
48 Correct 5 ms 348 KB Output is correct