oj.uz

Submission #228345

# Submission time Handle Problem Language Result Execution time Memory
228345 2020-04-30T16:12:08 Z kimbj0709 Cloud Computing (CEOI18_clo) C++14
100 / 100
 987 ms 2424 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,pair<int,pair<int,int> > > 
#define f first
#define s second
#define LLONG_MIN -10000000000000000
#define maxn 100050
int32_t main(){
  ios::sync_with_stdio(0);
  cin.tie(0);cout.tie(0);
  int no_of_input;
  int input1,input2,input3,input4;
  vector<pii> vect1;
  cin >> no_of_input;
  for(int i=0;i<no_of_input;i++){
    cin >> input1 >> input2 >> input3;
    vect1.push_back({input2,{1,{input1,input3}}});//frequency,sub,corecount,price

  }
  cin >> no_of_input;
  for(int i=0;i<no_of_input;i++){
    cin >> input1 >> input2 >> input3;
    vect1.push_back({input2,{-1,{input1,input3}}});//frequency,sub,corecount,price
  }
  sort(vect1.begin(),vect1.end());
  reverse(vect1.begin(),vect1.end());
  vector<int> dp(maxn,LLONG_MIN);
  dp[0] = 0;
  vector<int> temp(maxn,LLONG_MIN);
  for(auto k:vect1){
    //cout << k.f << " " << k.s.f << " " << k.s.s.f << " " << k.s.s.s << "\n";
  }
  for(int i=0;i<vect1.size();i++){
    temp = dp;
    int q = vect1[i].s.s.f,price = vect1[i].s.s.s;
    if(vect1[i].s.f==1){//add stuff
      for(int j=0;j<=dp.size()-1-q;j++){

        temp[j+q] = max(temp[j+q],dp[j]-price);
      }
    }
    else{//subtract stuff
      for(int j=dp.size()-1;j>=q;j--){

        temp[j-q] = max(temp[j-q],dp[j]+price);
      }
    }
    dp = temp;
  }
  int ans = 0;
  for(auto k:dp){
    ans = max(ans,k);
  }
  cout << ans;

}

Compilation message

clo.cpp:7:0: warning: "LLONG_MIN" redefined
 #define LLONG_MIN -10000000000000000
 
In file included from /usr/lib/gcc/x86_64-linux-gnu/7/include-fixed/limits.h:194:0,
                 from /usr/lib/gcc/x86_64-linux-gnu/7/include-fixed/syslimits.h:7,
                 from /usr/lib/gcc/x86_64-linux-gnu/7/include-fixed/limits.h:34,
                 from /usr/include/c++/7/climits:42,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:39,
                 from clo.cpp:1:
/usr/include/limits.h:131:0: note: this is the location of the previous definition
 #  define LLONG_MIN (-LLONG_MAX-1)
 
clo.cpp: In function 'int32_t main()':
clo.cpp:31:12: warning: variable 'k' set but not used [-Wunused-but-set-variable]
   for(auto k:vect1){
            ^
clo.cpp:34:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<vect1.size();i++){
               ~^~~~~~~~~~~~~
clo.cpp:38:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int j=0;j<=dp.size()-1-q;j++){
                   ~^~~~~~~~~~~~~~~
clo.cpp:13:28: warning: unused variable 'input4' [-Wunused-variable]
   int input1,input2,input3,input4;
                            ^~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1920 KB Output is correct
2 Correct 6 ms 1920 KB Output is correct
3 Correct 33 ms 1920 KB Output is correct
4 Correct 57 ms 1920 KB Output is correct
5 Correct 497 ms 2168 KB Output is correct
6 Correct 479 ms 2048 KB Output is correct
7 Correct 497 ms 2168 KB Output is correct
8 Correct 489 ms 2048 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1920 KB Output is correct
2 Correct 8 ms 1920 KB Output is correct
3 Correct 32 ms 1920 KB Output is correct
4 Correct 33 ms 1920 KB Output is correct
5 Correct 225 ms 2048 KB Output is correct
6 Correct 235 ms 2048 KB Output is correct
7 Correct 507 ms 2176 KB Output is correct
8 Correct 518 ms 2168 KB Output is correct
9 Correct 481 ms 2048 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1920 KB Output is correct
2 Correct 13 ms 1920 KB Output is correct
3 Correct 51 ms 1920 KB Output is correct
4 Correct 52 ms 1920 KB Output is correct
5 Correct 106 ms 1920 KB Output is correct
6 Correct 100 ms 1920 KB Output is correct
7 Correct 129 ms 1920 KB Output is correct
8 Correct 132 ms 1920 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1920 KB Output is correct
2 Correct 9 ms 1920 KB Output is correct
3 Correct 380 ms 2168 KB Output is correct
4 Correct 437 ms 2168 KB Output is correct
5 Correct 910 ms 2296 KB Output is correct
6 Correct 979 ms 2400 KB Output is correct
7 Correct 963 ms 2176 KB Output is correct
8 Correct 945 ms 2296 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1920 KB Output is correct
2 Correct 43 ms 1920 KB Output is correct
3 Correct 205 ms 2168 KB Output is correct
4 Correct 494 ms 2168 KB Output is correct
5 Correct 956 ms 2296 KB Output is correct
6 Correct 969 ms 2296 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1920 KB Output is correct
2 Correct 6 ms 1920 KB Output is correct
3 Correct 33 ms 1920 KB Output is correct
4 Correct 57 ms 1920 KB Output is correct
5 Correct 497 ms 2168 KB Output is correct
6 Correct 479 ms 2048 KB Output is correct
7 Correct 497 ms 2168 KB Output is correct
8 Correct 489 ms 2048 KB Output is correct
9 Correct 6 ms 1920 KB Output is correct
10 Correct 8 ms 1920 KB Output is correct
11 Correct 32 ms 1920 KB Output is correct
12 Correct 33 ms 1920 KB Output is correct
13 Correct 225 ms 2048 KB Output is correct
14 Correct 235 ms 2048 KB Output is correct
15 Correct 507 ms 2176 KB Output is correct
16 Correct 518 ms 2168 KB Output is correct
17 Correct 481 ms 2048 KB Output is correct
18 Correct 13 ms 1920 KB Output is correct
19 Correct 13 ms 1920 KB Output is correct
20 Correct 51 ms 1920 KB Output is correct
21 Correct 52 ms 1920 KB Output is correct
22 Correct 106 ms 1920 KB Output is correct
23 Correct 100 ms 1920 KB Output is correct
24 Correct 129 ms 1920 KB Output is correct
25 Correct 132 ms 1920 KB Output is correct
26 Correct 9 ms 1920 KB Output is correct
27 Correct 9 ms 1920 KB Output is correct
28 Correct 380 ms 2168 KB Output is correct
29 Correct 437 ms 2168 KB Output is correct
30 Correct 910 ms 2296 KB Output is correct
31 Correct 979 ms 2400 KB Output is correct
32 Correct 963 ms 2176 KB Output is correct
33 Correct 945 ms 2296 KB Output is correct
34 Correct 7 ms 1920 KB Output is correct
35 Correct 43 ms 1920 KB Output is correct
36 Correct 205 ms 2168 KB Output is correct
37 Correct 494 ms 2168 KB Output is correct
38 Correct 956 ms 2296 KB Output is correct
39 Correct 969 ms 2296 KB Output is correct
40 Correct 250 ms 2048 KB Output is correct
41 Correct 472 ms 2128 KB Output is correct
42 Correct 776 ms 2296 KB Output is correct
43 Correct 972 ms 2296 KB Output is correct
44 Correct 987 ms 2296 KB Output is correct
45 Correct 969 ms 2424 KB Output is correct
46 Correct 523 ms 2168 KB Output is correct
47 Correct 772 ms 2296 KB Output is correct
48 Correct 752 ms 2176 KB Output is correct