Submission #752689

# Submission time Handle Problem Language Result Execution time Memory
752689 2023-06-03T12:24:31 Z beaconmc Bank (IZhO14_bank) C++14
100 / 100
215 ms 12576 KB
#include <bits/stdc++.h>
typedef long long ll;

#define FOR(i,x,y) for (ll i = (x); i < (y); i++)

using namespace std;

set<ll> dp[21];
map<ll, vector<ll>> idk;

//cd "/home/s/saco06/Desktop/" && g++ bank.cpp -o bank && "/home/s/saco06/Desktop/"bank
int main(){
    ll n,m;
    cin >> n >> m;
    ll sum1=0, sum2=0;
    vector<ll> lis1(n);
    vector<ll> lis2(m);
    FOR(i,0,n){
        cin >> lis1[i];
        sum1 += lis1[i];
    }
    FOR(i,0,m){
        cin >> lis2[i];
        sum2 += lis2[i];
    }

    if (sum1 > sum2){
        cout << "NO";
        return 0;
    }
    for (auto&i : lis1){
        idk[i] = {};
    }

    FOR(i, 0, (1<<m)){
        ll sum = 0;
        FOR(j,0,m){
            if (i & (1<<j)){
                sum += lis2[j];
            }
        }
        if (idk.count(sum)){
            idk[sum].push_back(i);
        }
    }
    sort(lis1.begin(), lis1.end());
    for (auto&i : idk[lis1[0]]){
        dp[0].insert(i);
    }
    FOR(i, 0, n-1){
        for (auto&j : dp[i]){
            for (auto&k : idk[lis1[i+1]]){
                if (j&k) continue;
                dp[i+1].insert(j|k);
            }
        }
    }
    if (dp[n-1].size()){
        cout << "YES";
    }else{
        cout << "NO";
    }




}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 58 ms 276 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 57 ms 600 KB Output is correct
9 Correct 57 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 58 ms 276 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 57 ms 600 KB Output is correct
9 Correct 57 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 63 ms 300 KB Output is correct
32 Correct 151 ms 1152 KB Output is correct
33 Correct 59 ms 292 KB Output is correct
34 Correct 60 ms 272 KB Output is correct
35 Correct 58 ms 288 KB Output is correct
36 Correct 63 ms 212 KB Output is correct
37 Correct 57 ms 212 KB Output is correct
38 Correct 58 ms 212 KB Output is correct
39 Correct 215 ms 12576 KB Output is correct
40 Correct 58 ms 276 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 68 ms 460 KB Output is correct
43 Correct 61 ms 292 KB Output is correct
44 Correct 57 ms 212 KB Output is correct
45 Correct 60 ms 432 KB Output is correct
46 Correct 59 ms 296 KB Output is correct
47 Correct 60 ms 272 KB Output is correct
48 Correct 58 ms 428 KB Output is correct
49 Correct 59 ms 212 KB Output is correct
50 Correct 70 ms 1816 KB Output is correct
51 Correct 63 ms 408 KB Output is correct
52 Correct 65 ms 688 KB Output is correct
53 Correct 185 ms 2480 KB Output is correct
54 Correct 71 ms 1828 KB Output is correct
55 Correct 77 ms 1704 KB Output is correct
56 Correct 131 ms 6436 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 129 ms 6440 KB Output is correct