제출 #1302118

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1302118		shk1384	은행 (IZhO14_bank)	C++20	100 / 100	98 ms	16864 KiB

bank

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
const int N=21;
//const ll mod=998244353;
const ll mod=1000000007;
const int intinf=2e9;
const ll llinf=9e18;
const ld eps=2e-7;

int n, m, a[N], b[N];
ll covered[(1 << N)], leftover[(1 << N)];

void solve(){
    cin >> n >> m;
    for(int i = 0; i < n; i++)
        cin >> a[i];
    for(int i = 0; i < m; i++)
        cin >> b[i];
    for(int mask = 1; mask < (1 << m); mask++){
        covered[mask] = -1;
        leftover[mask] = -1;
        for(int i = 0; i < m; i++){
            if((mask & (1 << i)) == 0) continue;
            int prev_mask = mask ^ (1 << i);
            int j = covered[prev_mask];
            if(j == -1) continue;
            int price = leftover[prev_mask];
            if(price + b[i] == a[j]){
                covered[mask] = j + 1;
                leftover[mask] = 0;
            }
            if(price + b[i] < a[j]){
                covered[mask] = j;
                leftover[mask] = b[i] + leftover[prev_mask];
            }
        }
        if(covered[mask] == n){
            cout << "YES\n";
            return;
        }
    }
    cout << "NO\n";
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1;
    //cin >> t;
    while(t--)
        solve();
    return 0;
}

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