Submission #591190

# Submission time Handle Problem Language Result Execution time Memory
591190 2022-07-07T01:31:25 Z jackkkk Cloud Computing (CEOI18_clo) C++11
100 / 100
333 ms 1292 KB
// Cloud Computing
// https://oj.uz/problem/view/CEOI18_clo


#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <array>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <algorithm>
#include <stdlib.h>
#include <math.h>
#include <list>
#include <float.h>
#include <climits>
#include <iomanip>
#include <chrono>

using namespace std;
using namespace std::chrono;

void quit() {
  cout.flush();
  exit(0);
}
struct comp{
  int c; long long p, v;
};
const long long md = 1e9+7;
const long long mx = 100001;
long long dp[mx+1];
int main(void){
  //freopen("qwer.in", "r", stdin);
  //freopen("qwer.out", "w", stdout);
  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  int n, m;
  cin >> n;
  vector<comp> computers;
  comp tmp;
  for(int i = 0; i < n; i++){
    cin >> tmp.c >> tmp.p >> tmp.v;
    tmp.v *= -1;
    computers.push_back(tmp);    
  }
  cin >> m;
  for(int i = 0; i < m; i++){
    cin >> tmp.c >> tmp.p >> tmp.v;
    tmp.c *= -1;
    computers.push_back(tmp);    
  }
  sort(computers.begin(), computers.end(), [](comp a, comp b){
    return a.p > b.p || (a.p == b.p && a.c > b.c);
  });
  for(int i = 0; i <= mx; i++){
    dp[i]=-10000000000000000LL;
  }
  dp[0]=0;

  for(comp computer : computers){
    if(computer.c > 0){
      for(int nm_cores = mx; nm_cores >= computer.c; nm_cores--){
        int prev = nm_cores-computer.c;
        dp[nm_cores] = max(dp[nm_cores], dp[prev]+computer.v);
      }
    }
    else{
      for(int nm_cores = 0; nm_cores <= mx + computer.c; nm_cores++){
        int prev = nm_cores-computer.c;
        dp[nm_cores] = max(dp[nm_cores], dp[prev]+computer.v);
      }
    }
  }
  long long ans = 0;
  for(int i = 0; i <= mx; i++){
    ans = max(ans, dp[i]);
  }

  cout << ans << "\n";

  quit();
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 11 ms 1108 KB Output is correct
4 Correct 17 ms 1124 KB Output is correct
5 Correct 158 ms 1184 KB Output is correct
6 Correct 158 ms 1184 KB Output is correct
7 Correct 166 ms 1108 KB Output is correct
8 Correct 161 ms 1108 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 11 ms 1108 KB Output is correct
4 Correct 12 ms 1108 KB Output is correct
5 Correct 82 ms 1136 KB Output is correct
6 Correct 74 ms 1132 KB Output is correct
7 Correct 169 ms 1108 KB Output is correct
8 Correct 176 ms 1184 KB Output is correct
9 Correct 159 ms 1108 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 980 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 15 ms 1116 KB Output is correct
4 Correct 19 ms 1120 KB Output is correct
5 Correct 31 ms 1108 KB Output is correct
6 Correct 30 ms 1108 KB Output is correct
7 Correct 40 ms 1108 KB Output is correct
8 Correct 47 ms 1112 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 124 ms 1172 KB Output is correct
4 Correct 159 ms 1180 KB Output is correct
5 Correct 297 ms 1272 KB Output is correct
6 Correct 319 ms 1276 KB Output is correct
7 Correct 320 ms 1292 KB Output is correct
8 Correct 319 ms 1280 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 14 ms 1108 KB Output is correct
3 Correct 66 ms 1136 KB Output is correct
4 Correct 169 ms 1180 KB Output is correct
5 Correct 331 ms 1284 KB Output is correct
6 Correct 332 ms 1280 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 11 ms 1108 KB Output is correct
4 Correct 17 ms 1124 KB Output is correct
5 Correct 158 ms 1184 KB Output is correct
6 Correct 158 ms 1184 KB Output is correct
7 Correct 166 ms 1108 KB Output is correct
8 Correct 161 ms 1108 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 11 ms 1108 KB Output is correct
12 Correct 12 ms 1108 KB Output is correct
13 Correct 82 ms 1136 KB Output is correct
14 Correct 74 ms 1132 KB Output is correct
15 Correct 169 ms 1108 KB Output is correct
16 Correct 176 ms 1184 KB Output is correct
17 Correct 159 ms 1108 KB Output is correct
18 Correct 3 ms 980 KB Output is correct
19 Correct 3 ms 980 KB Output is correct
20 Correct 15 ms 1116 KB Output is correct
21 Correct 19 ms 1120 KB Output is correct
22 Correct 31 ms 1108 KB Output is correct
23 Correct 30 ms 1108 KB Output is correct
24 Correct 40 ms 1108 KB Output is correct
25 Correct 47 ms 1112 KB Output is correct
26 Correct 2 ms 980 KB Output is correct
27 Correct 2 ms 1108 KB Output is correct
28 Correct 124 ms 1172 KB Output is correct
29 Correct 159 ms 1180 KB Output is correct
30 Correct 297 ms 1272 KB Output is correct
31 Correct 319 ms 1276 KB Output is correct
32 Correct 320 ms 1292 KB Output is correct
33 Correct 319 ms 1280 KB Output is correct
34 Correct 1 ms 980 KB Output is correct
35 Correct 14 ms 1108 KB Output is correct
36 Correct 66 ms 1136 KB Output is correct
37 Correct 169 ms 1180 KB Output is correct
38 Correct 331 ms 1284 KB Output is correct
39 Correct 332 ms 1280 KB Output is correct
40 Correct 93 ms 1228 KB Output is correct
41 Correct 155 ms 1108 KB Output is correct
42 Correct 245 ms 1260 KB Output is correct
43 Correct 333 ms 1276 KB Output is correct
44 Correct 318 ms 1236 KB Output is correct
45 Correct 328 ms 1276 KB Output is correct
46 Correct 165 ms 1188 KB Output is correct
47 Correct 240 ms 1264 KB Output is correct
48 Correct 250 ms 1256 KB Output is correct