Submission #697598

# Submission time Handle Problem Language Result Execution time Memory
697598 2023-02-10T13:57:47 Z Tam_theguide Bank (IZhO14_bank) C++14
100 / 100
102 ms 8608 KB
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
#define fi first
#define se second
const int N = 20;
int n, m, a[N+2], b[N+2];
pii dp[(1<<N)+2];
int main() {
    cin >> n >> m;
    for (int i = 1; i <= n;i++) cin >> a[i];
    for (int i = 0; i < m; i++) cin >> b[i];
    dp[0]={1, 0};
    for (int mask = 0; mask < (1<<m); mask++) {
        if (dp[mask].fi==0) continue;
        if (dp[mask].fi==n+1) return cout << "YES",0;
        for (int i = 0; i < m; i++)
        if (!(mask&(1<<i))) {
            if (dp[mask].se+b[i]>a[dp[mask].fi]) continue;
            else if (dp[mask].se+b[i]==a[dp[mask].fi])
            dp[mask^(1<<i)] = max(dp[mask^(1<<i)], {dp[mask].fi+1, 0});
            else dp[mask^(1<<i)]=max(dp[mask^(1<<i)], {dp[mask].fi, dp[mask].se+b[i]});
        }
    }
    cout << "NO";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 308 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 76 ms 8432 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 304 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 308 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 436 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 440 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 308 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 76 ms 8432 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 304 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 308 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 436 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 440 KB Output is correct
31 Correct 77 ms 8484 KB Output is correct
32 Correct 92 ms 8396 KB Output is correct
33 Correct 12 ms 7764 KB Output is correct
34 Correct 3 ms 1620 KB Output is correct
35 Correct 3 ms 1748 KB Output is correct
36 Correct 2 ms 560 KB Output is correct
37 Correct 3 ms 724 KB Output is correct
38 Correct 2 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 65 ms 8400 KB Output is correct
43 Correct 6 ms 4116 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 1 ms 560 KB Output is correct
46 Correct 27 ms 8340 KB Output is correct
47 Correct 2 ms 568 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 3 ms 340 KB Output is correct
50 Correct 75 ms 8396 KB Output is correct
51 Correct 4 ms 852 KB Output is correct
52 Correct 9 ms 8372 KB Output is correct
53 Correct 102 ms 8484 KB Output is correct
54 Correct 83 ms 8412 KB Output is correct
55 Correct 73 ms 8408 KB Output is correct
56 Correct 70 ms 8484 KB Output is correct
57 Correct 73 ms 8436 KB Output is correct
58 Correct 73 ms 8608 KB Output is correct