oj.uz

Submission #672129

# Submission time Handle Problem Language Result Execution time Memory
672129 2022-12-14T19:50:28 Z Quan2003 Cloud Computing (CEOI18_clo) C++17
100 / 100
 900 ms 2132 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz=2e5+10;
const int sz1 = 5e5 + 10;
const int inf=1e6+1;
int dp[sz];
long long ans[sz];
int n,q;
vector<array<long long,3>>queries;
struct comp{
     long long c,r,p;
     bool operator<(comp B){
          if(r == B.r) return p < B.p;
          else return r  > B.r;
     }
};
int main(){
       scanf("%d",&n);
       vector<comp>pay;
       long long cbound = 0;
       for(int i = 1; i <= n; i++){
            comp go;
            scanf("%lld%lld%lld",&go.c,&go.r,&go.p); 
            go.p = - go.p;
            pay.push_back(go);
            cbound += go.c;     
       }
       scanf("%d",&q);
       for(int i = 1; i <= q; i++){
           comp go;
           scanf("%lld%lld%lld",&go.c,&go.r,&go.p); 
           go.c = - go.c;
           pay.push_back(go);
       }
       sort(pay.begin(),pay.end());
       vector<long long>opt(cbound + 1, -LLONG_MAX);
       opt[0] = 0;
       for(int i = 0; i < pay.size();i++){
             vector<long long>dp = opt;
             for(int j = 0; j <= cbound; j++){
                  int cur = j - pay[i].c;
                  if(cur < 0 or cur > cbound or opt[cur] == -LLONG_MAX) continue;  
                  dp[j] = max(dp[j], opt[cur] + pay[i].p);
             } 
             opt = dp;
       }
       cout<<(*max_element(opt.begin(),opt.end()));
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:39:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<comp>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |        for(int i = 0; i < pay.size();i++){
      |                       ~~^~~~~~~~~~~~
clo.cpp:19:13: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |        scanf("%d",&n);
      |        ~~~~~^~~~~~~~~
clo.cpp:24:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |             scanf("%lld%lld%lld",&go.c,&go.r,&go.p);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:29:13: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |        scanf("%d",&q);
      |        ~~~~~^~~~~~~~~
clo.cpp:32:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |            scanf("%lld%lld%lld",&go.c,&go.r,&go.p);
      |            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 360 KB Output is correct
7 Correct 5 ms 352 KB Output is correct
8 Correct 4 ms 432 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 45 ms 724 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 199 ms 1240 KB Output is correct
8 Correct 31 ms 468 KB Output is correct
9 Correct 301 ms 1748 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 12 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 360 ms 1348 KB Output is correct
6 Correct 624 ms 1936 KB Output is correct
7 Correct 625 ms 1936 KB Output is correct
8 Correct 635 ms 1876 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 41 ms 724 KB Output is correct
4 Correct 8 ms 420 KB Output is correct
5 Correct 732 ms 1948 KB Output is correct
6 Correct 659 ms 1940 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 360 KB Output is correct
7 Correct 5 ms 352 KB Output is correct
8 Correct 4 ms 432 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 45 ms 724 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 199 ms 1240 KB Output is correct
16 Correct 31 ms 468 KB Output is correct
17 Correct 301 ms 1748 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 12 ms 340 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 360 ms 1348 KB Output is correct
31 Correct 624 ms 1936 KB Output is correct
32 Correct 625 ms 1936 KB Output is correct
33 Correct 635 ms 1876 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 41 ms 724 KB Output is correct
37 Correct 8 ms 420 KB Output is correct
38 Correct 732 ms 1948 KB Output is correct
39 Correct 659 ms 1940 KB Output is correct
40 Correct 47 ms 724 KB Output is correct
41 Correct 129 ms 852 KB Output is correct
42 Correct 10 ms 468 KB Output is correct
43 Correct 690 ms 2068 KB Output is correct
44 Correct 780 ms 2132 KB Output is correct
45 Correct 900 ms 2132 KB Output is correct
46 Correct 5 ms 340 KB Output is correct
47 Correct 10 ms 524 KB Output is correct
48 Correct 10 ms 468 KB Output is correct