# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
884223 | kokoue | Bank (IZhO14_bank) | C++14 | 1 ms | 600 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>
using namespace std;
bool sum[20001];
int n,m;
int a[100],b[100];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
int summ=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
summ+=a[i];
}
for(int i=0;i<m;i++)
{
cin>>b[i];
}
sum[b[0]]=true;
sum[0]=true;
int maxsum=b[0];
int minsum=b[0];
//
for(int i=1;i<m;i++)
{
// int currmax=0;
for(int j=1;j<=summ;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;
}
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... |