Submission #1182449

#TimeUsernameProblemLanguageResultExecution timeMemory
1182449supercoder2902Cloud Computing (CEOI18_clo)C++20
100 / 100
629 ms2120 KiB
#include <bits/stdc++.h> #define ll long long #define task "" using namespace std; void fre(){ if (fopen(task".INP","r")){ freopen(task".INP","r",stdin); freopen(task".OUT","w",stdout); } } const int N=1e6+5; const ll INF=1e18+5; const int MOD=1e9+7; const int LIM=1e9+5; struct st{ int c; ll f,v; }; int n,m,sum; vector <st> vt; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); fre(); cin>>n; for (int i=1;i<=n;i++){ int c; ll f,v; cin>>c>>f>>v; sum+=c; vt.push_back({c,f,-v}); } cin>>m; for (int i=1;i<=m;i++){ int c,f,v; cin>>c>>f>>v; vt.push_back({-c,f,v}); } sort(vt.begin(),vt.end(),[&](const st &x,const st &y){ return (x.f!=y.f) ? x.f>y.f : x.v<y.v; }); vector <ll> f(sum+1,-INF); f[0]=0; for (st &x:vt){ vector <ll> g(f); for (int j=0;j<=sum;j++){ if (x.c<=j&&j-x.c<=sum&&f[j-x.c]>-INF) g[j]=max(g[j],f[j-x.c]+x.v); } f=g; } cout<<*max_element(f.begin(),f.end()); return 0; }

Compilation message (stderr)

clo.cpp: In function 'void fre()':
clo.cpp:7:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
clo.cpp:8:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |         freopen(task".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...