Submission #403196

#	Time	Username	Problem	Language	Result	Execution time	Memory
403196		fadi57	은행 (IZhO14_bank)	C++14	19 / 100	1 ms	424 KiB

bank

#include<bits/stdc++.h>
using namespace std;
const int mx=1e5+5;
typedef long long ll;
int inf=1e9+10;
const int mod=1e9+7;
int a[mx];
int b[mx];
int x[mx];
int n,m;
map<int,int>mp;
int dp[11][1001];
int main(){
cin>>n>>m;

for(int i=0;i<n;i++){
    cin>>a[i];

}
for(int i=1;i<=m;i++){
    cin>>b[i];


}
dp[0][0]=1;
for(int i=1;i<=m;i++){
    dp[i][b[i]]=1;
    for(int j=0;j<=1000;j++){
        dp[i][j]=dp[i-1][j];
        if(j-b[i]>=0){
        dp[i][j]=max(dp[i-1][j-b[i]],dp[i][j]);
        }
    }
}

for(int i=1;i<=m;i++){
   if(dp[i][a[0]]){
     cout<<"YES";
     return 0;
   }


}


cout<<"NO";



 }

• Subtask 1: 19 / 19
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29