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>
using namespace std;
bool sum[200001];
int n,m;
int a[100],b[100];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<m;i++)
{
cin>>b[i];
}
sum[0]=true;
int maxsum=0;
int minsum=0;
for(int i=0;i<m;i++)
{
int currmax=0;
for(int j=0;j<=maxsum;j++)
{
if(sum[j]==true)
{
currmax=max(currmax,j+b[i]);
sum[j+b[i]]=true;
}
}
maxsum=max(maxsum,currmax);
sum[b[i]]=true;
minsum=min(minsum,b[i]);
}
for(int i=0;i<n;i++)
{
if(!sum[a[i]]) {cout<<"NO\n";return 0;}
}
cout<<"YES\n";
return 0;
}
# | 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... |