oj.uz

Submission #492406

# Submission time Handle Problem Language Result Execution time Memory
492406 2021-12-07T05:48:29 Z niloyroot Cloud Computing (CEOI18_clo) C++14
100 / 100
 826 ms 2124 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
#define ff first
#define ss second
const ll mod = 1e9 + 7;

struct comp {
    ll c,f,v;
};

bool cmp(comp a, comp b){
    return a.f != b.f ? a.f > b.f : a.v < b.v;
}

void solve(){
    ll n; cin>>n;
    vector<comp> comps;
    comp cp; cp.c=0; cp.f=INT_MAX; cp.v=0; comps.pb(cp);
    ll maxc=0;
    forp(i,1,n){
        cin>>cp.c>>cp.f>>cp.v;
        cp.v*=-1;
        comps.pb(cp);
        maxc+=cp.c;
    }
    ll m; cin>>m;
    forp(i,1,m){
        cin>>cp.c>>cp.f>>cp.v;
        cp.c*=-1;
        comps.pb(cp);
    }
    sort(comps.begin(), comps.end(), cmp);

    ll res=0;
    vi dp(maxc+1, INT64_MIN);
    dp[0]=0;
    forp(i,1,n+m){
        vi dp2 = dp;
        forp(j,0,maxc){
            if(j-comps[i].c>=0 && j-comps[i].c<=maxc && dp[j-comps[i].c]!=INT64_MIN){
                dp2[j]=max(dp2[j],dp[j-comps[i].c]+comps[i].v);
            }
        }
        dp=dp2;
    }

    cout<<*max_element(dp.begin(), dp.end())<<newl;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1; //cin>>t;
    while(t--)solve();
}

Compilation message

clo.cpp: In function 'void solve()':
clo.cpp:42:8: warning: unused variable 'res' [-Wunused-variable]
   42 |     ll res=0;
      |        ^~~

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 45 ms 716 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 208 ms 1228 KB Output is correct
8 Correct 32 ms 552 KB Output is correct
9 Correct 312 ms 1740 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 17 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 352 ms 1228 KB Output is correct
6 Correct 627 ms 1928 KB Output is correct
7 Correct 674 ms 1928 KB Output is correct
8 Correct 686 ms 1868 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 38 ms 716 KB Output is correct
4 Correct 7 ms 332 KB Output is correct
5 Correct 679 ms 1868 KB Output is correct
6 Correct 663 ms 1868 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 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 45 ms 716 KB Output is correct
14 Correct 3 ms 332 KB Output is correct
15 Correct 208 ms 1228 KB Output is correct
16 Correct 32 ms 552 KB Output is correct
17 Correct 312 ms 1740 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 17 ms 332 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 352 ms 1228 KB Output is correct
31 Correct 627 ms 1928 KB Output is correct
32 Correct 674 ms 1928 KB Output is correct
33 Correct 686 ms 1868 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 38 ms 716 KB Output is correct
37 Correct 7 ms 332 KB Output is correct
38 Correct 679 ms 1868 KB Output is correct
39 Correct 663 ms 1868 KB Output is correct
40 Correct 48 ms 716 KB Output is correct
41 Correct 126 ms 972 KB Output is correct
42 Correct 13 ms 484 KB Output is correct
43 Correct 653 ms 2064 KB Output is correct
44 Correct 666 ms 2124 KB Output is correct
45 Correct 826 ms 2124 KB Output is correct
46 Correct 4 ms 332 KB Output is correct
47 Correct 8 ms 524 KB Output is correct
48 Correct 9 ms 460 KB Output is correct