oj.uz

Submission #335646

# Submission time Handle Problem Language Result Execution time Memory
335646 2020-12-13T14:35:06 Z Olerinskiy Bank (IZhO14_bank) C++14
100 / 100
 540 ms 12868 KB 
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert> 
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>
#include <chrono>
#include <stack>

using namespace std;

// #define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double

ostream& operator<< (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << " ";
    return out;
}

istream& operator>> (istream& in, pii& b) {
    in >> b.first >> b.second;
    return in;
}

ostream& operator<< (ostream& out, const pii& b) {
    out << "{" << b.first << ", " << b.second << "}";
    return out;
}

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << endl;
    // const int INF = 1e18;
    // const int mod = 2600000069;
    // const int p = 10;
#else
    #define dbg(x) 57
    // const int INF = 1e18;
    // const int mod = 2600000069;  
    // const int p = 179;
#endif

const ld PI = 4 * atan(1);

#define time clock() / (double) CLOCKS_PER_SEC

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")  
// #pragma GCC optimize("section-anchors")
// #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
// #pragma GCC optimize("vpt")
// #pragma GCC optimize("rename-registers")
// #pragma GCC optimize("move-loop-invariants")
// #pragma GCC optimize("unswitch-loops")
// #pragma GCC optimize("function-sections")
// #pragma GCC optimize("data-sections")

mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MAXN = 20;

int n, m;
int a[MAXN], b[MAXN];
vector<int> go[MAXN];
int mx[(1 << MAXN)], lft[(1 << MAXN)], suf[MAXN], ppc[(1 << MAXN)];

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    int suma = 0, sumb = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        suma += a[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> b[i];
        sumb += b[i];
    }
    suf[n - 1] = a[n - 1];
    for (int i = n - 2; i >= 0; i--) {
        suf[i] = suf[i + 1] + a[i];
    }
    if (n > m || suma > sumb) {
        cout << "NO\n";
        return 0;
    }
    for (int i = 0; i < (1 << m); i++) {
        ppc[i] = __builtin_popcount(i);
        int sum = 0;
        for (int j = 0; j < m; j++) {
            if ((i >> j) & 1) {
                sum += b[j];
            }
        }
        for (int j = 0; j < n; j++) {
            if (sum == a[j]) {
                go[j].pb(i);
            }
        }
        lft[i] = sumb - sum;
    }
    for (int i = 0; i < (1 << m); i++) {
        if (mx[i] == n) {
            cout << "YES\n";
            return 0;
        }
        if (suf[mx[i]] > lft[i]) continue;
        for (auto mask : go[mx[i]]) {
            if (!(mask & i)) {
                chkmax(mx[i | mask], mx[i] + 1);
            }
        }
    }
    cout << "NO\n";
}
/*

*/

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 76 ms 8556 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 95 ms 12652 KB Output is correct
9 Correct 72 ms 8556 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 76 ms 8556 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 95 ms 12652 KB Output is correct
9 Correct 72 ms 8556 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 2 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 3 ms 492 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 34 ms 492 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 2 ms 492 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 80 ms 10756 KB Output is correct
32 Correct 174 ms 12832 KB Output is correct
33 Correct 81 ms 9796 KB Output is correct
34 Correct 83 ms 8684 KB Output is correct
35 Correct 84 ms 8684 KB Output is correct
36 Correct 94 ms 8684 KB Output is correct
37 Correct 88 ms 12652 KB Output is correct
38 Correct 79 ms 8556 KB Output is correct
39 Correct 81 ms 8556 KB Output is correct
40 Correct 96 ms 12640 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 86 ms 12652 KB Output is correct
43 Correct 81 ms 9068 KB Output is correct
44 Correct 88 ms 8556 KB Output is correct
45 Correct 81 ms 10732 KB Output is correct
46 Correct 92 ms 10988 KB Output is correct
47 Correct 89 ms 8556 KB Output is correct
48 Correct 80 ms 12180 KB Output is correct
49 Correct 73 ms 8556 KB Output is correct
50 Correct 142 ms 12780 KB Output is correct
51 Correct 86 ms 8812 KB Output is correct
52 Correct 90 ms 12396 KB Output is correct
53 Correct 540 ms 12868 KB Output is correct
54 Correct 189 ms 12652 KB Output is correct
55 Correct 141 ms 12652 KB Output is correct
56 Correct 129 ms 12652 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 140 ms 12652 KB Output is correct