#include <bits/stdc++.h>
using namespace std;
ifstream fin("bank.in");
ofstream fout("bank.out");
int n, m, s[1005], b[1005];
pair<int, int>dp[(1 << 20) + 10];
///in dp[stare] retin ultima persoana pe care am platit o cu bancnotele din stare si suma de bani ramasa dupa ce i am platit, care trebuie sa fie fixa pt a-l plati pe urmatorul
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i++)
cin >> s[i];
for(int i = 0; i < m; i++){
cin >> b[i];
}
for(int i = 0; i < (1 << m); i++)
dp[i] = {-1, 0};
dp[0] = {0, 0};
for(int stare = 0; stare < (1 << m); stare++)
for(int j = 0; j < m; j++){
if(!(stare & (1 << j)) && dp[stare].first != -1){
int moneyDisp = dp[stare].second + b[j];
int lastppl = dp[stare].first + 1;
if(s[lastppl] == moneyDisp){
dp[(stare | (1 << j))].first = lastppl;
dp[(stare | (1 << j))].second = moneyDisp - s[lastppl];
if(lastppl == n){
cout << "YES\n";
return 0;
}
}
else if(s[lastppl] > moneyDisp){
dp[(stare | (1 << j))] = {dp[stare].first, moneyDisp};
}
}
}
cout << "NO\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
308 KB |
Output is correct |
4 |
Correct |
1 ms |
576 KB |
Output is correct |
5 |
Correct |
63 ms |
8404 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
4 ms |
8404 KB |
Output is correct |
9 |
Correct |
71 ms |
8504 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
316 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
340 KB |
Output is correct |
2 |
Correct |
2 ms |
448 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
2 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
2 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
308 KB |
Output is correct |
4 |
Correct |
1 ms |
576 KB |
Output is correct |
5 |
Correct |
63 ms |
8404 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
4 ms |
8404 KB |
Output is correct |
9 |
Correct |
71 ms |
8504 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
316 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
0 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
2 ms |
340 KB |
Output is correct |
21 |
Correct |
2 ms |
448 KB |
Output is correct |
22 |
Correct |
1 ms |
340 KB |
Output is correct |
23 |
Correct |
2 ms |
340 KB |
Output is correct |
24 |
Correct |
2 ms |
340 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
1 ms |
340 KB |
Output is correct |
27 |
Correct |
1 ms |
340 KB |
Output is correct |
28 |
Correct |
1 ms |
340 KB |
Output is correct |
29 |
Correct |
1 ms |
340 KB |
Output is correct |
30 |
Correct |
2 ms |
340 KB |
Output is correct |
31 |
Correct |
43 ms |
8404 KB |
Output is correct |
32 |
Correct |
46 ms |
8404 KB |
Output is correct |
33 |
Correct |
42 ms |
8500 KB |
Output is correct |
34 |
Correct |
33 ms |
8404 KB |
Output is correct |
35 |
Correct |
61 ms |
8524 KB |
Output is correct |
36 |
Correct |
60 ms |
8500 KB |
Output is correct |
37 |
Correct |
61 ms |
8504 KB |
Output is correct |
38 |
Correct |
67 ms |
8504 KB |
Output is correct |
39 |
Correct |
4 ms |
8404 KB |
Output is correct |
40 |
Correct |
59 ms |
8504 KB |
Output is correct |
41 |
Correct |
62 ms |
8508 KB |
Output is correct |
42 |
Correct |
99 ms |
8504 KB |
Output is correct |
43 |
Correct |
62 ms |
8504 KB |
Output is correct |
44 |
Correct |
61 ms |
8508 KB |
Output is correct |
45 |
Correct |
4 ms |
8404 KB |
Output is correct |
46 |
Correct |
38 ms |
8404 KB |
Output is correct |
47 |
Correct |
64 ms |
8504 KB |
Output is correct |
48 |
Correct |
5 ms |
8404 KB |
Output is correct |
49 |
Correct |
62 ms |
8508 KB |
Output is correct |
50 |
Correct |
43 ms |
8508 KB |
Output is correct |
51 |
Correct |
47 ms |
8516 KB |
Output is correct |
52 |
Correct |
35 ms |
8512 KB |
Output is correct |
53 |
Correct |
49 ms |
8400 KB |
Output is correct |
54 |
Correct |
55 ms |
8508 KB |
Output is correct |
55 |
Correct |
40 ms |
8508 KB |
Output is correct |
56 |
Correct |
44 ms |
8404 KB |
Output is correct |
57 |
Correct |
69 ms |
8504 KB |
Output is correct |
58 |
Correct |
38 ms |
8516 KB |
Output is correct |