제출 #625505

#제출 시각아이디문제언어결과실행 시간메모리
625505NintsiChkhaidze은행 (IZhO14_bank)C++14
100 / 100
79 ms8532 KiB
#include <bits/stdc++.h>
// #define int long long
#define pb push_back
#define s second
#define f first
#define pii pair<int,int>
using namespace std;

const int N = 25;
int a[N],b[N],mx[(1<<21) + 5],extra[(1<<21) + 5];

signed main (){
    int n,m;
    cin>>n>>m;
    
    for (int i = 1; i <= n; i++)
        cin>>a[i];
        
    for (int i = 0; i < m; i++)
        cin>>b[i];
        
    for (int i = 0; i < (1<<m); i++) 
        mx[i] = -1;
    
    mx[0] = 0;
    for (int i = 0; i < (1<<m); i++){
        if (mx[i] == -1) continue;
        for (int j = 0; j < m; j++){
            if ((i&(1<<j))) continue;
            int current = extra[i] + b[j];
            int id = mx[i] + 1;
            
            if (a[id] == current){
                mx[i^(1<<j)] = mx[i] + 1;
                if (mx[i] + 1 == n){
                    cout<<"YES\n";
                    return 0;
                }
                extra[i^(1<<j)] = 0;
            }else if (current < a[id]){
                mx[i^(1<<j)] = mx[i];
                extra[i^(1<<j)] = current;
            }
        }
    }
    
    cout<<"NO";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...