제출 #254551

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
254551		infinite_iq	은행 (IZhO14_bank)	C++14	100 / 100	147 ms	4480 KiB

bank

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
//#define mp make_pair
#define mid (l+r)/2
#define le node * 2 
#define ri node * 2 + 1 
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
#define all(x) x.begin(), x.end()
#define gc getchar_unlocked
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef pair<double,ll>pdi;
const ll inf=1e18;
const ll Mod=1e9+7;
const ld Pi=acos(-1); 
int n , m ;
int a [21] , b [21] ;
int dp [(1<<20)+9] ;
int bt ( int pos , int mask , int sum ) {
        if ( pos == n ) return 1 ;
        int &ret = dp [mask] ;
        if ( ret != -1 ) return ret ;
        ret = 0 ;
        for ( int i = 0 ; i < m ; i ++ ) {
                if ( ( mask & ( 1 << i ) ) ) C ;
                if ( sum + b [i] == a [pos] ) {
                        ret = max ( ret , bt ( pos + 1 , ( mask | ( 1 << i ) ) , 0 ) ) ;
                }
                if ( sum + b [i] <  a [pos] ) {
                        ret = max ( ret , bt ( pos     , ( mask | ( 1 << i ) ) , sum + b [i] ) ) ;
                }
        }
        return ret ;
}
int main () {
        mem ( dp , -1 ) ;
        cin >> n >> m ;
        for ( int i = 0 ; i < n ; i ++ ) cin >> a [i] ;
        for ( int i = 0 ; i < m ; i ++ ) cin >> b [i] ;
        cout << ( bt ( 0 , 0 , 0 ) ? "YES" : "NO" ) << endl ;
}

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