제출 #1088638

#제출 시각아이디문제언어결과실행 시간메모리
1088638vjudge1은행 (IZhO14_bank)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h>

using namespace std;
using pii = pair<int,int>;

const int maxn = 20,inf = 1e9;

int n,m;
pii dp[1 << maxn];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    
    cin >> n >> m;
    
    vector<int> s(n),c(m);
    
    for(int &i : s) cin >> i;
    
    for(int &i : c) cin >> i;
    
    for(int i = 0;i < (1 << m);i++)
        dp[i] = {0,0};
    
    for(int i = 1;i < (1 << m);i++)
        for(int j = 0;j < m;j++)
            if(i & (1 << j)){
                int last = i ^ (1 << j);
                pii x = dp[last];
                x.second += j;
                if(x.second == s[x.first]){
                    x.first++;
                    x.second = 0;
                }
                if(x.first == n){
                    cout << "YES";
                    return 0;
                }
                dp[i] = max(dp[i],x);
            }
    
    cout << "NO";

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...