oj.uz

Submission #977313

# Submission time Handle Problem Language Result Execution time Memory
977313 2024-05-07T17:54:31 Z PieArmy Cloud Computing (CEOI18_clo) C++17
100 / 100
 1239 ms 2388 KB 
typedef long long ll;
ll pie(ll army){return (1ll<<army);}
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define endl '\n'
#define mid ((left+right)>>1)
const ll inf=2000000000000000005;
const int sonsuz=2000000005;
using namespace std;
ll fpow(ll x,ll y,ll m=0){if(y<0){cout<<"powError";return -1;}if(m)x%=m;ll res=1;while(y>0){if(y&1)res*=x;x*=x;if(m){x%=m;res%=m;}y>>=1;}return res;}

int n,m;

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	cin>>n;
    int c[n],f[n],v[n];
    for(int i=0;i<n;i++){
        cin>>c[i]>>f[i]>>v[i];
    }
    cin>>m;
    int C[m],F[m],V[m];
    for(int i=0;i<m;i++){
        cin>>C[i]>>F[i]>>V[i];
    }
    int p[n],P[m];
    iota(p,p+n,0);iota(P,P+m,0);
    sort(p,p+n,[&](const int &x,const int &y){return f[x]>f[y];});
    sort(P,P+m,[&](const int &x,const int &y){return F[x]>F[y];});
    ll dp[n+1][51];
    for(int i=0;i<=n;i++){
        for(int j=0;j<=50;j++){
            dp[i][j]=-inf;
        }
    }
    dp[0][0]=0;
    for(int i=0;i<m;i++){
        ll dp2[n+1][51];
        for(int j=0;j<=n;j++){
            for(int l=0;l<=50;l++){
                dp2[j][l]=-inf;
            }
        }
        for(int j=0;j<=n;j++){
            for(int l=0;l<=50;l++){
                if(dp[j][l]==-inf)continue;
                dp2[j][l]=max(dp2[j][l],dp[j][l]);
                if(l>=C[P[i]]){
                    dp2[j][l-C[P[i]]]=max(dp2[j][l-C[P[i]]],dp[j][l]+V[P[i]]);
                }
                if(j==n)continue;
                dp[j+1][l]=max(dp[j+1][l],dp[j][l]);
                if(f[p[j]]>=F[P[i]]){
                    if(l+c[p[j]]<C[P[i]]){
                        dp[j+1][l+c[p[j]]]=max(dp[j+1][l+c[p[j]]],dp[j][l]-v[p[j]]);
                    }
                    else if(l<C[P[i]]){
                        dp2[j+1][l+c[p[j]]-C[P[i]]]=max(dp2[j+1][l+c[p[j]]-C[P[i]]],dp[j][l]+V[P[i]]-v[p[j]]);
                    }
                }
            }
        }
        for(int j=0;j<=n;j++){
            for(int l=0;l<=50;l++){
                dp[j][l]=dp2[j][l];
            }
        }
    }
    ll ans=0;
    for(int i=0;i<=n;i++){
        for(int j=0;j<=50;j++){
            ans=max(ans,dp[i][j]);
        }
    }
    cout<<ans;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 4 ms 1116 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 8 ms 2076 KB Output is correct
8 Correct 9 ms 1880 KB Output is correct
9 Correct 9 ms 1884 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 4 ms 668 KB Output is correct
8 Correct 4 ms 672 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 1624 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 958 ms 2136 KB Output is correct
6 Correct 1213 ms 2140 KB Output is correct
7 Correct 1213 ms 2388 KB Output is correct
8 Correct 1151 ms 2084 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 32 ms 916 KB Output is correct
4 Correct 68 ms 1116 KB Output is correct
5 Correct 941 ms 2140 KB Output is correct
6 Correct 1239 ms 2136 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 8 ms 2076 KB Output is correct
16 Correct 9 ms 1880 KB Output is correct
17 Correct 9 ms 1884 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 3 ms 604 KB Output is correct
24 Correct 4 ms 668 KB Output is correct
25 Correct 4 ms 672 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 4 ms 1624 KB Output is correct
29 Correct 5 ms 348 KB Output is correct
30 Correct 958 ms 2136 KB Output is correct
31 Correct 1213 ms 2140 KB Output is correct
32 Correct 1213 ms 2388 KB Output is correct
33 Correct 1151 ms 2084 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 32 ms 916 KB Output is correct
37 Correct 68 ms 1116 KB Output is correct
38 Correct 941 ms 2140 KB Output is correct
39 Correct 1239 ms 2136 KB Output is correct
40 Correct 58 ms 860 KB Output is correct
41 Correct 204 ms 1088 KB Output is correct
42 Correct 138 ms 1756 KB Output is correct
43 Correct 235 ms 2136 KB Output is correct
44 Correct 241 ms 2140 KB Output is correct
45 Correct 222 ms 2296 KB Output is correct
46 Correct 55 ms 1112 KB Output is correct
47 Correct 133 ms 1628 KB Output is correct
48 Correct 121 ms 1628 KB Output is correct