Submission #900166

#	Time	Username	Problem	Language	Result	Execution time	Memory
900166		mariaclara	Bank (IZhO14_bank)	C++17	100 / 100	80 ms	8656 KiB

bank

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = (1<<20)+5;
#define all(x) x.begin(), x.end()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

int n, m, a[25], b[25], prefix[25], dp[MAXN], sum[MAXN];
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m;

    for(int i = 1; i <= n; i++)
        cin >> a[i], prefix[i] = prefix[i-1] + a[i];

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

    for(int mask = 1; mask < (1<<m); mask++) {
        for(int j = 0; j < m; j++) {
            if(((1<<j) & mask) == 0) continue;
            sum[mask] = sum[mask - (1<<j)] + b[j+1];
            dp[mask] = max(dp[mask], dp[mask - (1<<j)]);
        }
        if(sum[mask] == prefix[dp[mask]+1]) dp[mask]++;
    }

    if(dp[(1<<m) - 1] == n) cout << "YES\n";
    else cout << "NO\n";
}

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