Submission #123463

#	Time	Username	Problem	Language	Result	Execution time	Memory
123463		shashwatchandra	Bank (IZhO14_bank)	C++17	100 / 100	648 ms	176304 KiB

bank

/*input
2 6
9 10
5 4 8 6 3 11
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define int long long 
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back

#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)

#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;

int raise(int a,int n,int m = MOD){
  if(n == 0)return 1;
  if(n == 1)return a;
  int x = 1;
    x *= raise(a,n/2,m);
    x %= m;
    x *= x;
    x %= m;
    if(n%2)x*= a;
    x %= m;
    return x;
}

int floor1(int n,int k){
    if(n%k == 0 || n >= 0)return n/k;
    return (n/k)-1;
}

int ceil1(int n,int k){
    return floor1(n+k-1,k);
}

const int K = 1001;
const int N = 20;
vector<int> store[K];
int n,m;
int a[N],b[N];
int mem[N][1<<N];

int dp(int i,int mask){
	if(i == m)return 1;
	if(mem[i][mask] != -1)return mem[i][mask];
	int res = 0;
	for(auto newm:store[a[i]]){
		if(newm&mask)continue;
		res = max(res,dp(i+1,mask|newm));
	}
	mem[i][mask] = res;
	return res;
}

void solve(){
	REP(i,N){
		REP(j,1<<N)mem[i][j] = -1;
	}
  	cin >> m >> n;
  	REP(i,m)cin >> a[i];
  	REP(i,n)cin >> b[i];
  	REP(i,1<<n){
  		int sum = 0;
  		for(int j = 0;j < n;j++){
  			if(i&(1<<j))sum += b[j];
  		}
  		if(sum > 1000)continue;
  		store[sum].pb(i);
  	}
  	if(dp(0,0))cout << "YES";
  	else cout << "NO";
}

signed main(){
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  //freopen(".in","r",stdin);freopen(".out","w",stdout);
  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