제출 #721256

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
721256		nishkarsh	은행 (IZhO14_bank)	C++14	100 / 100	133 ms	4464 KiB

bank

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pcc pair<char,char>
#define vi vector <int>
#define vl vector <ll>
#define sd(x) scanf("%d",&x)
#define slld(x) scanf("%lld",&x)
#define pd(x) printf("%d",x)
#define plld(x) printf("%lld",x)
#define pds(x) printf("%d ",x)
#define pllds(x) printf("%lld ",x)
#define pdn(x) printf("%d\n",x)
#define plldn(x) printf("%lld\n",x)
using namespace std;
ll powmod(ll base,ll exponent,ll mod){
	ll ans=1;
	if(base<0) base+=mod;
	while(exponent){
		if(exponent&1)ans=(ans*base)%mod;
		base=(base*base)%mod;
		exponent/=2;
	}
	return ans;
}
ll gcd(ll a, ll b){
	if(b==0) return a;
	else return gcd(b,a%b);
}
const int INF = 2e9;
const ll INFLL = 4e18;
const int upperlimit = 2e3+1;
const int mod = 1e9+7;
const int N = 20;
int dp[1<<N];
int pre[N+2];
int b[N];
int main() {
	int n,m;
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		cin >> pre[i];
		pre[i] += pre[i-1];
	}
	for(int i = 0; i < m; i++) cin >> b[i];
	for(int i = 1; i < (1<<m); i++){
		int sm = 0;
		for(int j = 0; j < m; j++) if(i&(1<<j)) sm += b[j];
		for(int j = 0; j < m; j++){
			if(i&(1<<j)){
				if(pre[dp[i^(1<<j)] + 1] == sm) dp[i] = max(dp[i],dp[i^(1<<j)] + 1);
				else dp[i] = max(dp[i],dp[i^(1<<j)]);
			}
		}
	}
	if(dp[(1<<m) - 1] < n) cout << "NO";
	else cout << "YES";
	return 0;
}

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