oj.uz

Submission #70884

# Submission time Handle Problem Language Result Execution time Memory
70884 2018-08-23T15:34:17 Z georgerapeanu Cloud Computing (CEOI18_clo) C++11
100 / 100
 413 ms 1516 KB 
#include <cstdio>
#include <algorithm>

using namespace std;

const int NMAX = 2000;
const int CORE_MAX = 50;
const int TOTAL_CORE_MAX = 2 * NMAX * CORE_MAX;
const int COST_MAX = 1e9;
const long long TOTAL_COST_MAX = 2LL * NMAX * COST_MAX;
const long long inf = (1LL << 60) - TOTAL_COST_MAX - 3;

struct order_t{
   int cores;
   int frequency;
   int cost;

   order_t(){
      cores = 0;
      frequency = 0;
      cost = 0;
   }

   bool operator < (const order_t &other)const{///this sorts them in nonincreasing order based on frequency
      if(frequency != other.frequency){
         return frequency > other.frequency;
      }
      
      if(cost != other.cost){
         return cost < other.cost;
      }
      
      return cores < other.cores;
   }
};

int n,m;
long long dp[TOTAL_CORE_MAX + 5];
int st,dr;
order_t orders[2 * NMAX + 5];


int main() {
    fscanf(stdin,"%d",&n);

    for(int i = 1;i <= n;i++){
      fscanf(stdin,"%d %d %d",&orders[i].cores,&orders[i].frequency,&orders[i].cost);
      orders[i].cost *= -1;
    }

    fscanf(stdin,"%d",&m);

    for(int i = n + 1;i <= n + m;i++){
      fscanf(stdin,"%d %d %d",&orders[i].cores,&orders[i].frequency,&orders[i].cost);
      orders[i].cores *= -1;
    }

    n += m;

    sort(orders + 1,orders + 1 + n);

    for(int i = 0;i < n;i++){
        if(orders[i + 1].cores < 0){
            for(int j = max(0,st + orders[i + 1].cores);j < st;j++){
                dp[j] = -inf;
            }

            for(int j = st;j <= dr;j++){
                if(j + orders[i + 1].cores >= 0){
                   dp[j + orders[i + 1].cores] = max(dp[j + orders[i + 1].cores],dp[j] + orders[i + 1].cost);
                }
            }

        }
        else{
            for(int j = dr + 1;j <= dr + orders[i + 1].cores;j++){
                dp[j] = -inf;
            }
            for(int j = dr;j >= st;j--){
                dp[j + orders[i + 1].cores] = max(dp[j + orders[i + 1].cores],dp[j] + orders[i + 1].cost);
            }
            dr += orders[i + 1].cores;
        }
    }

    long long ans = 0;

    for(int j = st;j <= dr;j++){
       ans = max(ans,dp[j]);
    }

    fprintf(stdout,"%lld",ans);

    return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:44:11: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf(stdin,"%d",&n);
     ~~~~~~^~~~~~~~~~~~~~~
clo.cpp:47:13: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       fscanf(stdin,"%d %d %d",&orders[i].cores,&orders[i].frequency,&orders[i].cost);
       ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:51:11: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf(stdin,"%d",&m);
     ~~~~~~^~~~~~~~~~~~~~~
clo.cpp:54:13: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       fscanf(stdin,"%d %d %d",&orders[i].cores,&orders[i].frequency,&orders[i].cost);
       ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 620 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 6 ms 620 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 620 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 14 ms 748 KB Output is correct
6 Correct 4 ms 748 KB Output is correct
7 Correct 61 ms 1100 KB Output is correct
8 Correct 12 ms 1100 KB Output is correct
9 Correct 94 ms 1380 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1380 KB Output is correct
2 Correct 2 ms 1380 KB Output is correct
3 Correct 7 ms 1380 KB Output is correct
4 Correct 5 ms 1380 KB Output is correct
5 Correct 201 ms 1380 KB Output is correct
6 Correct 382 ms 1436 KB Output is correct
7 Correct 384 ms 1436 KB Output is correct
8 Correct 394 ms 1436 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1436 KB Output is correct
2 Correct 3 ms 1436 KB Output is correct
3 Correct 15 ms 1436 KB Output is correct
4 Correct 10 ms 1436 KB Output is correct
5 Correct 262 ms 1436 KB Output is correct
6 Correct 343 ms 1436 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 620 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 6 ms 620 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 14 ms 748 KB Output is correct
14 Correct 4 ms 748 KB Output is correct
15 Correct 61 ms 1100 KB Output is correct
16 Correct 12 ms 1100 KB Output is correct
17 Correct 94 ms 1380 KB Output is correct
18 Correct 3 ms 1380 KB Output is correct
19 Correct 3 ms 1380 KB Output is correct
20 Correct 3 ms 1380 KB Output is correct
21 Correct 3 ms 1380 KB Output is correct
22 Correct 3 ms 1380 KB Output is correct
23 Correct 2 ms 1380 KB Output is correct
24 Correct 3 ms 1380 KB Output is correct
25 Correct 2 ms 1380 KB Output is correct
26 Correct 3 ms 1380 KB Output is correct
27 Correct 2 ms 1380 KB Output is correct
28 Correct 7 ms 1380 KB Output is correct
29 Correct 5 ms 1380 KB Output is correct
30 Correct 201 ms 1380 KB Output is correct
31 Correct 382 ms 1436 KB Output is correct
32 Correct 384 ms 1436 KB Output is correct
33 Correct 394 ms 1436 KB Output is correct
34 Correct 2 ms 1436 KB Output is correct
35 Correct 3 ms 1436 KB Output is correct
36 Correct 15 ms 1436 KB Output is correct
37 Correct 10 ms 1436 KB Output is correct
38 Correct 262 ms 1436 KB Output is correct
39 Correct 343 ms 1436 KB Output is correct
40 Correct 18 ms 1436 KB Output is correct
41 Correct 56 ms 1436 KB Output is correct
42 Correct 7 ms 1436 KB Output is correct
43 Correct 413 ms 1516 KB Output is correct
44 Correct 412 ms 1516 KB Output is correct
45 Correct 270 ms 1516 KB Output is correct
46 Correct 5 ms 1516 KB Output is correct
47 Correct 7 ms 1516 KB Output is correct
48 Correct 6 ms 1516 KB Output is correct