poj 1837 Balance (01 가방)
Time Limit: 1000MS
Memory Limit: 30000K
Total Submissions: 5729
Accepted: 3419
Description
Gigel has a strange "balance"and he wants to poise it. Actually, the device is different from any other ordinary balance.
It orders two arms of negligible weight and each arm's length is 15. Some hooks are attached to these arms and Gigel wants to hang up some weights from his collection of G weights (1 <= G <= 20) knowing that these weights have distinct values in the range 1..25. Gigel may droop any weight of any hook but he is forced to use all the weights.
Finally, Gigel managed to balance the device using the experience he gained at the National Olympiad in Informatics. Now he would like to know in how many ways the device can be balanced.
Knowing the repartition of the hooks and the set of the weights write a program that calculates the number of possibilities to balance the device.
It is guaranteed that will exist at least one solution for each test case at the evaluation.
Input
The input has the following structure:
• the first line contains the number C (2 <= C <= 20) and the number G (2 <= G <= 20);
• the next line contains C integer numbers (these numbers are also distinct and sorted in ascending order) in the range -15..15 representing the repartition of the hooks; each number represents the position relative to the center of the balance on the X axis (when no weights are attached the device is balanced and lined up to the X axis; the absolute value of the distances represents the distance between the hook and the balance center and the sign of the numbers determines the arm of the balance to which the hook is attached: '-' for the left arm and '+' for the right arm);
• on the next line there are G natural, distinct and sorted in ascending order numbers in the range 1..25 representing the weights' values.
Output
The output contains the number M representing the number of possibilities to poise the balance.
Sample Input
2 4
-2 3
3 4 5 8
Sample Output
2
Source
Romania OI 2002
제목:http://poj.org/problem?id=1837
분석: 이 문제는 직접 폭력 가방을 통과하면 됩니다. 아이템 개수는 C*G, 가방 용량은 0~7500+7500
코드:
#include<cstdio>
#include<cstring>
using namespace std;
const int mm=7500;
int f[2][mm+mm+2];
int h[22],w[22];
int i,j,k,c,g,g1,g2,tmp;
int main()
{
while(scanf("%d%d",&c,&g)!=-1)
{
for(i=0;i<c;++i)scanf("%d",&h[i]);
for(i=0;i<g;++i)scanf("%d",&w[i]);
memset(f[0],0,sizeof(f[0]));
f[0][mm]=1;
for(g1=1,g2=i=0;i<g;++i)
{
g1=!g1,g2=!g2;
memset(f[g2],0,sizeof(f[g2]));
for(j=0;j<mm+mm;++j)
for(k=0;k<c;++k)
{
tmp=j+h[k]*w[i];
if(tmp<0||tmp>=mm+mm)continue;
f[g2][j]+=f[g1][tmp];
}
}
printf("%d
",f[g2][mm]);
}
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
【each 문 중첩 거동】 each 안에 each 안에 each왜 each 안에 each를 넣고 싶어졌는가 하면 이런 식으로 계층의 카테고리 기능을 작성하는 과정에서 필요하다고 생각했습니다. 내용이 이런 느낌으로 어려워지고 있습니다. 카테고리 수는 모두 400 가까이 ... 유...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.