| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1182493 | l.alzahrani04 | 은행 (IZhO14_bank) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
int n,m;
cin>>n>>m;
int arr[n], b[m];
for(int i=0; i<n; i++)
{
cin>>arr[i];
}
int thing=arr[0];
for(int i=0; i<m; i++)
{
cin>>b[i];
}
vector<bool> found(arr[0]+1, false);
found[0]=1;
for(int i=0; i<m; i++)
{
for(int j=thing; j>=b[i]; j--)
{
if(found[j-b[i]])
{
found[j]=true;
}
}
}
if(found[thing])
{
cout<<"YES";
}
else
{
cout<<"NO";
}
}
| # | 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... | ||||
