Investment
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 7041 | Accepted: 2447 |
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:
With a capital of e10 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 3000 | 400 250 |
With a capital of e10 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
Northwestern Europe 2004
题意:
题意:
John突然暴富,要将很多钱存到银行,银行里的利息是有一下规定:思路:
1.存钱一年后返还本息,第二年可重新购买债券
2.每份 债券有不超过债券价值10%的利息
3.同份债券可买多份
4.每份债券的价值都是1000的倍数
要求以最好的安排购买债券,使获利最大。
完全背包注意点:
1.单份债券价值和本金相差太多,第二层价值循环可能会花很长时间,而债券又恰好是1000的倍数,可以考虑将债券和本金都除以1000。
2.DP的数组该开多大?
考虑极端情况,若将1000000全部买到利息为10%的债券,且每年都是如此,一年可增长到110%,最多40年,即:
1000000*1.1^40约等于45259255,且将本息除以1000,即将数组开到46000为合理
/*************************************************************************
> File Name: BB.cpp
> Author: BSlin
> Mail:
> Created Time: 2013年10月02日 星期三 09时28分07秒
************************************************************************/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <iterator>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#define MP make_pair
#define INF (1<<30)
#define PI acos(-1.0)
#define esp 1e-8
const int dx[4]={0,0,0,0};
using namespace std;
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#if defined (_WIN32) || defined (__WIN32) || defined (WIN32) || defined (__WIN32__)
#define LL __int64
#define LLS "%" "I" "6" "4" "d"
#else
#define LL long long
#define LLS "%" "l" "l" "d"
#endif
struct node {
int value,interest;
}bond[15];
int dp[46010];
int max(int a, int b) {
return a>b?a:b;
}
int main(int argc, char** argv) {
//read;
int t,capital,year,n,value,interest,ans;
scanf("%d",&t);
while(t--) {
memset(dp,0,sizeof(dp));
scanf("%d%d%d",&capital,&year,&n);
ans = capital;
for(int i=0; i<n; i++) {
scanf("%d%d",&value,&interest);
bond[i].value = value / 1000;
bond[i].interest = interest;
}
for(int i=0; i<n; i++) {
for(int j=bond[i].value; j<=46000; j++) {
dp[j] = max(dp[j],dp[j-bond[i].value] + bond[i].interest);
}
}
for(int yy=0; yy<year; yy++) {
capital /= 1000;
ans += dp[capital];
capital = ans;
}
printf("%d\n",capital);
}
return 0;
}