1068 Find More Coins
分数 30
作者 CHEN, Yue
单位 浙江大学
Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she must pay the exact amount. Since she has as many as 104 coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find some coins to pay for it.
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive numbers: N
(≤104, the total number of coins) and M
(≤102, the amount of money Eva has to pay). The second line contains N
face values of the coins, which are all positive numbers. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the face values V1≤V2≤⋯≤Vk such that V1+V2+⋯+Vk=M
. All the numbers must be separated by a space, and there must be no extra space at the end of the line. If such a solution is not unique, output the smallest sequence. If there is no solution, output "No Solution" instead.
Note: sequence {A[1], A[2], ...} is said to be "smaller" than sequence {B[1], B[2], ...} if there exists k≥1 such that A[i]=B[i] for all i<k, and A[k] < B[k].
Sample Input 1:
8 9
5 9 8 7 2 3 4 1
Sample Output 1:
1 3 5
Sample Input 2:
4 8
7 2 4 3
Sample Output 2:
No Solution
动态规划:
#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
const int N = 1e4+10, M = 110;
int dp[N][M], choose[N][M];
int w[N];
multiset<int> mst;
//注意mst应该用multiset存储结果,而不能用set存储结果,因为结果可能可能具有相同的值
int main()
{
int n, m;
cin >> n >> m;
for(int i=1; i<=n; ++i)
cin >> w[i];
//价值应该从大到小排序,因为有多个解时,输入最小的字典序,而价值按照从小到大
//排序,则得到的是最大字典序;
sort(w+1, w+n+1, greater<int>());
for(int i=1; i<=n; ++i)
for(int j=0; j<=m; ++j)
{
dp[i][j] = dp[i-1][j]; //不存第i件物品
if(j >= w[i] && dp[i-1][j-w[i]] + w[i] >= dp[i][j])
{
dp[i][j] = dp[i-1][j-w[i]] + w[i]; //取第i件物品
choose[i][j] = 1;
}
}
//如果存在结果,则dp[n][m] == m
if(dp[n][m] != m) puts("No Solution");
else
{
int i=n, j=m;
while(j > 0)
{
if(choose[i][j] == 1)
{
mst.insert(w[i]); //mst直接存答案
j -= w[i];
}
--i;
}
bool spa = true;
for(auto ele : mst)
{
if(spa) spa = false;
else cout << ' ';
cout << ele;
}
}
return 0;
}
DFS:
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
using namespace std;
const int N = 1e4+10, M = 110;
int dp[N][M], choose[N][M];
int w[N];
vector<int> path, temp;
int n, m;
void DFS(int idx, int sum)
{
if(sum > m || !path.empty())
return;
if(sum == m && path.empty())
{
path = temp;
return;
}
for(int i=idx; i<n; ++i)
{
temp.push_back(i);
DFS(i+1, sum + w[i]);
temp.pop_back();
}
}
int main()
{
cin >> n >> m;
int idx = 0, sum=0;
for(int i=0; i<n; ++i)
{
cin >> w[i];
sum += w[i];
if(w[i] <= m) w[idx++] = w[i];
}
n = idx;
if(sum < m)
{
puts("No Solution");
return 0;
}
sort(w, w+n);
DFS(0, 0);
if(path.empty()) puts("No Solution");
else
{
bool spa = true;
for(auto ele : path)
{
if(spa) spa = false;
else cout << ' ';
cout << w[ele];
}
}
return 0;
}