# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223080 | MKopchev | Cloud Computing (CEOI18_clo) | C++14 | 851 ms | 2168 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;
const int MX=50*2000+42,nmax=2e3+42;
const long long inf=1e18;
struct comp
{
int cores,rate,gain;
};
comp inp[nmax*2];
int n,m;
long long dp[2][MX];
void my_clean(int id)
{
for(int i=0;i<MX;i++)
dp[id][i]=-inf;
}
void add(int which)
{
//ignore
for(int i=0;i<MX;i++)
dp[which&1][i]=dp[!(which&1)][i];
//take
for(int i=0;i<MX;i++)
{
int would=i+inp[which].cores;
if(0<=would&&would<MX)dp[which&1][would]=max(dp[which&1][would],dp[!(which&1)][i]+inp[which].gain);
}
}
bool cmp(comp a,comp b)
{
if(a.rate!=b.rate)return a.rate>b.rate;
return a.cores>b.cores;
}
int main()
{
scanf("%i",&n);
for(int i=1;i<=n;i++)
{
scanf("%i%i%i",&inp[i].cores,&inp[i].rate,&inp[i].gain);
inp[i].gain=-inp[i].gain;
}
my_clean(0);
my_clean(1);
dp[0][0]=0;
scanf("%i",&m);
for(int i=n+1;i<=n+m;i++)
{
scanf("%i%i%i",&inp[i].cores,&inp[i].rate,&inp[i].gain);
inp[i].cores=-inp[i].cores;
}
n=n+m;
sort(inp+1,inp+n+1,cmp);
for(int i=1;i<=n;i++)
add(i);
long long output=0;
for(int i=0;i<MX;i++)
output=max(output,dp[n%2][i]);
printf("%lld\n",output);
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... |