제출 #492405

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
492405		niloyroot	Cloud Computing (CEOI18_clo)	C++14	0 / 100	1 ms	204 KiB

clo

#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]!=INT_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();
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 0 / 18
• Subtask 2: 0 / 18
• Subtask 3: 0 / 18
• Subtask 4: 0 / 18
• Subtask 5: 0 / 18
• Subtask 6: 0 / 10