# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
944979 |
2024-03-13T09:20:42 Z |
nguyennh |
Bank (IZhO14_bank) |
C++17 |
|
1 ms |
460 KB |
#include<bits/stdc++.h>
#define el '\n'
using namespace std ;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int32_t main (){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n , m;
cin >> n >> m;
vector<int> a(n + 5) , b(m + 5);
for ( int i = 1 ; i <= n ; i++ ) cin >> a[i];
for ( int i = 1 ; i <= m ; i++ ) cin >> b[i];
int sum = accumulate(b.begin() + 1 , b.begin() + m + 1 , 0);
vector<vector<bool>> dp(m + 5 , vector<bool> (sum + 5 , false));
dp[0][0] = 1;
for ( int i = 1 ; i <= m ; i++ ){
for ( int j = 1 ; j <= sum ; j++ ){
dp[i][j] = dp[i - 1][j];
if (j >= b[i]){
dp[i][j] = dp[i][j] | dp[i - 1][j - b[i]];
}
}
}
bool check = true;
for ( int i = 1 ; i <= n ; i++ ) check &= dp[m][a[i]];
cout << (check ? "YES" : "NO");
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
460 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |