| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1001496 | vjudge1 | 은행 (IZhO14_bank) | C++17 | 82 ms | 16988 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define el cout << '\n'
#define f1(i,n) for(ll i=1;i<=n;i++)
#define __file_name ""
using namespace std;
const ll maxn = 22, inf=1e18;
ll n,m,a[maxn],b[maxn],dp[(1 << 21) + 10], sum[(1 << 21) + 10];
bool nxt[(1 << 21) + 10];
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    if(fopen(__file_name ".inp", "r")){
        freopen(__file_name ".inp","r",stdin);
        freopen(__file_name ".out","w",stdout);
    }
    // code here
    cin >> n >> m;
    f1(i,n) cin >> a[i];
    f1(i,m) cin >> b[i];
    for(ll mask=0;mask<(1 << m);mask++){
        dp[mask] = -inf;
        sum[mask] = -inf;
    }
    dp[0] = 0;
    sum[0] = 0;
    for(ll mask=0;mask<(1 << m);mask++){
        for(ll j=0;j<m;j++){
            if(mask & (1 << j)){
                if(sum[mask ^ (1 << j)] + b[j+1] == a[dp[mask ^ (1 << j)] + 1]){
                    if(dp[mask] < dp[mask ^ (1 << j)] + 1){
                        dp[mask] = dp[mask ^ (1 << j)] + 1;
                        sum[mask] = 0;
                    }
                }else{
                    if(dp[mask] < dp[mask ^ (1 << j)]){
                        dp[mask] = dp[mask ^ (1 << j)];
                        sum[mask] = sum[mask ^ (1 << j)] + b[j+1];
                    }
                }
            }
        }
    }
    if(*max_element(dp, dp+(1 << m)) == n) cout << "YES";
    else cout << "NO";
    /*
    f1(i,n){
        for(ll mask = 0;mask<(1 << m);mask++){
            if(sum[mask] == a[i]){
                nxt[mask] = 1;
                continue;
            }
            for(ll j=0;j<m;j++){
                if(mask & (1 << j)){
                    nxt[mask] |= nxt[mask ^ (1 << j)];
                }
            }
        }
        for(ll mask=0;mask<(1 << m);mask++){
            dp[mask] = dp[mask] + nxt[mask];
            nxt[mask] = 0;
        }
    }
    for(ll mask=0;mask<(1 << m);mask++){
        if(dp[mask] == n){
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
    */
    return 0;
}
/*
Code by: Nguyen Viet Trung Nhan
Cau Giay Secondary School
*/
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
