# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1107259 | vjudge1 | Bank (IZhO14_bank) | C++17 | 1049 ms | 508 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>
#define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
using namespace std;
const int N=2e5+5;
const int inf=1e9;
const int mod=1e9+7;
const int N1=1e6+1;
vector<int>v;
vector<int>v1;
struct edge{
int v,time;
};
int dp[1001];
signed main(){
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
boost;
int n,m;
cin>>n>>m;
v.push_back(0);
for(int i=0;i<n;i++){
int x;
cin>>x;
v.push_back(x);
}
for(int i=0;i<m;i++){
int x;
cin>>x;
v1.push_back(x);
}
if(n==1){
for(int i=0;i<(1<<m);i++){
int cnt=0;
for(int j=0;j<m;j++){
if(1&(i>>j)){
cnt+=v1[j];
}
}
if(cnt==v[1]){
cout<<"YES";
return 0;
}
}
cout<<"NO";
return 0;
}
sort(v1.begin(),v1.end());
do{
int j=1;
int cnt=0;
for(int i=0;i<v1.size();i++){
cnt+=v1[i];
if(cnt==v[j]&&j<=n){
j++;
cnt++;
}
}
if(j==n+1){
cout<<"YES\n";
return 0;
}
}while(next_permutation(v1.begin(),v1.end()));
cout<<"NO\n";
}
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... |