Submission #1222056

#	Time	Username	Problem	Language	Result	Execution time	Memory
1222056		quangminh412	Bank (IZhO14_bank)	C++17	19 / 100	68 ms	12552 KiB

bank

/*
  Ben Watson
  Handle codeforces : quangminh98

  Mua Code nhu mua Florentino !!
*/

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

#define ll long long

const string name = "test";

void solve();
signed main()
{
    if (fopen((name + ".inp").c_str(), "r"))
    {
        freopen((name + ".inp").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    solve();

    return 0;
}

// main program
const int bit = (1 << 20);
const int maxn = 21;

int n, m;
int a[maxn], b[maxn];
int dp[maxn][bit], s[bit];

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];

    for (int mask = 0; mask < (1 << m); mask++)
    {
        dp[0][mask] = 1;
        for (int i = 0; i < m; i++)
            if (mask >> i & 1)
                s[mask] += b[i + 1];
    }
    int full = (1 << m) - 1;
    for (int i = 1; i <= n; i++)
        for (int mask = 0; mask < (1 << m); mask++)
            if (s[mask] == a[i] && dp[i - 1][mask ^ full] == 1)
                dp[i][mask] = 1;

    int res = 0;
    for (int mask = 0; mask < (1 << m); mask++)
        res |= dp[n][mask];

    cout << (res == 1 ? "YES\n" : "NO\n");
}

Compilation message (stderr)

bank.cpp: In function 'int main()':
bank.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen((name + ".inp").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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