oj.uz

Submission #240405

# Submission time Handle Problem Language Result Execution time Memory
240405 2020-06-19T15:04:49 Z m3r8 Cloud Computing (CEOI18_clo) C++14
100 / 100
 700 ms 1536 KB 
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>

#define ll long long
#define INF 10e12
#define MINF -INF
#define N (2010 * 55)

struct lli{
  int cores;
  ll freq;
  ll price;
};

int comp(lli a, lli b){
  return a.freq > b.freq;
};


ll dp[N];
std::vector<lli> ord;
std::vector<lli> com;

int main(void){
  int n,m;
  scanf("%d",&n);
  int c,f,v;
  for(int i = 0;i<n;i++){
    scanf("%d %d %d",&c,&f,&v);
    com.push_back({c,f,v});
  };
  scanf("%d",&m);
  for(int i = 0;i<m;i++){
    scanf("%d %d %d",&c,&f,&v);
    ord.push_back({c,f,v});
  };
  std::sort(com.begin(),com.end(),comp);
  std::sort(ord.begin(),ord.end(),comp);
  for(int i = 1;i<N;i++){
    dp[i] = MINF;  
  };

  ll mx = 0;
  int il = 0;
  int ir = 0;
  while(ir < ord.size()){
    if(il < com.size() && com[il].freq >= ord[ir].freq){
      c = com[il].cores;
      for(int i = N-1;i>=0;i--){
        if(dp[i] != MINF){
          dp[i+c] = std::max(dp[i+c],dp[i] - com[il].price);
          mx = std::max(mx,dp[i+c]);
        };
      };  
      il++;
    }else{
      c = ord[ir].cores;
      for(int i = c;i<N;i++){
        if(dp[i] != MINF){
          dp[i-c] = std::max(dp[i-c],dp[i] + ord[ir].price);
          mx = std::max(mx,dp[i-c]);
        };  
      };
      ir++;
    };
  };
  printf("%lld\n",mx);
  return 0;
};

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:49:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(ir < ord.size()){
         ~~~^~~~~~~~~~~~
clo.cpp:50:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(il < com.size() && com[il].freq >= ord[ir].freq){
        ~~~^~~~~~~~~~~~
clo.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
   ~~~~~^~~~~~~~~
clo.cpp:32:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d",&c,&f,&v);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~
clo.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&m);
   ~~~~~^~~~~~~~~
clo.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d",&c,&f,&v);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 15 ms 1152 KB Output is correct
4 Correct 26 ms 1152 KB Output is correct
5 Correct 195 ms 1280 KB Output is correct
6 Correct 197 ms 1280 KB Output is correct
7 Correct 202 ms 1400 KB Output is correct
8 Correct 190 ms 1280 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 6 ms 1152 KB Output is correct
3 Correct 15 ms 1152 KB Output is correct
4 Correct 15 ms 1152 KB Output is correct
5 Correct 100 ms 1280 KB Output is correct
6 Correct 90 ms 1280 KB Output is correct
7 Correct 233 ms 1280 KB Output is correct
8 Correct 233 ms 1280 KB Output is correct
9 Correct 312 ms 1320 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1152 KB Output is correct
2 Correct 8 ms 1152 KB Output is correct
3 Correct 19 ms 1152 KB Output is correct
4 Correct 16 ms 1152 KB Output is correct
5 Correct 43 ms 1280 KB Output is correct
6 Correct 39 ms 1152 KB Output is correct
7 Correct 62 ms 1152 KB Output is correct
8 Correct 52 ms 1152 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1152 KB Output is correct
2 Correct 7 ms 1152 KB Output is correct
3 Correct 163 ms 1280 KB Output is correct
4 Correct 192 ms 1400 KB Output is correct
5 Correct 520 ms 1436 KB Output is correct
6 Correct 700 ms 1400 KB Output is correct
7 Correct 692 ms 1536 KB Output is correct
8 Correct 659 ms 1528 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 15 ms 1152 KB Output is correct
3 Correct 94 ms 1260 KB Output is correct
4 Correct 207 ms 1364 KB Output is correct
5 Correct 578 ms 1428 KB Output is correct
6 Correct 695 ms 1280 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 15 ms 1152 KB Output is correct
4 Correct 26 ms 1152 KB Output is correct
5 Correct 195 ms 1280 KB Output is correct
6 Correct 197 ms 1280 KB Output is correct
7 Correct 202 ms 1400 KB Output is correct
8 Correct 190 ms 1280 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 6 ms 1152 KB Output is correct
11 Correct 15 ms 1152 KB Output is correct
12 Correct 15 ms 1152 KB Output is correct
13 Correct 100 ms 1280 KB Output is correct
14 Correct 90 ms 1280 KB Output is correct
15 Correct 233 ms 1280 KB Output is correct
16 Correct 233 ms 1280 KB Output is correct
17 Correct 312 ms 1320 KB Output is correct
18 Correct 7 ms 1152 KB Output is correct
19 Correct 8 ms 1152 KB Output is correct
20 Correct 19 ms 1152 KB Output is correct
21 Correct 16 ms 1152 KB Output is correct
22 Correct 43 ms 1280 KB Output is correct
23 Correct 39 ms 1152 KB Output is correct
24 Correct 62 ms 1152 KB Output is correct
25 Correct 52 ms 1152 KB Output is correct
26 Correct 7 ms 1152 KB Output is correct
27 Correct 7 ms 1152 KB Output is correct
28 Correct 163 ms 1280 KB Output is correct
29 Correct 192 ms 1400 KB Output is correct
30 Correct 520 ms 1436 KB Output is correct
31 Correct 700 ms 1400 KB Output is correct
32 Correct 692 ms 1536 KB Output is correct
33 Correct 659 ms 1528 KB Output is correct
34 Correct 5 ms 1152 KB Output is correct
35 Correct 15 ms 1152 KB Output is correct
36 Correct 94 ms 1260 KB Output is correct
37 Correct 207 ms 1364 KB Output is correct
38 Correct 578 ms 1428 KB Output is correct
39 Correct 695 ms 1280 KB Output is correct
40 Correct 120 ms 1280 KB Output is correct
41 Correct 243 ms 1404 KB Output is correct
42 Correct 304 ms 1280 KB Output is correct
43 Correct 534 ms 1504 KB Output is correct
44 Correct 530 ms 1436 KB Output is correct
45 Correct 475 ms 1408 KB Output is correct
46 Correct 214 ms 1400 KB Output is correct
47 Correct 301 ms 1280 KB Output is correct
48 Correct 297 ms 1380 KB Output is correct