oj.uz

답안 #569560

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
569560 2022-05-27T13:52:00 Z tarunares7250 Cloud Computing (CEOI18_clo) C++17
100 / 100
 576 ms 1612 KB 
//ulimit -s unlimited
#include <bits/stdc++.h>
using namespace std;
#define ll long long 
#define vl vector<ll>
#define vi vector<int>
#define vb vector<bool>
#define pql priority_queue<long long>
#define pqp priority_queue<pair<ll,ll> >
#define pqs priority_queue<ll,vl,greater<ll> >
#define md ((ll) 1e9+7)


typedef struct node{
    ll c,f,v;
    bool operator<(node &b) const{
        if(f == b.f){
            return (c>b.c);
        }
        else{
            return (f>b.f);
        }
    }
}node;

void solve(){

    ll i,j,k,n,m;
    cin>>n;
    vector<node> sc(n);
    vector<node> a;
    ll tc = 0;
    for(i=0;i<n;i++){
        cin>>sc[i].c>>sc[i].f>>sc[i].v;
        sc[i].v *= -1;
        a.push_back(sc[i]);
        tc += sc[i].c;
    }
    cin>>m;
    vector<node> oc(m);
    for(i=0;i<m;i++){
        cin>>oc[i].c>>oc[i].f>>oc[i].v;
        oc[i].c *= -1;
        a.push_back(oc[i]);
    }
    sort(a.begin(),a.end());

    ll dp[tc+1];
    bool isp[tc+1];
    memset(isp,false,sizeof(isp));
    for(i=0;i<=tc;i++){
        dp[i] = -1e15;
    }
    dp[0] = 0;
    isp[0] = true;
    for(i=0;i<n+m;i++){
        if(a[i].c>0){
            for(j=tc;j>=a[i].c;j--){
                if(isp[j-a[i].c]){
                    dp[j] = max(dp[j],dp[j-a[i].c]+a[i].v);
                    isp[j] = true;
                }
            }
        }
        else{
            for(j = 0;j<=tc+a[i].c;j++){
                if(isp[j-a[i].c]){
                    dp[j] = max(dp[j],dp[j-a[i].c]+a[i].v);
                    isp[j] = true;
                }
            }
        }
    }

    ll ans = 0;
    for(i=0;i<=tc;i++){
        ans = max(ans,dp[i]);
    }
    cout<<ans<<"\n";

    // for(auto c:a){
    //     cout<<c.c<<","<<c.f<<","<<c.v<<"\n";
    // }


}
/*

dp[i][j][k] = max profit till ith computer and jth order,k cores 
are remaining
dp[i-1][j] , dp[j][i-1] ,  dp[i-1][j-1]

*/
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t;
    //cin >> t;
    t = 1;
    while(t--)
        solve();
    return 0;
}

/*
ll i,j,k,n,m;
    cin>>n;
    vector<node> sp(n);
    for(i=0;i<n;i++){
        cin>>sp[i].c>>sp[i].f>>sp[i].v;
    }
    sort(sp.begin(),sp.end());

    cin>>m;
    vector<node> od(m);
    for(i=0;i<m;i++){
        cin>>od[i].c>>od[i].f>>od[i].v;
    }
    sort(od.begin(),od.end());
    
    vector<vector<vl> > dp(n,vector<vl> (m,vl(51,0)));
    //dp[0][0][0] = 0;
    for(i=0;i<n;i++){
        for(j=0;j<m;j++){
            for(k=0;k<51;k++){
                dp[i][j][k] = max({(j-1>=0?dp[i][j-1][k]:0),(i-1>=0?dp[i-1][j][k]:0),
                ((i-1>=0 && j-1>=0 && k-(sp[i].c - od[j].c)>=0 && sp[i].f>=od[j].f)?dp[i-1][j-1][k-(sp[i].c - od[j].c)] + od[j].v-sp[i].v:0),
                });
            }
        }
    }

    ll ans = 0;
    for(k=0;k<=50;k++){
        ans = max(ans,dp[n-1][m-1][k]);
    }
    cout<<ans<<"\n";

    cout<<"sp"<<"\n";
    for(i=0;i<n;i++){
        cout<<sp[i].c<<","<<sp[i].f<<","<<sp[i].v<<"\n";
    }
    cout<<"od\n";
    for(i=0;i<m;i++){
        cout<<od[i].c<<","<<od[i].f<<","<<od[i].v<<"\n";
    }
    cout<<dp.size()<<"\n";
    cout<<dp[0].size()<<"\n";
    cout<<dp[0][0].size()<<"\n";

*/

Compilation message

clo.cpp: In function 'void solve()':
clo.cpp:28:12: warning: unused variable 'k' [-Wunused-variable]
   28 |     ll i,j,k,n,m;
      |            ^

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 28 ms 576 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 154 ms 896 KB Output is correct
8 Correct 27 ms 468 KB Output is correct
9 Correct 281 ms 1200 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 10 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 330 ms 1036 KB Output is correct
6 Correct 504 ms 1428 KB Output is correct
7 Correct 576 ms 1432 KB Output is correct
8 Correct 477 ms 1340 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 38 ms 596 KB Output is correct
4 Correct 8 ms 468 KB Output is correct
5 Correct 437 ms 1380 KB Output is correct
6 Correct 545 ms 1376 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 28 ms 576 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 154 ms 896 KB Output is correct
16 Correct 27 ms 468 KB Output is correct
17 Correct 281 ms 1200 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 10 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 330 ms 1036 KB Output is correct
31 Correct 504 ms 1428 KB Output is correct
32 Correct 576 ms 1432 KB Output is correct
33 Correct 477 ms 1340 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 38 ms 596 KB Output is correct
37 Correct 8 ms 468 KB Output is correct
38 Correct 437 ms 1380 KB Output is correct
39 Correct 545 ms 1376 KB Output is correct
40 Correct 31 ms 588 KB Output is correct
41 Correct 84 ms 764 KB Output is correct
42 Correct 8 ms 540 KB Output is correct
43 Correct 493 ms 1516 KB Output is correct
44 Correct 500 ms 1612 KB Output is correct
45 Correct 483 ms 1556 KB Output is correct
46 Correct 6 ms 412 KB Output is correct
47 Correct 7 ms 460 KB Output is correct
48 Correct 7 ms 532 KB Output is correct