Investment
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
题目大意:
某人意外获得了一笔钱,希望将钱存入银行n年并获得利息。银行提供d种存款方案,每笔存款在年末获得利息(可以存入银行以获得第二年的利息)并且每次存入的款数都是1000的倍数。问此人最多获得多少钱。
一个典型的完全背包问题,以钱数为容量,存款方案的本金为物品体积,利息为价值。但是,由于存款数额较大,直接处理会导致TLE,好在所有存款数是1000的倍数,所以可以将其进行数据压缩。即每一次处理时将总钱数和本金都除以1000(对结果无影响),但是,每次的钱数要单独计算,否则会产生误差。
附AC代码:
#include
#include
using namespace std;
struct node {
int val, ani;
};
int main(int argc, const char * argv[]) {
int n, ans;
scanf("%d" , &n);
int a, m, d;
node s[11];
int val[1000002];
while (n--) {
memset(val , 0 , sizeof(val));
scanf("%d %d" , &a, &m);
scanf("%d" , &d);
ans = a;
a /= 1000;
for (int i = 0; i < d; i++) {
scanf("%d %d" , &s[i].val, &s[i].ani);
s[i].val /= 1000;
}
for (int k = 0; k < m; k++) {
for (int i = 0; i < d; i++)
for (int j = s[i].val; j <= a; j++)
val[j] = max(val[j] , val[j - s[i].val] + s[i].ani);
ans += val[a];
a = (ans / 1000);
memset(val , 0 , sizeof(val));
}
printf("%d\n", ans);
}
return 0;
}