oj.uz

Submission #1006895

# Submission time Handle Problem Language Result Execution time Memory
1006895 2024-06-24T09:38:22 Z makanhulia Cloud Computing (CEOI18_clo) C++17
100 / 100
 257 ms 1532 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m, inf = 1e15;
priority_queue<pair<pair<int, int>, pair<int, int>>> pq;
int dp[200005];
int c, f, v, a, ran = 0;
signed main() {
  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  for(int i = 1; i <= 100000; i++) {
    dp[i] = inf;
  }
  cin >> n;
  for(int i = 0; i < n; i++) {
    cin >> c >> f >> v;
    pq.push({{f, 2}, {c, v}});
  }
  cin >> m;
  for(int i = 0; i < m; i++) {
    cin >> c >> f >> v;
    pq.push({{f, 1}, {c, v}});
  }
  
  while(!pq.empty()) {
    c = pq.top().second.first;
    v = pq.top().second.second;
    a = pq.top().first.second;
    pq.pop();
    if(a == 2) {
      for(int i = 100000; i >= 0; i--) {
        dp[i + c] = min(dp[i + c], dp[i] + v);
      }
      
      ran += c;
    } else {
      for(int i = c; i <= 100000; i++) {
        dp[i - c] = min(dp[i - c], dp[i] - v);
      }
    }
  }
  int mini = 0;
  for(int i = 0; i <= 100000; i++) {
    mini = min(dp[i], mini);
  }
  mini *= -1;
  cout << mini << "\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 13 ms 1260 KB Output is correct
5 Correct 115 ms 1372 KB Output is correct
6 Correct 112 ms 1348 KB Output is correct
7 Correct 123 ms 1112 KB Output is correct
8 Correct 122 ms 1112 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 7 ms 1196 KB Output is correct
4 Correct 7 ms 1112 KB Output is correct
5 Correct 56 ms 1116 KB Output is correct
6 Correct 54 ms 1116 KB Output is correct
7 Correct 119 ms 1112 KB Output is correct
8 Correct 122 ms 1112 KB Output is correct
9 Correct 119 ms 1372 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1112 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 13 ms 1260 KB Output is correct
4 Correct 11 ms 1116 KB Output is correct
5 Correct 22 ms 1116 KB Output is correct
6 Correct 22 ms 1112 KB Output is correct
7 Correct 30 ms 1112 KB Output is correct
8 Correct 30 ms 1112 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1112 KB Output is correct
2 Correct 2 ms 1112 KB Output is correct
3 Correct 89 ms 1116 KB Output is correct
4 Correct 109 ms 1368 KB Output is correct
5 Correct 209 ms 1368 KB Output is correct
6 Correct 257 ms 1532 KB Output is correct
7 Correct 240 ms 1372 KB Output is correct
8 Correct 237 ms 1368 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 10 ms 1256 KB Output is correct
3 Correct 49 ms 1304 KB Output is correct
4 Correct 114 ms 1348 KB Output is correct
5 Correct 250 ms 1472 KB Output is correct
6 Correct 254 ms 1480 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 13 ms 1260 KB Output is correct
5 Correct 115 ms 1372 KB Output is correct
6 Correct 112 ms 1348 KB Output is correct
7 Correct 123 ms 1112 KB Output is correct
8 Correct 122 ms 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 7 ms 1196 KB Output is correct
12 Correct 7 ms 1112 KB Output is correct
13 Correct 56 ms 1116 KB Output is correct
14 Correct 54 ms 1116 KB Output is correct
15 Correct 119 ms 1112 KB Output is correct
16 Correct 122 ms 1112 KB Output is correct
17 Correct 119 ms 1372 KB Output is correct
18 Correct 3 ms 1112 KB Output is correct
19 Correct 2 ms 1116 KB Output is correct
20 Correct 13 ms 1260 KB Output is correct
21 Correct 11 ms 1116 KB Output is correct
22 Correct 22 ms 1116 KB Output is correct
23 Correct 22 ms 1112 KB Output is correct
24 Correct 30 ms 1112 KB Output is correct
25 Correct 30 ms 1112 KB Output is correct
26 Correct 2 ms 1112 KB Output is correct
27 Correct 2 ms 1112 KB Output is correct
28 Correct 89 ms 1116 KB Output is correct
29 Correct 109 ms 1368 KB Output is correct
30 Correct 209 ms 1368 KB Output is correct
31 Correct 257 ms 1532 KB Output is correct
32 Correct 240 ms 1372 KB Output is correct
33 Correct 237 ms 1368 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 10 ms 1256 KB Output is correct
36 Correct 49 ms 1304 KB Output is correct
37 Correct 114 ms 1348 KB Output is correct
38 Correct 250 ms 1472 KB Output is correct
39 Correct 254 ms 1480 KB Output is correct
40 Correct 62 ms 1112 KB Output is correct
41 Correct 118 ms 1372 KB Output is correct
42 Correct 177 ms 1488 KB Output is correct
43 Correct 243 ms 1372 KB Output is correct
44 Correct 241 ms 1372 KB Output is correct
45 Correct 241 ms 1372 KB Output is correct
46 Correct 128 ms 1376 KB Output is correct
47 Correct 168 ms 1368 KB Output is correct
48 Correct 172 ms 1488 KB Output is correct