| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1001491 | vjudge1 | Bank (IZhO14_bank) | C++17 | 60 ms | 4688 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 all(v) begin(v), end(v)
#define pi pair<int, int>
#define vi vector<int>
#define task "test"
using namespace std;
int a[20], b[20], dp[(1<<20) +2];
int main(){
    if(fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n,m,max1,sum,i,j;
    cin>>n>>m;
    for(i=0;i<n;i++) {
        cin>>a[i];
        if(i) a[i]+=a[i-1];
    }
    for (i=0;i<m;i++)
        cin>>b[i];
    for(i=0;i<(1<<m);i++) {
        max1=-1;sum=0;
        for(j=0;j<m;j++){
            if(i&(1<<j)){
                sum+=b[j];
                max1=max(max1,dp[i^(1<<j)]);
            }
        }
        dp[i]=max1;
        if(sum==a[max1+1]) dp[i]++;
        if(dp[i]==n-1){
            cout<<"YES";
            return 0;
        }
    }
    cout <<"NO";    
    return 0;
}
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... | ||||
