oj.uz

Submission #945993

# Submission time Handle Problem Language Result Execution time Memory
945993 2024-03-14T09:22:45 Z iaraha Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 76972 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] = {};
map<int, int> mp;
signed main(){
    Ferarri
    ll n, m;
    cin >> n >> m;
    ll a[n], b[m];
    vector<ll>w[n + 5];
    vector<ll> can[n + 5];
    for (ll i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (ll i = 0; i < m; i++) {
        cin >> b[i];
    }
    for (ll i = 0; i < (1 << m); i++) {
        ll s = 0;
        for (ll j = 0; j < m; j++) {
            if (i & (1 << (m - j - 1))) {
                s += b[j];
            }
        }
        mp[i] = s;
    }
    bool chk = 0;
    for (ll i = 0; i < n; i++) {
        for (ll 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 (ll i = 1; i < n; i++) {
        for (ll j = 0; j < w[i].size(); j++) {
            for (ll 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:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |         for (ll j = 0; j < w[i].size(); j++) {
      |                        ~~^~~~~~~~~~~~~
bank.cpp:56:30: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |             for (ll k = 0; k < can[i - 1].size(); k++) {
      |                            ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 8 ms 3932 KB Output is correct
5 Correct 318 ms 49680 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 355 ms 76412 KB Output is correct
9 Correct 319 ms 49488 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1116 KB Output is correct
2 Correct 6 ms 3300 KB Output is correct
3 Correct 11 ms 1116 KB Output is correct
4 Correct 16 ms 1224 KB Output is correct
5 Correct 11 ms 1116 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 8 ms 3072 KB Output is correct
8 Correct 6 ms 3164 KB Output is correct
9 Correct 9 ms 1232 KB Output is correct
10 Correct 10 ms 1116 KB Output is correct
11 Correct 14 ms 1228 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 8 ms 3932 KB Output is correct
5 Correct 318 ms 49680 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 355 ms 76412 KB Output is correct
9 Correct 319 ms 49488 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 9 ms 1116 KB Output is correct
21 Correct 6 ms 3300 KB Output is correct
22 Correct 11 ms 1116 KB Output is correct
23 Correct 16 ms 1224 KB Output is correct
24 Correct 11 ms 1116 KB Output is correct
25 Correct 7 ms 1116 KB Output is correct
26 Correct 8 ms 3072 KB Output is correct
27 Correct 6 ms 3164 KB Output is correct
28 Correct 9 ms 1232 KB Output is correct
29 Correct 10 ms 1116 KB Output is correct
30 Correct 14 ms 1228 KB Output is correct
31 Correct 416 ms 76244 KB Output is correct
32 Correct 559 ms 76972 KB Output is correct
33 Correct 888 ms 66376 KB Output is correct
34 Execution timed out 1052 ms 51536 KB Time limit exceeded
35 Halted 0 ms 0 KB -