oj.uz

Submission #945977

# Submission time Handle Problem Language Result Execution time Memory
945977 2024-03-14T09:17:28 Z iaraha Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 93300 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] = {};
signed main(){
    Ferarri
    ll t = 1;
    //cin >> t;
    //cout << setprecision(8) << fixed;
    while (t --) {
        ll n, m;
        cin >> n >> m;
        ll a[n], b[m];
        vector<ll>w[n + 5];
        vector<ll> can[n + 5];
        map<ll, ll>mp;
        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:59: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]
   59 |             for (ll j = 0; j < w[i].size(); j++) {
      |                            ~~^~~~~~~~~~~~~
bank.cpp:60:34: 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]
   60 |                 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 9 ms 4684 KB Output is correct
5 Correct 389 ms 66176 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 377 ms 92756 KB Output is correct
9 Correct 377 ms 65912 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 468 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 856 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1372 KB Output is correct
2 Correct 6 ms 3420 KB Output is correct
3 Correct 15 ms 1484 KB Output is correct
4 Correct 17 ms 1372 KB Output is correct
5 Correct 13 ms 1624 KB Output is correct
6 Correct 8 ms 1488 KB Output is correct
7 Correct 8 ms 3420 KB Output is correct
8 Correct 7 ms 3416 KB Output is correct
9 Correct 12 ms 1372 KB Output is correct
10 Correct 12 ms 1368 KB Output is correct
11 Correct 19 ms 1372 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 9 ms 4684 KB Output is correct
5 Correct 389 ms 66176 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 377 ms 92756 KB Output is correct
9 Correct 377 ms 65912 KB Output is correct
10 Correct 1 ms 344 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 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 468 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 856 KB Output is correct
20 Correct 10 ms 1372 KB Output is correct
21 Correct 6 ms 3420 KB Output is correct
22 Correct 15 ms 1484 KB Output is correct
23 Correct 17 ms 1372 KB Output is correct
24 Correct 13 ms 1624 KB Output is correct
25 Correct 8 ms 1488 KB Output is correct
26 Correct 8 ms 3420 KB Output is correct
27 Correct 7 ms 3416 KB Output is correct
28 Correct 12 ms 1372 KB Output is correct
29 Correct 12 ms 1368 KB Output is correct
30 Correct 19 ms 1372 KB Output is correct
31 Correct 502 ms 92780 KB Output is correct
32 Correct 661 ms 93300 KB Output is correct
33 Execution timed out 1034 ms 82768 KB Time limit exceeded
34 Halted 0 ms 0 KB -