제출 #340560

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
340560		Sprdalo	은행 (IZhO14_bank)	C++17	52 / 100	1095 ms	492 KiB

bank

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pi> vp;
typedef vector<pl> vpl;

int a[21], b[21];
int n, m;

void ye(){
    cout << "YES\n";
    exit(0);
}

void solve(int x, int suma, int mask, int j){
    if (x>n) ye();

    if (!suma){
        solve(x+1,a[x+1], mask,0);
        return;
    }

    int cnt = __builtin_popcount(mask);
    if (m-cnt-1 < x-n) return;
    for (int i = j; i < m; ++i){
        if (m-cnt-1 < x-n) break;
        if ((mask&(1 << i)) || b[i] > suma) continue;
        solve(x, suma-b[i], mask^(1<<i),j+1); 
    }
}

signed main()
{
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr); 
    cout.tie(nullptr); 
    cerr.tie(nullptr);    

    cin >> n >> m;

    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    for (int i = 0; i < m; ++i)
        cin >> b[i];

    solve(1, a[1], 0, 0);

    cout << "NO\n";
}

• Subtask 1: 0 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 0 / 29