oj.uz

Submission #955127

# Submission time Handle Problem Language Result Execution time Memory
955127 2024-03-29T12:33:37 Z andrewp Bank (IZhO14_bank) C++14
100 / 100
 107 ms 16984 KB 
//Dedicated to my love, ivaziva
#define here cerr<<"---------------------------------\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
#define ll long long
#define ld long double
#define llinf 100000000000000000LL
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define all(a) a.begin(),a.end()
#define sz(s) (ll)(s.size())
#define ios ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
#define mod 1000000007
using namespace std;
/*#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
ll add(ll x,ll y){
    if(x+y>=mod) return x+y-mod;
    return x+y;
}
ll sub(ll x,ll y){
    if(x-y<0) return x-y+mod;
    return x-y;
}
ll mul(ll x,ll y){
    ll res=(x*y)%mod;
    if(res<0) res+=mod;
    return res;
}
ll pw(ll x,ll y){
	ll ret=1,bs=x;
	for(;y;y>>=1){
		if(y&1) ret=mul(ret,bs);
		bs=mul(bs,bs);
	}
	return ret%mod;
}*/
#define maxn 20
ll n,m;
ll a[maxn];
ll b[maxn];
void tc(){
    cin >> n >> m;
    for(ll i = 0;i<n;i++) cin >> a[i];
    for(ll i = 0;i<m;i++) cin >> b[i];
    bool ans = 0;
    vector<ll> dp(1<<m,-1),os(1<<maxn,0);
    dp[0] = 0;
    for(ll msk = 1;msk<(1<<m);msk++){
        for(ll i = 0;i<m;i++){
            if(!(msk&(1<<i))) continue;
            ll sub = msk^(1<<i);
            if(dp[sub]==-1) continue;
            ll im = os[sub]+b[i];
            ll tr = a[dp[sub]];
            if(im<tr){
                dp[msk] = dp[sub];
                os[msk] = im;
            }else if(im==tr){
                dp[msk] = max(dp[msk],dp[sub]+1);
                os[msk] = 0;
            }
        }
        ans|=(dp[msk]==n);
    }
    cout<<(ans?"YES":"NO")<<endl;
}
int main(){
	ios
    //freopen("guard.in","r",stdin);
    //freopen("guard.out","w",stdout);
    int t; t = 1;
//    cin >> t;
    while(t--){
        tc();
    }
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 8644 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 5 ms 8796 KB Output is correct
5 Correct 76 ms 16872 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 80 ms 16868 KB Output is correct
9 Correct 78 ms 16864 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8544 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8796 KB Output is correct
2 Correct 5 ms 8796 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 3 ms 8672 KB Output is correct
5 Correct 3 ms 8796 KB Output is correct
6 Correct 3 ms 8796 KB Output is correct
7 Correct 3 ms 8792 KB Output is correct
8 Correct 3 ms 8796 KB Output is correct
9 Correct 3 ms 8796 KB Output is correct
10 Correct 3 ms 8796 KB Output is correct
11 Correct 3 ms 8792 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 8644 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 5 ms 8796 KB Output is correct
5 Correct 76 ms 16872 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 80 ms 16868 KB Output is correct
9 Correct 78 ms 16864 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8536 KB Output is correct
12 Correct 4 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8536 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 2 ms 8544 KB Output is correct
20 Correct 3 ms 8796 KB Output is correct
21 Correct 5 ms 8796 KB Output is correct
22 Correct 3 ms 8796 KB Output is correct
23 Correct 3 ms 8672 KB Output is correct
24 Correct 3 ms 8796 KB Output is correct
25 Correct 3 ms 8796 KB Output is correct
26 Correct 3 ms 8792 KB Output is correct
27 Correct 3 ms 8796 KB Output is correct
28 Correct 3 ms 8796 KB Output is correct
29 Correct 3 ms 8796 KB Output is correct
30 Correct 3 ms 8792 KB Output is correct
31 Correct 93 ms 16728 KB Output is correct
32 Correct 91 ms 16872 KB Output is correct
33 Correct 81 ms 16884 KB Output is correct
34 Correct 76 ms 16928 KB Output is correct
35 Correct 77 ms 16984 KB Output is correct
36 Correct 76 ms 16868 KB Output is correct
37 Correct 77 ms 16728 KB Output is correct
38 Correct 79 ms 16728 KB Output is correct
39 Correct 76 ms 16868 KB Output is correct
40 Correct 79 ms 16868 KB Output is correct
41 Correct 77 ms 16732 KB Output is correct
42 Correct 107 ms 16864 KB Output is correct
43 Correct 78 ms 16868 KB Output is correct
44 Correct 77 ms 16864 KB Output is correct
45 Correct 104 ms 16732 KB Output is correct
46 Correct 91 ms 16880 KB Output is correct
47 Correct 76 ms 16732 KB Output is correct
48 Correct 78 ms 16728 KB Output is correct
49 Correct 77 ms 16868 KB Output is correct
50 Correct 88 ms 16872 KB Output is correct
51 Correct 79 ms 16732 KB Output is correct
52 Correct 75 ms 16732 KB Output is correct
53 Correct 97 ms 16872 KB Output is correct
54 Correct 96 ms 16732 KB Output is correct
55 Correct 88 ms 16732 KB Output is correct
56 Correct 91 ms 16872 KB Output is correct
57 Correct 102 ms 16872 KB Output is correct
58 Correct 93 ms 16868 KB Output is correct