oj.uz

Submission #784734

# Submission time Handle Problem Language Result Execution time Memory
784734 2023-07-16T13:05:50 Z nghiaaa Bank (IZhO14_bank) C++14
100 / 100
 117 ms 16900 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define f first
#define s second
#define mp make_pair
multiset<int> haha;
int n,m,BIT[21];
ii dp[1<<22];
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    //freopen("bank.in","r",stdin);
    //freopen("bank.out","w",stdout);
    cin>>n>>m;
    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];
    BIT[0]=1;ii newState;
    for (int i=1;i<22;i++)
        BIT[i]=BIT[i-1]<<1;
    for (int mask=0;mask<BIT[m];mask++)
    {
        if (dp[mask].f==n)
        {
            cout<<"YES";
            return 0;
        }
        for (int i=0;i<m;i++)
        {
            if (mask&BIT[i]) continue;
            if (dp[mask].s+b[i]==a[dp[mask].f])
                newState=mp(dp[mask].f+1,0);
            else newState=mp(dp[mask].f,dp[mask].s+b[i]);
            dp[mask|BIT[i]]=max(dp[mask|BIT[i]],newState);
        }
    }
    cout<<"NO";
    return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:25:15: warning: iteration 20 invokes undefined behavior [-Waggressive-loop-optimizations]
   25 |         BIT[i]=BIT[i-1]<<1;
      |         ~~~~~~^~~~~~~~~~~~
bank.cpp:24:19: note: within this loop
   24 |     for (int i=1;i<22;i++)
      |                  ~^~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 340 KB Output is correct
5 Correct 111 ms 16832 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 94 ms 16724 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 584 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 584 KB Output is correct
11 Correct 2 ms 468 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 340 KB Output is correct
5 Correct 111 ms 16832 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 94 ms 16724 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 584 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 584 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 99 ms 16612 KB Output is correct
32 Correct 104 ms 16660 KB Output is correct
33 Correct 112 ms 16672 KB Output is correct
34 Correct 98 ms 16624 KB Output is correct
35 Correct 102 ms 16688 KB Output is correct
36 Correct 102 ms 16724 KB Output is correct
37 Correct 98 ms 16704 KB Output is correct
38 Correct 99 ms 16900 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 96 ms 16724 KB Output is correct
41 Correct 98 ms 16624 KB Output is correct
42 Correct 117 ms 16720 KB Output is correct
43 Correct 104 ms 16688 KB Output is correct
44 Correct 100 ms 16808 KB Output is correct
45 Correct 1 ms 848 KB Output is correct
46 Correct 110 ms 16720 KB Output is correct
47 Correct 95 ms 16716 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 93 ms 16724 KB Output is correct
50 Correct 98 ms 16684 KB Output is correct
51 Correct 102 ms 16724 KB Output is correct
52 Correct 97 ms 16640 KB Output is correct
53 Correct 106 ms 16620 KB Output is correct
54 Correct 97 ms 16716 KB Output is correct
55 Correct 100 ms 16720 KB Output is correct
56 Correct 98 ms 16724 KB Output is correct
57 Correct 98 ms 16620 KB Output is correct
58 Correct 98 ms 16724 KB Output is correct