PTA甲级 1068 Find More Coins (C++)

最新推荐文章于 2022-08-14 08:08:45 发布

负反馈循环

最新推荐文章于 2022-08-14 08:08:45 发布

阅读量161

点赞数

分类专栏： PTA 文章标签： c++ oj系统

本文链接：https://blog.csdn.net/qq_43659183/article/details/119837171

版权

PTA 专栏收录该内容

148 篇文章 2 订阅

订阅专栏

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 $10^4$ 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 ( $10^4$ , the total number of coins) and M ( $10^2$ , 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 $V_1≤V_2≤⋯≤V_k$ such that $V_1+V_2+⋯+V_k=$ 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 \geq 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

Caution:

DFS，但是要注意剪枝，尤其是遇到重复的数据，最后一个测试点里面应该是有很多这样的数据。

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-21 10:26:32
// All rights reserved.

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int n;
bool flags[10010] = {false};
int coins[10010];
bool hasAns = false;

void dfs(int sum, int idx, vector<int>& tmp){

    for(int i = idx + 1; i < n && !hasAns && coins[i] <= sum; ++i){
        
        if(i >= 1 && coins[i] == coins[i - 1] && flags[i - 1] == false) continue;

        if(coins[i] == sum){
            for(int i = 0; i < tmp.size(); ++i) printf("%d ", tmp[i]);
            printf("%d\n", coins[i]);

            hasAns = true;
            return;
        }

        else{
            tmp.push_back(coins[i]);
            flags[i] = true;

            dfs(sum - coins[i], i, tmp);

            tmp.pop_back();
            flags[i] = false;
        }
    }

    return;
}


int main(){
    int m;

    scanf("%d %d", &n, &m);

    for(int i = 0; i < n; ++i) scanf("%d", &coins[i]);
    sort(coins, coins + n);

    vector<int> tmp;

    dfs(m, -1, tmp);
    if(!hasAns) printf("No Solution\n");

    return 0;
}