Submission #1249312

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249312		Sang	Bank (IZhO14_bank)	C++20	19 / 100	125 ms	8652 KiB

bank

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

#define int long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(), (a).end()
#define task "kbsiudthw"

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<int, ii> pii;

const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 2277;

int n, m, a[N], dp[(1<<20)], b[N];

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    cin >> n >> m;
    FOR (i, 1, n) cin >> a[i], a[i] += a[i - 1];
    FOR (i, 1, m) cin >> b[i];
    dp[0] = 1;
    for (int mask = 0; mask < (1<<m); mask++){
        if (dp[mask] == 0) continue;
        int s= 0;
        FOR (i, 0, m - 1) if ((mask>>i)&1) s += b[i];
        if (s == a[n]) return cout << "YES", 0;
        int pos = n;
        while (a[pos] > s) pos--;
        // a[pos] <= s // pos gần nhất có thể
        FOR (i, 0, m - 1) {
            if ((mask>>i)&1) continue;
            if (s + b[i] > a[pos + 1]) continue;
            dp[mask ^ (1<<i)] = 1;
        }
    }
    cout << "NO";

    return 0;
}

Compilation message (stderr)

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

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