| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 926761 | doducanh | Cloud Computing (CEOI18_clo) | C++14 | 456 ms | 7000 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxx=-1e18-7;
struct compu
{
int c,f,w;
};
bool cmp(compu a, compu b)
{
return (a.f>b.f||(a.f==b.f&&a.w<a.w));
}
vector<compu>v;
int dp[5000005];
int dq[5000005];
int n,q;
main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
int s=0;
for(int i=1;i<=n;i++){
int c,f,w;
cin>>c>>f>>w;
s+=c;
v.push_back({c,f,-w});
}
cin>>q;
for(int i=1;i<=q;i++){
int c,f,w;
cin>>c>>f>>w;
v.push_back({-c,f,w});
}
sort(v.begin(),v.end(),cmp);
for(int i=0;i<=s;i++)dp[i]=maxx;
for(int i=0;i<=s;i++)dq[i]=maxx;
dp[0]=0;
dq[0]=0;
for(int i=0;i<v.size();i++){
for(int j=0;j<=s;j++) {
int pre=j-v[i].c;
if(0<=pre&&pre<=s&&dp[pre]!=maxx)dq[j]=max(dq[j],dp[pre]+v[i].w);
}
for(int j=0;j<=s;j++)dp[j]=dq[j];
}
int res=0;
for(int i=0;i<=s;i++)res=max({res,dp[i],dq[i]});
cout<<res;
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
