NC200532 装货物(DFS)

题目链接

题意：



题解：









AC代码

/*
    Author : zzugzx
    Lang : C++
    Blog : blog.csdn.net/qq_43756519
*/
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define SZ(x) (int)x.size()
#define mem(a, b) memset(a, b, sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1e9 + 7;
//const int mod = 998244353;

const double eps = 1e-6;
const double pi = acos(-1.0);
const int maxn = 1e6 + 10;
const int N = 1e2 + 5;
const ll inf = 0x3f3f3f3f;
const ll oo = 8e18;
const int dir[][2]={{0, 1}, {1, 0}, {0, -1}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
ll b[25], a[25];
int n, x, w;
bool dfs(int now) {
    if (now == n + 1) return 1;
    for (int i = 1; i <= min(x, now); i++) {
        if (b[i] + a[now] > w) continue;
        b[i] += a[now];
        if (dfs(now + 1)) return 1;
        b[i] -= a[now];
    }
    return 0;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
//  freopen("in.txt", "r", stdin);
//  freopen("out.txt", "w", stdout);
    int _;
    cin >> _;
    while (_--) {
        mem(b, 0);
        cin >> n >> x >> w;
        for (int i = 1; i <= n; i++)
            cin >> a[i];
        if (dfs(1)) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    return 0;
}