Time Limit: 1 Sec
Memory Limit: 256 MB
题目连接
http://acm.hdu.edu.cn/showproblem.php?pid=5445
Description
Few days before a game of orienteering, Bell came to a mathematician to solve a big problem. Bell is preparing the dessert for the game. There are several different types of desserts such as small cookies, little grasshoppers and tiny mantises. Every type of dessert may provide different amounts of energy, and they all take up different size of space.
Other than obtaining the desserts, Bell also needs to consider moving them to the game arena. Different trucks may carry different amounts of desserts in size and of course they have different costs. However, you may split a single dessert into several parts and put them on different trucks, then assemble the parts at the game arena. Note that a dessert does not provide any energy if some part of it is missing.
Bell wants to know how much would it cost at least to provide desserts of a total energy of p (most of the desserts are not bought with money, so we assume obtaining the desserts costs no money, only the cost of transportation should be considered). Unfortunately the mathematician is having trouble with her stomach, so this problem is left to you.
Input
The first line of input contains a integer T(T≤10) representing the number of test cases.
For each test case there are three integers n,m,p on the first line (1≤n≤200,1≤m≤200,0≤p≤50000), representing the number of different desserts, the number of different trucks and the least energy required respectively.
The i−th of the n following lines contains three integers ti,ui,vi(1≤ti≤100,1≤ui≤100,1≤vi≤100) indicating that the i−th dessert can provide ti energy, takes up space of size ui and that Bell can prepare at most vi of them.
On each of the next m lines, there are also three integers xj,yj,zj(1≤xj≤100,1≤yj≤100,1≤zj≤100) indicating that the j−th truck can carry at most size of xj , hiring each one costs yj and that Bell can hire at most zj of them.
For every test case output the minimum cost to provide the dessert of enough energy in the game arena if it is possible and its cost is no more than 50000. Otherwise, output TAT on the line instead.
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <string>
#include <ctime>
#include <list>
#include <bitset>
typedef unsigned char byte;
#define pb push_back
#define input_fast std::ios::sync_with_stdio(false);std::cin.tie(0)
#define local freopen("in.txt","r",stdin)
#define pi acos(-1)
using namespace std;
const int maxn = 200 + 15;
struct item
{
int val , size;
};
struct item2
{
int size , cost;
};
int n , m , p ,sz[maxn],dp1[50000+500],sz2[maxn],dp2[50000+500];
item2 B[maxn][55] ;
item A[maxn][55];
void initiation()
{
memset( sz , 0 ,sizeof(sz));
memset( sz2,0,sizeof(sz2));
scanf("%d%d%d",&n,&m,&p);
for(int i = 1 ; i <= n ; ++ i)
{
int v , sq , number , cot = 0;
scanf("%d%d%d",&v,&sq,&number);
for(int j = 1 ; ; j <<= 1)
{
if(cot + j > number)
{
int dcv = number - cot;
if(dcv != 0)
{
A[i][sz[i]].val = dcv*v;
A[i][sz[i]].size = dcv*sq;
sz[i]++;
}
break;
}
A[i][sz[i]].val = v*j;
A[i][sz[i]].size = sq*j;
sz[i]++;
cot += j;
}
}
for(int i = 1 ; i <= m ; ++ i)
{
int v , sq , number , cot = 0;
scanf("%d%d%d",&v,&sq,&number);
for(int j = 1 ; ; j <<= 1)
{
if(cot + j > number)
{
int dcv = number - cot;
if(dcv != 0)
{
B[i][sz2[i]].size = dcv*v;
B[i][sz2[i]].cost = dcv*sq;
sz2[i]++;
}
break;
}
B[i][sz2[i]].size = v*j;
B[i][sz2[i]].cost = sq*j;
sz2[i]++;
cot += j;
}
}
}
inline void updata(int & x,int v)
{
x = min(x , v);
}
inline void updata2(int & x,int v)
{
x = max(x , v);
}
void solve()
{
memset(dp1,0x3f,sizeof(dp1));dp1[0] = 0;
int error = dp1[1];
for(int i = 1 ; i <= n ; ++ i)
{
for(int z = 0 ; z < sz[i] ; ++ z)
{
for(int j = p - 1 ; j >= 0 ; -- j)
{
if(dp1[j] == error ) continue;
int newj = j + A[i][z].val;
int newcost = dp1[j] + A[i][z].size;
if(newj >= p ) newj=p;
updata(dp1[newj],newcost);
}
}
}
if(dp1[p] == error)
{
printf("TAT\n");
return;
}
int need = dp1[p];
memset(dp2,0,sizeof(dp2));
for(int i = 1 ; i <= m ; ++ i)
{
for(int z = 0 ; z < sz2[i] ; ++ z)
{
int cost = B[i][z].cost;
int size = B[i][z].size;
for(int j = 5e4 ; j >= cost ; -- j) updata2(dp2[j] , dp2[j-cost] + size);
}
}
int ans = -1;
for(int i = 0 ; i <= 5e4 ; ++ i)
{
if(dp2[i] >= need)
{
ans = i;
break;
}
}
if(~ans) printf("%d\n",ans);
else printf("TAT\n");
}
int main(int argc,char *argv[])
{
int Case;
scanf("%d",&Case);
while(Case--)
{
initiation();
solve();
}
return 0;
}
