제출 #1013035

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1013035		vjudge1	은행 (IZhO14_bank)	C++17	27 / 100	1099 ms	3056 KiB

bank

#include<bits/stdc++.h>

// #pragma GCC target("avx2")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;

#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ft first
#define sd second
#define ll long long
#define ull unsigned ll
#define pii pair<int,int>
#define pll pair<ll,ll>
const int N = 1e6 + 10;
const int M = 1e6 + 5;
const int B = 316;
const ll msize = 2;
const ll mod1 = 1e9 + 7;
const ll mod2 = 998244353;
const long double Phi = acos(-1);
const long long inf = 2e18;
const vector <pair<int, int>> dir = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

ll binmul(ll x, ll ti, ll m);
ll binpow(ll x, ll ti, ll m);

ll n, m, a[21], b[21];
bool dp[(1 << 21)][21];

const void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++ i) cin >> a[i];
    for (int i = 1; i <= m; ++ i) cin >> b[i];

    vector <pll> v;
    for (int i = 1; i <= n; ++ i) {
        for (int mask = 0; mask < (1 << m); ++ mask) {
            ll sum = 0;
            for (int j = 0; j < m; ++ j) {
                if (mask & (1 << j)) sum += b[j + 1];
            }
            if (sum == a[i]) v.pb({i, mask});
        }
    }

    dp[0][0] = 1;
    for (auto [id, cur_mask] : v) {
        for (int mask = 0; mask < (1 << m); ++ mask) {
            int intersection = (cur_mask & mask);
            if (!intersection) {
                dp[cur_mask][id] |= dp[mask][id - 1];
            }
        }
    }
    for (int mask = 0; mask < (1 << m); ++ mask) {
        if (dp[mask][n]) {
            cout << "YES\n";
            return;
        }
    }
    cout << "NO\n";
}  

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    srand(time(NULL));

    // file("maze");

    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    int tt = 1;
    // cin >> tt;
    for (int i = 1; i <= tt; ++ i) {
        // cout << "Case " << i << ":\n";
        solve();
    }

    #ifndef ONLINE_JUDGE
    cerr << "\n" << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif

    return 0;
} 


// Template functions
ll binmul(ll x, ll ti, ll m) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= m; res %= m;} return res;}
ll binpow(ll x, ll ti, ll m) { ll res = 1;while (ti){if(ti & 1)(res *= x)%=m;(x*=x)%=m;ti >>= 1; x %= m; res %= m;} return res;}
 

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