Submission #750634

# Submission time Handle Problem Language Result Execution time Memory
750634 2023-05-30T02:39:40 Z LonlyR Bank (IZhO14_bank) C++17
100 / 100
108 ms 16740 KB
#include<bits/stdc++.h>
#define int long long
#define ii pair<int,int>
#define ff first
#define ss second

using namespace std;
const int maxn = 21;
int n,m,a[maxn],b[maxn];
ii dp[1<<maxn];

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin>>n>>m;
    for (int i=1;i<=n;i++) cin>>a[i];
    for (int i=1;i<=m;i++) cin>>b[i];
    for (int i=1;i<1<<m;i++) dp[i]={-1,-1};
    dp[0]={1,0};
    for (int mask=0;mask<1<<m;mask++)
    {
        for (int j=1;j<=m;j++) if (mask>>(j-1)&1)
        {
            int pre = mask ^ (1<<(j-1));
            if (dp[pre].ff==-1) continue;
            int now = dp[pre].ss + b[j];
            int need = a[dp[pre].ff];
            if (now < need)
            {
                if (dp[pre].ff>dp[mask].ff)
                    dp[mask] = {dp[pre].ff,now};
            }
            else if (now == need)
            {
                if (dp[pre].ff + 1 > dp[mask].ff)
                    dp[mask] = {dp[pre].ff + 1, 0};
            }
        }
        if (dp[mask].ff == n+1) return cout<<"YES",0;
    }
    cout<<"NO";
}
# 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 0 ms 212 KB Output is correct
4 Correct 1 ms 736 KB Output is correct
5 Correct 66 ms 16724 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 7 ms 16724 KB Output is correct
9 Correct 71 ms 16616 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 584 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 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 0 ms 212 KB Output is correct
4 Correct 1 ms 736 KB Output is correct
5 Correct 66 ms 16724 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 7 ms 16724 KB Output is correct
9 Correct 71 ms 16616 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 584 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 93 ms 16736 KB Output is correct
32 Correct 93 ms 16724 KB Output is correct
33 Correct 77 ms 16720 KB Output is correct
34 Correct 67 ms 16724 KB Output is correct
35 Correct 66 ms 16724 KB Output is correct
36 Correct 66 ms 16724 KB Output is correct
37 Correct 65 ms 16724 KB Output is correct
38 Correct 66 ms 16724 KB Output is correct
39 Correct 7 ms 16724 KB Output is correct
40 Correct 64 ms 16724 KB Output is correct
41 Correct 65 ms 16724 KB Output is correct
42 Correct 108 ms 16616 KB Output is correct
43 Correct 69 ms 16724 KB Output is correct
44 Correct 65 ms 16724 KB Output is correct
45 Correct 8 ms 16724 KB Output is correct
46 Correct 88 ms 16724 KB Output is correct
47 Correct 63 ms 16724 KB Output is correct
48 Correct 7 ms 16724 KB Output is correct
49 Correct 65 ms 16732 KB Output is correct
50 Correct 75 ms 16724 KB Output is correct
51 Correct 65 ms 16724 KB Output is correct
52 Correct 67 ms 16724 KB Output is correct
53 Correct 98 ms 16724 KB Output is correct
54 Correct 89 ms 16740 KB Output is correct
55 Correct 78 ms 16724 KB Output is correct
56 Correct 75 ms 16724 KB Output is correct
57 Correct 75 ms 16724 KB Output is correct
58 Correct 80 ms 16724 KB Output is correct