oj.uz

Submission #570382

# Submission time Handle Problem Language Result Execution time Memory
570382 2022-05-29T11:54:54 Z Huy Bank (IZhO14_bank) C++17
100 / 100
 603 ms 8652 KB 
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define fi first
#define se second

using namespace std;
using ll = long long;
using ldb = long double;
const int N = (int)1e8;
const int maxN = (int)3e5 + 1;
const int mod = 998244353;

void InputFile()
{
    //freopen("scrivener.inp","r",stdin);
    //freopen("scrivener.out","w",stdout);
    //freopen("test.out","r",stdin);
}

void FastInput()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
}

int n,m;
int a[maxN];
int b[maxN];
int dp[(1 << 21)];

void Read()
{
    cin >> n >> m;
    for(int i = 0;i < n;i++)
        cin >> a[i];
    for(int i = 0;i < m;i++)
        cin >> b[i];
}

void Solve()
{
    for(int i = 0;i < (1 << m);i++)
    {
        dp[i] = -1;
    }
    dp[0] = 0;
    for(int i = 0;i < n;i++)
    {
        for(int mask = 0;mask < (1 << m);mask++)
        {
            if(dp[mask] != -1)
            {
                for(int j = 0;j < m;j++)
                {
                    if(!(mask & (1 << j)))
                    {
                        dp[mask | (1 << j)] = dp[mask] + b[j];
                    }
                }
            }
        }
        for(int mask = 0;mask < (1 << m);mask++)
        {
            if(dp[mask] == a[i])
            {
                dp[mask] = 0;
            }
            else dp[mask] = -1;
        }
    }
    for(int mask = 0;mask < (1 << m);mask++)
    {
        if(dp[mask] == 0)
        {
            cout <<"YES";
            return;
        }
    }
    cout <<"NO";
}

void Debug()
{
    //Main_sub();
    //Naive();
}


int32_t main()
{
    FastInput();
    //InputFile();
    //int sub_type;
    //cin >> sub_type;
    //Sieve();
    int test;
    //cin >> test;
    test = 1;
    while(test--)
    //for(int prc = 1; prc <= test; prc++)
    {
        Read();
        Solve();
        //Debug();
    }
}

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 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 65 ms 8532 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 62 ms 8532 KB Output is correct
9 Correct 63 ms 8544 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 456 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 1 ms 468 KB Output is correct
7 Correct 2 ms 456 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 424 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 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 65 ms 8532 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 62 ms 8532 KB Output is correct
9 Correct 63 ms 8544 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 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 324 KB Output is correct
20 Correct 2 ms 456 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 1 ms 468 KB Output is correct
26 Correct 2 ms 456 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 424 KB Output is correct
31 Correct 96 ms 8532 KB Output is correct
32 Correct 114 ms 8532 KB Output is correct
33 Correct 132 ms 8532 KB Output is correct
34 Correct 140 ms 8532 KB Output is correct
35 Correct 143 ms 8532 KB Output is correct
36 Correct 159 ms 8532 KB Output is correct
37 Correct 86 ms 8536 KB Output is correct
38 Correct 72 ms 8540 KB Output is correct
39 Correct 478 ms 8532 KB Output is correct
40 Correct 96 ms 8652 KB Output is correct
41 Correct 109 ms 8532 KB Output is correct
42 Correct 160 ms 8536 KB Output is correct
43 Correct 114 ms 8532 KB Output is correct
44 Correct 95 ms 8536 KB Output is correct
45 Correct 146 ms 8532 KB Output is correct
46 Correct 151 ms 8532 KB Output is correct
47 Correct 122 ms 8536 KB Output is correct
48 Correct 68 ms 8640 KB Output is correct
49 Correct 67 ms 8532 KB Output is correct
50 Correct 567 ms 8532 KB Output is correct
51 Correct 188 ms 8536 KB Output is correct
52 Correct 267 ms 8532 KB Output is correct
53 Correct 250 ms 8544 KB Output is correct
54 Correct 591 ms 8532 KB Output is correct
55 Correct 570 ms 8532 KB Output is correct
56 Correct 603 ms 8652 KB Output is correct
57 Correct 538 ms 8528 KB Output is correct
58 Correct 540 ms 8536 KB Output is correct