Investment
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1196 Accepted Submission(s): 528
Problem Description
John never knew he had a grand-uncle, until he received the notary’s letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that John was the only inheritor.
John did not need that much money for the moment. But he realized that it would be a good idea to store this capital in a safe place, and have it grow until he decided to retire. The bank convinced him that a certain kind of bond was interesting for him.
This kind of bond has a fixed value, and gives a fixed amount of yearly interest, payed to the owner at the end of each year. The bond has no fixed term. Bonds are available in different sizes. The larger ones usually give a better interest. Soon John realized that the optimal set of bonds to buy was not trivial to figure out. Moreover, after a few years his capital would have grown, and the schedule had to be re-evaluated.
Assume the following bonds are available:
Value Annual interest
4000 400
3000 250
With a capital of 10 000 one could buy two bonds of 4 000 , giving a yearly interest of 800 . Buying two bonds of 3 000 , and one of 4 000 is a better idea, as it gives a yearly interest of 900 . After two years the capital has grown to 11 800 , and it makes sense to sell a 3 000 one and buy a 4 000 one, so the annual interest grows to 1 050 . This is where this story grows unlikely: the bank does not charge for buying and selling bonds. Next year the total sum is 12 850 , which allows for three times 4 000 , giving a yearly interest of 1 200 .
Here is your problem: given an amount to begin with, a number of years, and a set of bonds with their values and interests, find out how big the amount may grow in the given period, using the best schedule for buying and selling bonds.
John did not need that much money for the moment. But he realized that it would be a good idea to store this capital in a safe place, and have it grow until he decided to retire. The bank convinced him that a certain kind of bond was interesting for him.
This kind of bond has a fixed value, and gives a fixed amount of yearly interest, payed to the owner at the end of each year. The bond has no fixed term. Bonds are available in different sizes. The larger ones usually give a better interest. Soon John realized that the optimal set of bonds to buy was not trivial to figure out. Moreover, after a few years his capital would have grown, and the schedule had to be re-evaluated.
Assume the following bonds are available:
Value Annual interest
4000 400
3000 250
With a capital of 10 000 one could buy two bonds of 4 000 , giving a yearly interest of 800 . Buying two bonds of 3 000 , and one of 4 000 is a better idea, as it gives a yearly interest of 900 . After two years the capital has grown to 11 800 , and it makes sense to sell a 3 000 one and buy a 4 000 one, so the annual interest grows to 1 050 . This is where this story grows unlikely: the bank does not charge for buying and selling bonds. Next year the total sum is 12 850 , which allows for three times 4 000 , giving a yearly interest of 1 200 .
Here is your problem: given an amount to begin with, a number of years, and a set of bonds with their values and interests, find out how big the amount may grow in the given period, using the best schedule for buying and selling bonds.
Input
The first line contains a single positive integer N which is the number of test cases. The test cases follow.
The first line of a test case contains two positive integers: the amount to start with (at most 1 000 000 ), and the number of years the capital may grow (at most 40).
The following line contains a single number: the number d (1 <= d <= 10) of available bonds.
The next d lines each contain the description of a bond. The description of a bond consists of two positive integers: the value of the bond, and the yearly interest for that bond. The value of a bond is always a multiple of $1 000. The interest of a bond is never more than 10% of its value.
The first line of a test case contains two positive integers: the amount to start with (at most 1 000 000 ), and the number of years the capital may grow (at most 40).
The following line contains a single number: the number d (1 <= d <= 10) of available bonds.
The next d lines each contain the description of a bond. The description of a bond consists of two positive integers: the value of the bond, and the yearly interest for that bond. The value of a bond is always a multiple of $1 000. The interest of a bond is never more than 10% of its value.
Output
For each test case, output – on a separate line – the capital at the end of the period, after an optimal schedule of buying and selling.
Sample Input
1 10000 4 2 4000 400 3000 250
Sample Output
14050
Source
Recommend
wangye
题意:给一定的钱W去投资,问在T年之后能得到的最大钱数为多少(包括本金)
题目一看就是完全背包,从 题目投资的每笔钱数必是1000的n倍可以得到信息要将数组范围缩小1000倍,如果开1000000的数组绝对TLE+MLE,自己做的时候思路对了,但是却谜之TLE,改了半天才AC,自己还是太菜,= =
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<utility>
#include<cmath>
using namespace std;
#define sf scanf
#define pf printf
int dp[500001],T,m,n,W,t,a[20],b[20];//刚开始二维dp写的,先TLE,再WA,可能是自己数组开小了,改成一维就敢开大了
int main()
{
sf("%d",&T);
while(T--)
{
sf("%d%d",&W,&t);
sf("%d",&n);
for(int i=0;i<n;i++)
sf("%d%d",&a[i],&b[i]),a[i]/=1000;//根据题意可以将投资需要的金额除以1000得到的仍是整数
int tem=W/1000;//能用来投资的钱
for(int i=1;i<=t;i++)
{
memset(dp,0,sizeof dp);//完全背包
for(int j=0;j<n;j++)
for(int k=a[j];k<=tem;k++)
{
dp[k]=max(dp[k],dp[k-a[j]]+b[j]);
}
W+=dp[tem];//这一年下来能用于下一年投资的总钱数
tem=W/1000;//下一年能用于投资的钱
}
pf("%d\n",W);
}
return 0;
}