oj.uz

Submission #945986

# Submission time Handle Problem Language Result Execution time Memory
945986 2024-03-14T09:20:57 Z iaraha Bank (IZhO14_bank) C++14
100 / 100
 287 ms 36556 KB 
// Эксперт до 15.04.2024 Насиб
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define pf push_front
#define pof pop_front
#define pb push_back
#define pob pop_back
#define fi first
#define se second
#define Yes cout << "YES \n"
#define No cout << "NO \n"
#define Ferarri ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
//////////////////// the code below ////////////////////
bool dp[(1 << 21) + 5][25] = {};
int mp[(1 << 21) + 5] = {};
signed main(){
    Ferarri
    int n, m;
    cin >> n >> m;
    int a[n], b[m];
    vector<int>w[n + 5];
    vector<int> can[n + 5];
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> b[i];
    }
    for (int i = 0; i < (1 << m); i++) {
        int s = 0;
        for (int j = 0; j < m; j++) {
            if (i & (1 << (m - j - 1))) {
                s += b[j];
            }
        }
        mp[i] = s;
    }
    bool chk = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < (1 << m); j++) {
            if (mp[j] == a[i]) {
                w[i].pb(j);
                if (i == 0) {
                    can[0].push_back(j);
                    dp[j][i] = 1;
                    if (n == 1) chk = 1;
                }
            }
        }
    }
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < w[i].size(); j++) {
            for (int k = 0; k < can[i - 1].size(); k++) {
                if (!(w[i][j] & can[i - 1][k]) && !dp[w[i][j] + can[i - 1][k]][i]) {
                    dp[w[i][j] + can[i - 1][k]][i] = 1;
                    can[i].push_back(w[i][j] + can[i - 1][k]);
                    if (i == n - 1)
                        chk = 1;
                }
            }
        }
    }
    if (chk) Yes;
    else No;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:55:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |         for (int j = 0; j < w[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~
bank.cpp:56:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |             for (int k = 0; k < can[i - 1].size(); k++) {
      |                             ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 45 ms 4744 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 48 ms 33796 KB Output is correct
9 Correct 51 ms 4728 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2520 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 45 ms 4744 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 48 ms 33796 KB Output is correct
9 Correct 51 ms 4728 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2520 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 4440 KB Output is correct
27 Correct 2 ms 4444 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 50 ms 33408 KB Output is correct
32 Correct 94 ms 33616 KB Output is correct
33 Correct 51 ms 23424 KB Output is correct
34 Correct 50 ms 8784 KB Output is correct
35 Correct 51 ms 8784 KB Output is correct
36 Correct 62 ms 6736 KB Output is correct
37 Correct 46 ms 12884 KB Output is correct
38 Correct 46 ms 4744 KB Output is correct
39 Correct 67 ms 30592 KB Output is correct
40 Correct 50 ms 6736 KB Output is correct
41 Correct 57 ms 6772 KB Output is correct
42 Correct 53 ms 29012 KB Output is correct
43 Correct 56 ms 15188 KB Output is correct
44 Correct 53 ms 4700 KB Output is correct
45 Correct 49 ms 29040 KB Output is correct
46 Correct 50 ms 27732 KB Output is correct
47 Correct 54 ms 8788 KB Output is correct
48 Correct 47 ms 33364 KB Output is correct
49 Correct 44 ms 4484 KB Output is correct
50 Correct 118 ms 36092 KB Output is correct
51 Correct 56 ms 30036 KB Output is correct
52 Correct 61 ms 11860 KB Output is correct
53 Correct 287 ms 33404 KB Output is correct
54 Correct 144 ms 35628 KB Output is correct
55 Correct 128 ms 35916 KB Output is correct
56 Correct 127 ms 36548 KB Output is correct
57 Correct 125 ms 36556 KB Output is correct
58 Correct 120 ms 36548 KB Output is correct