# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
848642 | mariam197 | Bank (IZhO14_bank) | C++17 | 1041 ms | 19704 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
template<typename T>
#define ll long long
#define ld long double
#define mod 1000000007
#define all(x) x.begin(),x.end()
using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
vector<int> v[1005];
int n;
int a[20];
bool solve(int i,int mask){
if(i==n){
return 1;
}
bool res=1,b=0;
for(auto j: v[a[i]]){
int mx=max(mask,j);
int y=(1<<(int)log(mx)+1)-1;
if((mask^j)==y || mask==0){
b=1;
res&=solve(i+1,j);
}
}
return (res&b);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
freopen("bank.in","r",stdin);
freopen("bank.out","w",stdout);
int m;
cin>>n>>m;
vector<int> b(m);
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<m;i++){
cin>>b[i];
}
reverse(all(b));
for(int mask=1;mask<(1<<m);mask++){
ll sum=0;
for(int i=0;i<m;i++){
if((mask&(1<<i))){
sum+=b[i];
}
}
if(sum<=1000){
v[sum].push_back(mask);
}
}
cout<<(solve(0,0)==1?"YES":"NO");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |