oj.uz

Submission #858552

# Submission time Handle Problem Language Result Execution time Memory
858552 2023-10-08T17:50:39 Z noyancanturk Bank (IZhO14_bank) C++17
100 / 100
 101 ms 16848 KB 
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define lim 100000
using namespace std;
const int mod=1000000007ll;

void solve(){
    int n,m;
    cin>>n>>m;
    int a[n],b[m];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    for(int i=0;i<m;i++){
        cin>>b[i];
    }
    pair<int,int>dp[1<<m];
    dp[0]={0,0};
    for(int i=1;i<(1<<m);i++){
        dp[i]={-1,INT_MAX};
        for(int j=0;j<m;j++){
            if(i&(1<<j)){
                dp[i]=max(dp[i],{dp[i-(1<<j)].first,dp[i-(1<<j)].second+b[j]});
                //cerr<<"set "<<i<<" "<<j<<" "<<(i-(1<<j))<<"\n";
            }
        }
        if(i!=n&&dp[i].second==a[dp[i].first]){
            dp[i].first++;
            dp[i].second=0;
        }
    }
    /*
    for(int i=0;i<(1<<m);i++){
        cerr<<dp[i].first<<" "<<dp[i].second<<"\n";
    }
    */
    if(dp[(1<<m)-1].first==n){
        cout<<"YES\n";
    }else{
        cout<<"NO\n";
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
#ifdef Local  
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 86 ms 16844 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 89 ms 16732 KB Output is correct
9 Correct 88 ms 16732 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 452 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 708 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 2 ms 708 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 86 ms 16844 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 89 ms 16732 KB Output is correct
9 Correct 88 ms 16732 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 452 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 1 ms 708 KB Output is correct
24 Correct 1 ms 856 KB Output is correct
25 Correct 2 ms 708 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 86 ms 16848 KB Output is correct
32 Correct 86 ms 16732 KB Output is correct
33 Correct 92 ms 16732 KB Output is correct
34 Correct 95 ms 16848 KB Output is correct
35 Correct 92 ms 16844 KB Output is correct
36 Correct 89 ms 16728 KB Output is correct
37 Correct 87 ms 16728 KB Output is correct
38 Correct 91 ms 16732 KB Output is correct
39 Correct 89 ms 16844 KB Output is correct
40 Correct 87 ms 16844 KB Output is correct
41 Correct 88 ms 16844 KB Output is correct
42 Correct 99 ms 16844 KB Output is correct
43 Correct 98 ms 16732 KB Output is correct
44 Correct 86 ms 16844 KB Output is correct
45 Correct 101 ms 16840 KB Output is correct
46 Correct 95 ms 16836 KB Output is correct
47 Correct 85 ms 16728 KB Output is correct
48 Correct 88 ms 16728 KB Output is correct
49 Correct 88 ms 16728 KB Output is correct
50 Correct 88 ms 16844 KB Output is correct
51 Correct 92 ms 16732 KB Output is correct
52 Correct 89 ms 16732 KB Output is correct
53 Correct 88 ms 16732 KB Output is correct
54 Correct 100 ms 16732 KB Output is correct
55 Correct 84 ms 16844 KB Output is correct
56 Correct 94 ms 16728 KB Output is correct
57 Correct 101 ms 16728 KB Output is correct
58 Correct 89 ms 16732 KB Output is correct