# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
683010 |
2023-01-17T13:52:42 Z |
maks007 |
Bank (IZhO14_bank) |
C++14 |
|
1000 ms |
8532 KB |
#include "bits/stdc++.h"
using namespace std;
#define int long long
signed main () {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n,m;
cin >> n >> m;
vector <int> a(n), b(m);
for(int i = 0; i < n; i ++) cin >> a[i];
for(int i = 0; i < m; i ++) cin >> b[i];
vector <int> dp((1<<m), -1);
dp[0]=0;
for(int mask = 0; mask < (1 << m); mask ++) {
int sum = 0;
for(int i = 0; i < m; i ++) {
if(mask & (1 << i)) sum += b[i];
}
for(int mask2 = 0; mask2 < (1 << m); mask2 ++) {
if(mask & mask2) continue;
if(dp[mask2] == -1) continue;
if(sum == a[dp[mask2]]) dp[mask] = max(dp[mask], dp[mask2] + 1);
}
}
if(count(dp.begin(), dp.end(), n)) cout << "YES";
else cout << "NO";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
759 ms |
468 KB |
Output is correct |
5 |
Execution timed out |
1093 ms |
8532 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
202 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
759 ms |
468 KB |
Output is correct |
5 |
Execution timed out |
1093 ms |
8532 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |