poj1837——Balance(dp)
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
dp[i][j]를 제i개 분동으로 배치할 때 발생하는 편이량은 제목의 뜻을 얻을 수 있는 한쪽 팔의 가장 많은 무게가 15*25*20=7500이고 수조 아래에 음치가 있을 수 없기 때문에 7500*2보다 작은 수치는 천평이 다른 한쪽으로 이동하는 것을 나타낸다.문제는 균형을 구하는 상황이기 때문에 마지막에 j=7500을 구하는 상황이어야 한다
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int dp[25][16000];
int main()
{
int C,G,c[25],g[25],i,j,k;
while(~scanf("%d%d",&C,&G))
{
for(i=1; i<=C; ++i)
scanf("%d",&c[i]);
for(i=1; i<=G; ++i)
scanf("%d",&g[i]);
memset(dp,0,sizeof(dp));
dp[0][7500]=1;
for(i=1; i<=G; ++i)
for(j=0; j<=15000; ++j)
{
if(dp[i-1][j]) // , i-1 j , i
for(k=1; k<=C; ++k)
dp[i][j+c[k]*g[i]]+=dp[i-1][j];
}
printf("%d
",dp[G][7500]);
}
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
hdu4283 - You Are the One(구간 dp)In order to meet the need of boys who are still single, TJUT hold the show itself. Now there are n boys enrolling in. At...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.