제출 #1272535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1272535		zagaro	은행 (IZhO14_bank)	C++20	100 / 100	176 ms	189224 KiB

bank

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
/**zagaro & lauren <3**/
#define mod 1000000007 //1e9 + 7
#define pi acos(-1)
#define wl while
#define str string
#define ENDL "\n"
#define sal ' '
#define tp_set ll
#define prc(n) cout.precision(n);cout<<fixed;
#define ord_set tree<tp_set, null_type, less<tp_set>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef bool bl;
typedef char car;
using namespace std;
using namespace __gnu_pbds;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen("bank.in", "r", stdin);
    //freopen("bank.out", "w", stdout);
    ll n, m;
    bl B=false;
    cin>>n>>m;
    vector<ll> vec(n+2, 0);
    vector<ll> bil(m);
    vector<vector<ll> > dp(n+2, vector<ll> ((1<<m), -1));
    dp[0][0] = 0;
    for(int i=1;i<=n;i++)cin>>vec[i];
    for(int i=0;i<m;i++)cin>>bil[i];
    for(int i=0;i<=n;i++){
        for(int j=0;j<(1<<m);j++){
            if(dp[i][j] == 0){
                dp[i+1][j] = vec[i+1];
            }
            else if(dp[i][j] > 0){
                for(int k=0;k<m;k++){
                    if((j&(1<<k)) == 0 && dp[i][j] >= bil[k]){
                        dp[i][j^(1<<k)] = dp[i][j]-bil[k];
                    }
                }
            }
        }
    }
    for(int i=0;i<(1<<m);i++){
        if(dp[n][i] == 0){
            B=true;
            break;
        }
    }
    if(B)cout<<"YES\n";
    else cout<<"NO\n";
    return 0;
}

• Subtask 1: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29