oj.uz

Submission #645228

# Submission time Handle Problem Language Result Execution time Memory
645228 2022-09-26T13:19:55 Z Trent Bank (IZhO14_bank) C++17
100 / 100
 113 ms 1488 KB 
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"

using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define open(g) string _name_ = g; freopen((_name_ + ".in").c_str(), "r", stdin); freopen((_name_ + ".out").c_str(), "w", stdout)
#define printArr(a, len) for(int asdf = 0; asdf < (len); ++asdf) cout << (a)[asdf] << ' '; cout << '\n';
#define boost() cin.sync_with_stdio(0); cin.tie(0)
#define forR(i, x) for(int i = 0; i < x; ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define all(i) i.begin(), i.end()
#define pii pair<int, int>
#define vi vector<int>
#define si set<int>
#define usi unordered_set<int>
#define mii map<int, int>
#define umii unordered_map<int, int>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")

const int MN = 20;
int n, m;
int a[MN], b[MN];
int as[MN], bs[MN];
bool can[1 << MN];

inline int tot(int mask){
    int ret = 0;
    for(int i = 0; i < m; ++i) if(mask & (1 << i)) ret += b[i];
    return ret;
}

signed main(){
    cin >> n >> m;
    forR(i, n) {
        cin >> a[i];
        as[i] = i == 0 ? a[i] : as[i-1] + a[i];
    }
    forR(i, m) {
        cin >> b[i];
        bs[i] = i == 0 ? b[i] : bs[i-1] + b[i];
    }
    can[0] = true;
    REP(i, 1, 1 << m){
        int t = tot(i);
        int las = -1;
        forR(j, n) if(as[j] < t) las = j;
        int ct = las == -1 ? t : t - as[las];
        // cout << t << ' ' << las << ' ' << ct << '\n';
        for(int j = 0; j < m && !can[i]; ++j) can[i] = ((i & (1 << j)) > 0) && (b[j] <= ct) && (can[i ^ (1 << j)]);
    }
    bool pos = false;
    for(int i = 0; i < (1 << m) && !pos; ++i) if(can[i] && tot(i) == as[n-1]) pos = true;
    cout << (pos ? "YES\n" : "NO\n");
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 69 ms 1220 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 50 ms 1264 KB Output is correct
9 Correct 40 ms 1236 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 69 ms 1220 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 50 ms 1264 KB Output is correct
9 Correct 40 ms 1236 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 2 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 2 ms 212 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 1 ms 304 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 2 ms 212 KB Output is correct
28 Correct 2 ms 212 KB Output is correct
29 Correct 2 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 57 ms 1208 KB Output is correct
32 Correct 49 ms 1308 KB Output is correct
33 Correct 102 ms 1276 KB Output is correct
34 Correct 105 ms 1488 KB Output is correct
35 Correct 108 ms 1304 KB Output is correct
36 Correct 113 ms 1228 KB Output is correct
37 Correct 69 ms 1296 KB Output is correct
38 Correct 78 ms 1212 KB Output is correct
39 Correct 26 ms 1228 KB Output is correct
40 Correct 99 ms 1384 KB Output is correct
41 Correct 113 ms 1228 KB Output is correct
42 Correct 80 ms 1268 KB Output is correct
43 Correct 100 ms 1212 KB Output is correct
44 Correct 104 ms 1260 KB Output is correct
45 Correct 67 ms 1272 KB Output is correct
46 Correct 92 ms 1216 KB Output is correct
47 Correct 98 ms 1288 KB Output is correct
48 Correct 42 ms 1308 KB Output is correct
49 Correct 68 ms 1212 KB Output is correct
50 Correct 53 ms 1300 KB Output is correct
51 Correct 81 ms 1264 KB Output is correct
52 Correct 93 ms 1324 KB Output is correct
53 Correct 56 ms 1196 KB Output is correct
54 Correct 57 ms 1244 KB Output is correct
55 Correct 52 ms 1304 KB Output is correct
56 Correct 47 ms 1228 KB Output is correct
57 Correct 49 ms 1260 KB Output is correct
58 Correct 56 ms 1296 KB Output is correct