oj.uz

Submission #765603

# Submission time Handle Problem Language Result Execution time Memory
765603 2023-06-24T22:05:27 Z HD1 Bank (IZhO14_bank) C++14
71 / 100
 208 ms 172904 KB 
//we are all lost trying to be someone.
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define sz(x) ll(x.size())
#define reve(x) reverse(x.begin(),x.end())
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
const ll MAX=1e5+10;
const ll mod=1e9+7;
const ll inf=1e18+7;
vector<ll>s;
ll A[1010],B[1010];
map<ll,vector<ll>> masks;
map<ll,vector<ll>> c;
ll dp[21][(1<<20)+10];
ll n, m;
void prin(ll x){
    for(ll i=m-1; i>=0; i--){
        cout<<((x>>i)&1);
    }
    cout<<endl;
    return;
}
bool DP(ll i, ll mask){
    if(i<0)return 1;
    if(dp[i][mask]!=-1)return dp[i][mask];
    dp[i][mask]=0;
    for(ll x: masks[s[i]]){
        if((mask&x)==x){
            if(i==0)dp[i][mask]=1;
            dp[i][mask]=dp[i][mask] or DP(i-1,mask^x);
        }
    }
    return dp[i][mask];
}
void solve(){
    cin>>n>>m;
    memset(dp, -1, sizeof dp);
    for(ll i=0; i<n; i++){
        ll a;
        cin>>a;
        s.push_back(a);
        c[a].push_back(i);
    }
    for(ll i=0; i<m; i++){
        cin>>B[i];
    }
    sort(s.begin(),s.end());
    for(ll mask=0; mask<(1<<m); mask++){
        ll sum=0;
        for(ll j=0; j<m; j++){
            if((mask>>j)&1){
                sum+=B[j];
            }
        }
        ll pos=lower_bound(s.begin(),s.end(),sum)-s.begin();
        if(pos<n and s[pos]==sum){
            masks[s[pos]].push_back(mask);
            for(ll it : c[s[pos]]) dp[it][mask]=1;
        }
    }
    if(DP(n-1,(1<<m)-1)){
        cout<<"YES"<<endl;
    }
    else cout<<"NO"<<endl;

}
int main(){
    fastio;
    solve();
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 172556 KB Output is correct
2 Correct 59 ms 172668 KB Output is correct
3 Correct 60 ms 172568 KB Output is correct
4 Correct 61 ms 172588 KB Output is correct
5 Correct 126 ms 172672 KB Output is correct
6 Correct 62 ms 172664 KB Output is correct
7 Correct 61 ms 172632 KB Output is correct
8 Correct 117 ms 172724 KB Output is correct
9 Correct 122 ms 172664 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 172640 KB Output is correct
2 Correct 59 ms 172620 KB Output is correct
3 Correct 60 ms 172664 KB Output is correct
4 Correct 60 ms 172560 KB Output is correct
5 Correct 59 ms 172620 KB Output is correct
6 Correct 60 ms 172632 KB Output is correct
7 Correct 61 ms 172564 KB Output is correct
8 Correct 61 ms 172676 KB Output is correct
9 Correct 60 ms 172572 KB Output is correct
10 Correct 60 ms 172616 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 172704 KB Output is correct
2 Correct 61 ms 172568 KB Output is correct
3 Correct 60 ms 172676 KB Output is correct
4 Correct 61 ms 172572 KB Output is correct
5 Correct 60 ms 172660 KB Output is correct
6 Correct 60 ms 172672 KB Output is correct
7 Correct 62 ms 172604 KB Output is correct
8 Correct 64 ms 172668 KB Output is correct
9 Correct 62 ms 172556 KB Output is correct
10 Correct 62 ms 172620 KB Output is correct
11 Correct 69 ms 172556 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 172556 KB Output is correct
2 Correct 59 ms 172668 KB Output is correct
3 Correct 60 ms 172568 KB Output is correct
4 Correct 61 ms 172588 KB Output is correct
5 Correct 126 ms 172672 KB Output is correct
6 Correct 62 ms 172664 KB Output is correct
7 Correct 61 ms 172632 KB Output is correct
8 Correct 117 ms 172724 KB Output is correct
9 Correct 122 ms 172664 KB Output is correct
10 Correct 63 ms 172640 KB Output is correct
11 Correct 59 ms 172620 KB Output is correct
12 Correct 60 ms 172664 KB Output is correct
13 Correct 60 ms 172560 KB Output is correct
14 Correct 59 ms 172620 KB Output is correct
15 Correct 60 ms 172632 KB Output is correct
16 Correct 61 ms 172564 KB Output is correct
17 Correct 61 ms 172676 KB Output is correct
18 Correct 60 ms 172572 KB Output is correct
19 Correct 60 ms 172616 KB Output is correct
20 Correct 65 ms 172704 KB Output is correct
21 Correct 61 ms 172568 KB Output is correct
22 Correct 60 ms 172676 KB Output is correct
23 Correct 61 ms 172572 KB Output is correct
24 Correct 60 ms 172660 KB Output is correct
25 Correct 60 ms 172672 KB Output is correct
26 Correct 62 ms 172604 KB Output is correct
27 Correct 64 ms 172668 KB Output is correct
28 Correct 62 ms 172556 KB Output is correct
29 Correct 62 ms 172620 KB Output is correct
30 Correct 69 ms 172556 KB Output is correct
31 Correct 125 ms 172724 KB Output is correct
32 Correct 130 ms 172904 KB Output is correct
33 Correct 128 ms 172652 KB Output is correct
34 Correct 136 ms 172676 KB Output is correct
35 Correct 128 ms 172680 KB Output is correct
36 Correct 127 ms 172684 KB Output is correct
37 Correct 132 ms 172588 KB Output is correct
38 Correct 127 ms 172676 KB Output is correct
39 Correct 128 ms 172572 KB Output is correct
40 Correct 127 ms 172580 KB Output is correct
41 Correct 134 ms 172708 KB Output is correct
42 Correct 129 ms 172692 KB Output is correct
43 Correct 128 ms 172576 KB Output is correct
44 Correct 129 ms 172572 KB Output is correct
45 Correct 136 ms 172592 KB Output is correct
46 Correct 129 ms 172748 KB Output is correct
47 Correct 130 ms 172564 KB Output is correct
48 Correct 120 ms 172724 KB Output is correct
49 Correct 126 ms 172668 KB Output is correct
50 Correct 129 ms 172680 KB Output is correct
51 Correct 144 ms 172840 KB Output is correct
52 Correct 208 ms 172684 KB Output is correct
53 Correct 127 ms 172700 KB Output is correct
54 Correct 127 ms 172732 KB Output is correct
55 Correct 129 ms 172584 KB Output is correct
56 Correct 127 ms 172624 KB Output is correct
57 Incorrect 127 ms 172672 KB Output isn't correct
58 Halted 0 ms 0 KB -