oj.uz

Submission #947171

# Submission time Handle Problem Language Result Execution time Memory
947171 2024-03-15T15:23:46 Z DJeniUp Cloud Computing (CEOI18_clo) C++17
100 / 100
 1160 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{
    ll 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;
    scanf("%lld", &m);
    for(int i=1;i<=m;i++){
        //cin>>t[i].c>>t[i].f>>t[i].v;
        scanf("%lld %lld %lld", &t[i].c, &t[i].f, &t[i].v);
    }
    sort(t+1,t+1+m,mcp);
    //cin>>n;
    scanf("%lld", &n);
    for(int i=1;i<=n;i++){
        //cin>>d[i].c>>d[i].f>>d[i].v;
        scanf("%lld %lld %lld", &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;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:47:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     scanf("%lld", &m);
      |     ~~~~~^~~~~~~~~~~~
clo.cpp:50:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         scanf("%lld %lld %lld", &t[i].c, &t[i].f, &t[i].v);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:54:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |     scanf("%lld", &n);
      |     ~~~~~^~~~~~~~~~~~
clo.cpp:57:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         scanf("%lld %lld %lld", &d[i].c, &d[i].f, &d[i].v);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2136 KB Output is correct
2 Correct 1 ms 2136 KB Output is correct
3 Correct 4 ms 2140 KB Output is correct
4 Correct 7 ms 2228 KB Output is correct
5 Correct 59 ms 2384 KB Output is correct
6 Correct 53 ms 2392 KB Output is correct
7 Correct 60 ms 2136 KB Output is correct
8 Correct 58 ms 2392 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 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 2136 KB Output is correct
8 Correct 7 ms 2140 KB Output is correct
9 Correct 8 ms 2272 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2140 KB Output is correct
2 Correct 2 ms 2224 KB Output is correct
3 Correct 4 ms 2140 KB Output is correct
4 Correct 6 ms 2164 KB Output is correct
5 Correct 6 ms 2148 KB Output is correct
6 Correct 7 ms 2052 KB Output is correct
7 Correct 9 ms 2140 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 2 ms 2136 KB Output is correct
2 Correct 1 ms 2140 KB Output is correct
3 Correct 4 ms 2260 KB Output is correct
4 Correct 53 ms 2140 KB Output is correct
5 Correct 761 ms 2284 KB Output is correct
6 Correct 830 ms 2292 KB Output is correct
7 Correct 1103 ms 2292 KB Output is correct
8 Correct 1058 ms 2292 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 2220 KB Output is correct
4 Correct 67 ms 2252 KB Output is correct
5 Correct 802 ms 2288 KB Output is correct
6 Correct 849 ms 2296 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2136 KB Output is correct
2 Correct 1 ms 2136 KB Output is correct
3 Correct 4 ms 2140 KB Output is correct
4 Correct 7 ms 2228 KB Output is correct
5 Correct 59 ms 2384 KB Output is correct
6 Correct 53 ms 2392 KB Output is correct
7 Correct 60 ms 2136 KB Output is correct
8 Correct 58 ms 2392 KB Output is correct
9 Correct 2 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 2 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 2136 KB Output is correct
16 Correct 7 ms 2140 KB Output is correct
17 Correct 8 ms 2272 KB Output is correct
18 Correct 2 ms 2140 KB Output is correct
19 Correct 2 ms 2224 KB Output is correct
20 Correct 4 ms 2140 KB Output is correct
21 Correct 6 ms 2164 KB Output is correct
22 Correct 6 ms 2148 KB Output is correct
23 Correct 7 ms 2052 KB Output is correct
24 Correct 9 ms 2140 KB Output is correct
25 Correct 9 ms 2140 KB Output is correct
26 Correct 2 ms 2136 KB Output is correct
27 Correct 1 ms 2140 KB Output is correct
28 Correct 4 ms 2260 KB Output is correct
29 Correct 53 ms 2140 KB Output is correct
30 Correct 761 ms 2284 KB Output is correct
31 Correct 830 ms 2292 KB Output is correct
32 Correct 1103 ms 2292 KB Output is correct
33 Correct 1058 ms 2292 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 2220 KB Output is correct
37 Correct 67 ms 2252 KB Output is correct
38 Correct 802 ms 2288 KB Output is correct
39 Correct 849 ms 2296 KB Output is correct
40 Correct 71 ms 2136 KB Output is correct
41 Correct 211 ms 2136 KB Output is correct
42 Correct 71 ms 2268 KB Output is correct
43 Correct 1160 ms 2292 KB Output is correct
44 Correct 1132 ms 2292 KB Output is correct
45 Correct 860 ms 2388 KB Output is correct
46 Correct 43 ms 2136 KB Output is correct
47 Correct 82 ms 2268 KB Output is correct
48 Correct 72 ms 2136 KB Output is correct