poj 1276 Cash Machine(다중 가방 + 배율)
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 17441
Accepted: 6038
Description
A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k=1,N, and for each denomination Dk the machine has a supply of nk bills. For example,
N=3, n1=10, D1=100, n2=4, D2=50, n3=5, D3=10
means the machine has a supply of 10 bills of @100 each, 4 bills of @50 each, and 5 bills of @10 each.
Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash less than or equal to cash that can be effectively delivered according to the available bill supply of the machine.
Notes:
@ is the symbol of the currency delivered by the machine. For instance, @ may stand for dollar, euro, pound etc.
Input
The program input is from standard input. Each data set in the input stands for a particular transaction and has the format:
cash N n1 D1 n2 D2 ... nN DN
where 0 <= cash <= 100000 is the amount of cash requested, 0 <=N <= 10 is the number of bill denominations and 0 <= nk <= 1000 is the number of available bills for the Dk denomination, 1 <= Dk <= 1000, k=1,N. White spaces can occur freely between the numbers in the input. The input data are correct.
Output
For each set of data the program prints the result to the standard output on a separate line as shown in the examples below.
Sample Input
735 3 4 125 6 5 3 350
633 4 500 30 6 100 1 5 0 1
735 0
0 3 10 100 10 50 10 10
Sample Output 735
630
0
0
Hint The first data set designates a transaction where the amount of cash requested is @735. The machine contains 3 bill denominations: 4 bills of @125, 6 bills of @5, and 3 bills of @350. The machine can deliver the exact amount of requested cash.
In the second case the bill supply of the machine does not fit the exact amount of cash requested. The maximum cash that can be delivered is @630. Notice that there can be several possibilities to combine the bills in the machine for matching the delivered cash.
In the third case the machine is empty and no cash is delivered. In the fourth case the amount of cash requested is @0 and, therefore, the machine delivers no cash.
Source
Southeastern Europe 2002
제목:http://poj.org/problem?id=1276
분석: 이 문제는 다중배낭+배증 최적화된 템플릿 문제입니다. 할 말이 없습니다.
코드:
#include<cstdio>
using namespace std;
const int mm=111111;
const int mn=1111;
int d[mn],s[mn];
int n,m;
bool f[mm];
void CompletePack(int v)
{
for(int i=v;i<=m;++i)f[i]|=f[i-v];
}
void ZeroOnePack(int v)
{
for(int i=m;i>=v;--i)f[i]|=f[i-v];
}
int main()
{
int i,j;
while(scanf("%d%d",&m,&n)!=-1)
{
for(i=0;i<n;++i)scanf("%d%d",&s[i],&d[i]);
for(i=f[0]=1;i<=m;++i)f[i]=0;
for(i=0;i<n;++i)
if(s[i])
if(s[i]*d[i]>=m)CompletePack(d[i]);
else
{
j=1;
while(j<s[i])
{
ZeroOnePack(d[i]*j);
s[i]-=j;
j<<=1;
}
ZeroOnePack(d[i]*s[i]);
}
while(!f[m])--m;
printf("%d
",m);
}
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
less 명령으로 파일을 다시 씁니다.less 명령이란? 텍스트 파일을 한 화면에 표시하는 명령less /var/log/messages 에서 messages 로그 파일을 확인할 수 있습니다. 대체로 확인할 때 less 를 사용하는 것이 많을까 생각합니다...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.