oj.uz

Submission #472979

# Submission time Handle Problem Language Result Execution time Memory
472979 2021-09-14T17:06:06 Z fadi57 Cloud Computing (CEOI18_clo) C++17
100 / 100
 931 ms 2060 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
const int mx=2009;
typedef long long ll;
 int mod=1e9+7;
const int MXm=22;
#define F first
#define S second
const ll inf=1e14+10;
int n,m;
struct computer{
ll c,f,v,typ;
};

ll dp[2000*50+90][2];computer a[mx+mx];
 bool cmp(computer x,computer y){

   if(x.f!=y.f){

     return x.f>y.f;

   }else{
    return x.typ<y.typ;

    }}

 int main(){
   cin>>n;
   ll sum=0;

   for(int i=0;i<n;i++){
   cin>>a[i].c>>a[i].f>>a[i].v;
     sum+=a[i].c;
    a[i].typ=0;
   }
   cin>>m;
    for(int i=n;i<m+n;i++){

    cin>>a[i].c>>a[i].f>>a[i].v;
     a[i].typ=1;
   }
    sort(a,a+(n+m),cmp);

    for(int i=0;i<=sum;i++){

        dp[i][1]=-inf;
    }
    dp[0][1]=0;  ll ans=0;

    for(int i=0;i<n+m;i++){

        for(int j=0;j<=sum;j++){

            dp[j][i&1]=dp[j][(i+1)&1];
            if(a[i].typ==0){
                if(j-a[i].c>=0){
                    dp[j][i&1]=max(dp[j-a[i].c][(i+1)&1]-a[i].v,dp[j][i&1]);
                }

            }else{

            if(a[i].c+j<=sum){
                    dp[j][i&1]=max(dp[j+a[i].c][(i+1)&1]+a[i].v,dp[j][i&1]);
                }


            }

      ans=max(ans,dp[j][i&1]);

        }


    }
 cout<<ans;
    }

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 44 ms 588 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 215 ms 1228 KB Output is correct
8 Correct 42 ms 460 KB Output is correct
9 Correct 348 ms 1728 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 19 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 408 ms 1256 KB Output is correct
6 Correct 766 ms 1868 KB Output is correct
7 Correct 768 ms 1868 KB Output is correct
8 Correct 740 ms 1740 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 49 ms 716 KB Output is correct
4 Correct 11 ms 432 KB Output is correct
5 Correct 811 ms 1848 KB Output is correct
6 Correct 811 ms 1840 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 4 ms 316 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 7 ms 316 KB Output is correct
8 Correct 6 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 44 ms 588 KB Output is correct
14 Correct 3 ms 332 KB Output is correct
15 Correct 215 ms 1228 KB Output is correct
16 Correct 42 ms 460 KB Output is correct
17 Correct 348 ms 1728 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 19 ms 332 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 408 ms 1256 KB Output is correct
31 Correct 766 ms 1868 KB Output is correct
32 Correct 768 ms 1868 KB Output is correct
33 Correct 740 ms 1740 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 49 ms 716 KB Output is correct
37 Correct 11 ms 432 KB Output is correct
38 Correct 811 ms 1848 KB Output is correct
39 Correct 811 ms 1840 KB Output is correct
40 Correct 59 ms 692 KB Output is correct
41 Correct 174 ms 904 KB Output is correct
42 Correct 16 ms 332 KB Output is correct
43 Correct 849 ms 2016 KB Output is correct
44 Correct 886 ms 2024 KB Output is correct
45 Correct 931 ms 2060 KB Output is correct
46 Correct 6 ms 332 KB Output is correct
47 Correct 13 ms 476 KB Output is correct
48 Correct 12 ms 460 KB Output is correct