oj.uz

Submission #686478

# Submission time Handle Problem Language Result Execution time Memory
686478 2023-01-25T10:30:46 Z Chal1shkan Bank (IZhO14_bank) C++14
100 / 100
 692 ms 19540 KB 
# include <bits/stdc++.h>

# define pb push_back
# define ff first
# define ss second
# define nl "\n"
# define sz(x) ((int)(x).size())
# define deb(x) cerr << #x  << " = " << x << endl; 

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const ll maxn = 1e6 + 1e5;
const ll inf = 1e18 + 0;
const ll mod = 1e9 + 7;
const ll dx[] = {-1, 1, 0, 0};
const ll dy[] = {0, 0, -1, 1};

using namespace std;

int n, m;
vector <int> x[23];
int inv[maxn];
int a[23];
int b[23];
bool dp[23][maxn];

void ma1n (/* SABR */)
{
    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 mask = 0; mask < (1LL << m); ++mask)
    {
        int sum = 0;
        for (int i = 0; i < m; ++i)
        {
            if (mask & (1LL << i)) sum += b[i + 1];
            else inv[mask] |= (1LL << i);
        }
        for (int i = 1; i <= n; ++i)
        {
            if (sum == a[i]) x[i].pb(mask);
        }
    }
    dp[0][0] = 1;
    for (int i = 1; i <= n; ++i)
    {
        for (int j : x[i])
        {
            int mask = inv[j];
            for (int sub = mask; ; sub = (sub - 1) & mask)
            {
                if (dp[i - 1][sub])
                {
                    dp[i][j | sub] = 1;
                }
                if (sub == 0) break;
            }
        }
    }
    for (int mask = 0; mask < (1LL << m); ++mask)
    {
        if (dp[n][mask]) 
        {
            cout << "YES" << nl;
            return;
        }
    }
    cout << "NO" << nl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
//  freopen("file.in", "r", stdin);
//  freopen("file.out", "w", stdout);
    int ttt = 1;
//  cin >> ttt;
    for (int test = 1; test <= ttt; ++test)
    {
//      cout << "Case " << test << ":" << ' ';
        ma1n();
    }
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 60 ms 4388 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 70 ms 5428 KB Output is correct
9 Correct 61 ms 4428 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 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 324 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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 2 ms 324 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 464 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 60 ms 4388 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 70 ms 5428 KB Output is correct
9 Correct 61 ms 4428 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 324 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 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 452 KB Output is correct
23 Correct 2 ms 324 KB Output is correct
24 Correct 2 ms 328 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 69 ms 5100 KB Output is correct
32 Correct 127 ms 6472 KB Output is correct
33 Correct 66 ms 5892 KB Output is correct
34 Correct 56 ms 4512 KB Output is correct
35 Correct 55 ms 4428 KB Output is correct
36 Correct 74 ms 4504 KB Output is correct
37 Correct 61 ms 4372 KB Output is correct
38 Correct 60 ms 4416 KB Output is correct
39 Correct 123 ms 9680 KB Output is correct
40 Correct 54 ms 4424 KB Output is correct
41 Correct 67 ms 4416 KB Output is correct
42 Correct 103 ms 7764 KB Output is correct
43 Correct 63 ms 5104 KB Output is correct
44 Correct 68 ms 4416 KB Output is correct
45 Correct 81 ms 6860 KB Output is correct
46 Correct 75 ms 6280 KB Output is correct
47 Correct 71 ms 4528 KB Output is correct
48 Correct 76 ms 5376 KB Output is correct
49 Correct 61 ms 4300 KB Output is correct
50 Correct 304 ms 19540 KB Output is correct
51 Correct 159 ms 4556 KB Output is correct
52 Correct 270 ms 7612 KB Output is correct
53 Correct 692 ms 12212 KB Output is correct
54 Correct 306 ms 19076 KB Output is correct
55 Correct 296 ms 19516 KB Output is correct
56 Correct 312 ms 19528 KB Output is correct
57 Correct 321 ms 18664 KB Output is correct
58 Correct 348 ms 18584 KB Output is correct