제출 #347580

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
347580		CSQ31	은행 (IZhO14_bank)	C++14	100 / 100	141 ms	33388 KiB

bank

#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
	int n,m;
	cin>>n>>m;
	vector<ll>a(n),b(m);
	for(int i=0;i<n;i++)cin>>a[i];
	for(int i=0;i<m;i++)cin>>b[i];
	vector<PII>dp(1<<(m+1));
	dp[0] = {0,0};
	for(int i=1;i<(1<<m);i++){
		dp[i] = {-1,-1};
		for(int j=0;j<m;j++){
			if((i&(1<<j))){
				PII tmp = dp[i-(1<<j)];
				if(tmp.fi != -1){
					if(tmp.se + b[j] == a[tmp.fi]){
						tmp.fi++;
						tmp.se = 0;
					}
					else if(tmp.se+b[j] < a[tmp.fi]){
						tmp.se+=b[j];
					}
					if(tmp != dp[i-(1<<j)])dp[i] = tmp;
				}
			}
		}
		if(dp[i].fi == n){
			cout<<"YES";
			return 0;
		}
	}
	cout<<"NO"<<'\n';
	
}

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