Submission #1314694

#	Time	Username	Problem	Language	Result	Execution time	Memory
1314694		otarius	Bank (IZhO14_bank)	C++20	19 / 100	66 ms	8628 KiB

bank

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;

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

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngl(chrono::steady_clock::now().time_since_epoch().count());

#define int long long
// #define int unsigned long long

// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>

const ll mod = 1e9 + 9;
// const ll mod = 998244353;

const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 4 * 1e5 + 15;

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

    int dp[1 << m]; dp[0] = 0;
    for (int i = 1; i < (1 << m); i++) dp[i] = -inf;

    int cur = 0;
    for (int i = 0; i < n; i++) {
        cur += a[i];
        for (int msk = 0; msk < (1 << m); msk++) {
            for (int j = 0; j < m; j++) {
                if ((msk >> j) % 2 == 1) continue;
                dp[msk | (1 << j)] = dp[msk] + b[j];
            }
        }

        for (int msk = 0; msk < (1 << m); msk++)
            if (dp[msk] != cur) dp[msk] = -inf;
    }

    for (int msk = 0; msk < (1 << m); msk++)
        if (dp[msk] != -inf) { cout << "YES"; return; }
    cout << "NO";
}

int32_t main() {
// #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
// #endif
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        cout << '\n';
    }

    return 0;
}

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