oj.uz

Submission #947175

# Submission time Handle Problem Language Result Execution time Memory
947175 2024-03-15T15:28:31 Z DJeniUp Cloud Computing (CEOI18_clo) C++17
100 / 100
 1218 ms 2392 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pairll;
typedef pair<ll,ull>pairull;
typedef pair<ll,pairll>pair3l;
typedef long double ld;
typedef pair<ld,ld>pairld;

typedef pair<string,ll>pairsl;

#define fr first
#define sc second
#define pb push_back
#define endl '\n'
#define N 100007
#define MOD 1000000007
#define INF 10000000000007
#define eps 0.00000000001
#define A 49
#define PI 3.14159265359

ll n,m,dp[2][2007][A+7];

struct D{
    int c,f,v;
}d[2007],t[2007];

bool mcp(D d1, D d2){
    return d1.f<d2.f;
}

int main(){

    ios_base::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);

    cin>>m;
    for(int i=1;i<=m;i++){
        cin>>t[i].c>>t[i].f>>t[i].v;
    }
    sort(t+1,t+1+m,mcp);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>d[i].c>>d[i].f>>d[i].v;
    }
    sort(d+1,d+1+n,mcp);
    for(int i=0;i<2;i++){
        for(int j=1;j<=m+1;j++){
            for(int k=1;k<=A+1;k++){
                dp[i][j][k]=-INF;
            }
        }
    }
    d[n+1].f=d[n].f;
    for(int i1=n+1;i1>=1;i1--){
        swap(dp[0],dp[1]);
        for(int j=1;j<=m;j++){
            for(int k=1;k<=max(d[i1].c,max(d[i1-1].c,t[j].c))+1;k++){
                dp[0][j][k]=-INF;
            }
        }
        ll i=0;
        for(int j=m;j>=1;j--){
            for(int k=max(d[i1].c,max(d[i1-1].c,t[j].c));k>=0;k--){
               // cout<<i<<" "<<j<<" "<<k<<endl;
                dp[i][j][k]=max(dp[i+1][j][k],max(dp[i][j+1][k],dp[i][j][k+1]));
                if(t[j].f>=d[i1].f && k+d[i1].c-t[j].c>=0 && k+d[i1].c-t[j].c<=A)dp[i][j][k]=max(dp[i][j][k],dp[i+1][j+1][k+d[i1].c-t[j].c]+d[i1].v-t[j].v);
                if(t[j].f>=d[i1-1].f && k-t[j].c>=0)dp[i][j][k]=max(dp[i][j+1][k-t[j].c]-t[j].v,dp[i][j][k]);
                if(k+d[i1].c<=A)dp[i][j][k]=max(dp[i][j][k],dp[i+1][j][k+d[i1].c]+d[i1].v);
                //if(k<=30)cout<<i<<" "<<j<<" "<<k<<" "<<dp[i][j][k]<<endl;
            }
        }
    }
    cout<<dp[0][1][0]<<endl;

    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2140 KB Output is correct
2 Correct 1 ms 2140 KB Output is correct
3 Correct 4 ms 2220 KB Output is correct
4 Correct 9 ms 2140 KB Output is correct
5 Correct 57 ms 2140 KB Output is correct
6 Correct 55 ms 2136 KB Output is correct
7 Correct 61 ms 2140 KB Output is correct
8 Correct 58 ms 2140 KB Output is correct

Subtask #2
18.0 / 18.0

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

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2140 KB Output is correct
2 Correct 1 ms 2140 KB Output is correct
3 Correct 4 ms 2140 KB Output is correct
4 Correct 54 ms 2216 KB Output is correct
5 Correct 816 ms 2236 KB Output is correct
6 Correct 843 ms 2236 KB Output is correct
7 Correct 1199 ms 2240 KB Output is correct
8 Correct 1126 ms 2236 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2140 KB Output is correct
2 Correct 5 ms 2140 KB Output is correct
3 Correct 32 ms 2140 KB Output is correct
4 Correct 73 ms 2140 KB Output is correct
5 Correct 797 ms 2244 KB Output is correct
6 Correct 895 ms 2140 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2140 KB Output is correct
2 Correct 1 ms 2140 KB Output is correct
3 Correct 4 ms 2220 KB Output is correct
4 Correct 9 ms 2140 KB Output is correct
5 Correct 57 ms 2140 KB Output is correct
6 Correct 55 ms 2136 KB Output is correct
7 Correct 61 ms 2140 KB Output is correct
8 Correct 58 ms 2140 KB Output is correct
9 Correct 1 ms 2136 KB Output is correct
10 Correct 1 ms 2140 KB Output is correct
11 Correct 2 ms 2140 KB Output is correct
12 Correct 1 ms 2140 KB Output is correct
13 Correct 4 ms 2140 KB Output is correct
14 Correct 3 ms 2140 KB Output is correct
15 Correct 7 ms 2140 KB Output is correct
16 Correct 7 ms 2140 KB Output is correct
17 Correct 8 ms 2392 KB Output is correct
18 Correct 2 ms 2136 KB Output is correct
19 Correct 2 ms 2140 KB Output is correct
20 Correct 4 ms 2140 KB Output is correct
21 Correct 4 ms 2140 KB Output is correct
22 Correct 6 ms 2228 KB Output is correct
23 Correct 6 ms 2140 KB Output is correct
24 Correct 9 ms 2136 KB Output is correct
25 Correct 9 ms 2140 KB Output is correct
26 Correct 1 ms 2140 KB Output is correct
27 Correct 1 ms 2140 KB Output is correct
28 Correct 4 ms 2140 KB Output is correct
29 Correct 54 ms 2216 KB Output is correct
30 Correct 816 ms 2236 KB Output is correct
31 Correct 843 ms 2236 KB Output is correct
32 Correct 1199 ms 2240 KB Output is correct
33 Correct 1126 ms 2236 KB Output is correct
34 Correct 1 ms 2140 KB Output is correct
35 Correct 5 ms 2140 KB Output is correct
36 Correct 32 ms 2140 KB Output is correct
37 Correct 73 ms 2140 KB Output is correct
38 Correct 797 ms 2244 KB Output is correct
39 Correct 895 ms 2140 KB Output is correct
40 Correct 74 ms 2136 KB Output is correct
41 Correct 228 ms 2220 KB Output is correct
42 Correct 87 ms 2228 KB Output is correct
43 Correct 1218 ms 2240 KB Output is correct
44 Correct 1202 ms 2240 KB Output is correct
45 Correct 870 ms 2240 KB Output is correct
46 Correct 46 ms 2140 KB Output is correct
47 Correct 77 ms 2140 KB Output is correct
48 Correct 73 ms 2236 KB Output is correct