oj.uz

Submission #936346

# Submission time Handle Problem Language Result Execution time Memory
936346 2024-03-01T16:29:52 Z noyancanturk Bank (IZhO14_bank) C++17
100 / 100
 28 ms 25176 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];
    }
    int dp[1<<m],left[1<<m];
    int lll[1<<m];
    for(int i=0;i<m;i++){
        lll[1<<i]=i;
    }
    dp[0]=left[0]=0;
    for(int i=1;i<(1<<m);i++){
        dp[i]=-1;
        left[i]=INT_MAX;
        int j=i;
        while(j){
            int k=j&-j;
            j^=k;
            if(dp[i]<dp[i^k]){
                dp[i]=dp[i^k];
                left[i]=left[i^k]+b[lll[k]];
                if(left[i]<=a[dp[i]])break;
            }
        }
        if(i!=n&&left[i]==a[dp[i]]){
            dp[i]++;
            left[i]=0;
        }
    }
    /*
    for(int i=0;i<(1<<m);i++){
        cerr<<dp[i].first<<" "<<dp[i].second<<"\n";
    }
    */
    if(dp[(1<<m)-1]==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","r",stdin);
    freopen(".out","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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 28 ms 25072 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 20 ms 24924 KB Output is correct
9 Correct 17 ms 25160 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 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 1 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 28 ms 25072 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 20 ms 24924 KB Output is correct
9 Correct 17 ms 25160 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 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 1 ms 600 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 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 22 ms 24848 KB Output is correct
32 Correct 17 ms 24924 KB Output is correct
33 Correct 26 ms 24924 KB Output is correct
34 Correct 27 ms 25072 KB Output is correct
35 Correct 26 ms 25072 KB Output is correct
36 Correct 24 ms 24928 KB Output is correct
37 Correct 25 ms 24924 KB Output is correct
38 Correct 25 ms 24848 KB Output is correct
39 Correct 17 ms 24924 KB Output is correct
40 Correct 24 ms 24924 KB Output is correct
41 Correct 24 ms 24924 KB Output is correct
42 Correct 26 ms 25068 KB Output is correct
43 Correct 26 ms 24924 KB Output is correct
44 Correct 25 ms 24920 KB Output is correct
45 Correct 24 ms 24924 KB Output is correct
46 Correct 28 ms 24920 KB Output is correct
47 Correct 25 ms 24924 KB Output is correct
48 Correct 19 ms 24924 KB Output is correct
49 Correct 25 ms 24924 KB Output is correct
50 Correct 17 ms 25176 KB Output is correct
51 Correct 26 ms 25004 KB Output is correct
52 Correct 24 ms 25072 KB Output is correct
53 Correct 18 ms 24920 KB Output is correct
54 Correct 18 ms 24924 KB Output is correct
55 Correct 17 ms 24924 KB Output is correct
56 Correct 17 ms 24920 KB Output is correct
57 Correct 17 ms 25072 KB Output is correct
58 Correct 17 ms 24924 KB Output is correct