제출 #863569

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
863569		Mohammadamin__Sh	은행 (IZhO14_bank)	C++17	0 / 100	1085 ms	2764 KiB

bank

//In His Name
#include <bits/stdc++.h>
using namespace std;
#define ll long long
//#define int ll
typedef pair<int, int> pii;
typedef pair<long long, int> pli;
typedef pair<long long, long long> pll;
#define F first
#define S second
#define pb push_back
#define bug(x) cout << "Ah shit , here we go again : " << x <<endl
#define all(x) x.begin() , x.end()
#define ceil(x,y) x/y + min(1ll,x%y)
const int maxn = 22 , MOD = 1e9 + 7;
const ll INF = 1e18;

int n , m , a[maxn] , c[maxn] , ps[maxn] , dp[(1<<maxn)] , ok = 0;

int main(){
    ios_base::sync_with_stdio(false);

    cin >> n >> m;
    for(int i = 1 ; i <= n ; i++) cin >> a[i];
    for(int i = 0 ; i < m ; i++) cin >> c[i];
    for(int i = 1 ; i <= n ; i++) ps[i] = ps[i-1] + a[i];
    for(int mask = 1 ; mask < (1 << m) - 1 ; mask++){
        int maxi = 0 , sum = 0 , cnt = m-1 , tmp = mask;
        for(int sub = mask ; sub > 0 ; ((sub-=1) &= mask))  maxi = max(maxi , dp[sub]);
        while(tmp > 0){
            if(tmp & 1) sum += c[cnt];
            cnt --;
            tmp >>= 1;
        }
        if(sum == ps[maxi+1]) dp[mask] = maxi + 1;
        else dp[mask] = maxi;
        if(dp[mask] == n){
            ok = 1;
            break;
        }
    }
    cout << (ok ? "YES" : "NO") ;
}

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