oj.uz

Submission #738299

# Submission time Handle Problem Language Result Execution time Memory
738299 2023-05-08T12:03:46 Z qrno Bank (IZhO14_bank) C++17
100 / 100
 443 ms 12996 KB 
#include <bits/stdc++.h>
using namespace std;

// Template (v1.4.3 - 2023-04-22) (codeforces:cebolinha, atcoder:edu) {{{

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")

#define int long long
#define fastio ios::sync_with_stdio(false); cin.tie(nullptr)

template<class T> using V = vector<T>;
template<class T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
using ii = pair<int, int>;
using iii = array<int, 3>;

#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define sz(x) (int) (x).size()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
#define nemo ><>
#define loop(ii, n) for (int ii = 0; ii < (n); ii++)
#define cond(c, t, f) ((c) ? (t) : (f))
#define mem(a, b) memset((a), (b), sizeof(a))
#define inbounds(x, l, r) ((l) <= (x) && (x) <= (r))
#define L1(res...) [&](auto x){ return res; }
#define L2(res...) [&](auto x, auto y){ return res; }

template<class T, class U> inline void miq(T& a, U b){ if (a > b) a = b; }
template<class T, class U> inline void maq(T& a, U b){ if (a < b) a = b; }

template<class T, class U> auto &operator>>(istream &is, pair<T, U> &p) { return is >> p.ff >> p.ss; }
template<class T, class U> auto &operator<<(ostream &os, pair<T, U> const& p) { return os << '(' << p.first << ' ' << p.second << ')'; }

const auto EMPTY_STRING = "", SEPARATOR = " ";
template<class T> auto &operator>>(istream& is, vector<T> &c) { for (auto &x : c) is >> x; return is; }
template<class T> auto &operator<<(ostream& os, vector<T> const &c) { auto sep = EMPTY_STRING; for (auto x : c) os << sep << x, sep = SEPARATOR; return os; }
template<class T> auto &operator<<(ostream& os, set<T> const &c) { auto sep = EMPTY_STRING; for (auto x : c) os << sep << x, sep = SEPARATOR; return os; }
template<class T> auto &operator<<(ostream& os, multiset<T> const &c) { auto sep = EMPTY_STRING; for (auto x : c) os << sep << x, sep = SEPARATOR; return os; }
template<class T> auto &operator<<(ostream& os, unordered_set<T> const &c) { auto sep = EMPTY_STRING; for (auto x : c) os << sep << x, sep = SEPARATOR; return os; }
template<class T> auto &operator<<(ostream& os, ordered_set<T> const &c) { auto sep = EMPTY_STRING; for (auto x : c) os << sep << x, sep = SEPARATOR; return os; }
template<class T> auto &operator<<(ostream& os, deque<T> const &c) { auto sep = EMPTY_STRING; for (auto x : c) os << sep << x, sep = SEPARATOR; return os; }
template<class K, class V> auto &operator<<(ostream& os, map<K,V> const &c) { auto sep = EMPTY_STRING; for (auto x : c) os << sep << x, sep = SEPARATOR; return os; }
template<class K, class V> auto &operator<<(ostream& os, unordered_map<K,V> const &c) { auto sep = EMPTY_STRING; for (auto x : c) os << sep << x, sep = SEPARATOR; return os; }

template<class... A> void in(A &...a) { ((cin >> a), ...); }
template<class... A> void out(A const&... a) { auto sep = EMPTY_STRING; ((cout << sep << a, sep = SEPARATOR), ...); cout << '\n'; }
template<class... A> void print(A const&... a) { ((cout << a), ...); }
#define var(x) "[", #x, " ", x, "] "
template<class... A> void db(A const&... a) { ((cout << (a)), ...); cout << endl; }
//}}}

const int MAXN = 20;
const int MAXS = 1000 + 8;

// This will probably TLE in the case that there
// are many people with the same sum
auto main() -> signed {
  fastio;

  int n, m; in(n, m);
  V<int> a(n), b(m); in(a, b);

  V<V<int>> ways(MAXS);
  for (int mask = 0; mask < 1 << m; mask++) {
    int sum = 0;
    for (int bit = 0; bit < m; bit++) {
      if (mask & (1 << bit)) {
        sum += b[bit];
      }
    }
    if (sum < MAXS) ways[sum].pb(mask);
  }

  vector reach(n+1, V<bool>(1<<m));
  reach[0][0] = true;

  for (int i = 0; i < n; i++) {
    for (int mask = 0; mask < 1 << m; mask++) {
      if (!reach[i][mask]) continue;
      for (auto sum_mask : ways[a[i]]) {
        if (mask & sum_mask) continue;
        reach[i+1][mask | sum_mask] = true;
      }
    }
  }

  if (any_of(all(reach[n]), L1(x))) out("YES");
  else out("NO");
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 52 ms 12688 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 47 ms 11420 KB Output is correct
9 Correct 48 ms 12044 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 2 ms 572 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 2 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 480 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 52 ms 12688 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 47 ms 11420 KB Output is correct
9 Correct 48 ms 12044 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 2 ms 572 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 2 ms 324 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 316 KB Output is correct
30 Correct 1 ms 480 KB Output is correct
31 Correct 47 ms 10700 KB Output is correct
32 Correct 110 ms 12336 KB Output is correct
33 Correct 36 ms 3028 KB Output is correct
34 Correct 44 ms 1868 KB Output is correct
35 Correct 40 ms 1976 KB Output is correct
36 Correct 48 ms 3164 KB Output is correct
37 Correct 34 ms 1100 KB Output is correct
38 Correct 32 ms 1360 KB Output is correct
39 Correct 59 ms 10224 KB Output is correct
40 Correct 44 ms 5296 KB Output is correct
41 Correct 51 ms 4188 KB Output is correct
42 Correct 56 ms 11796 KB Output is correct
43 Correct 47 ms 5268 KB Output is correct
44 Correct 43 ms 2528 KB Output is correct
45 Correct 46 ms 12592 KB Output is correct
46 Correct 44 ms 7372 KB Output is correct
47 Correct 40 ms 2508 KB Output is correct
48 Correct 49 ms 11660 KB Output is correct
49 Correct 58 ms 12008 KB Output is correct
50 Correct 142 ms 11896 KB Output is correct
51 Correct 54 ms 12996 KB Output is correct
52 Correct 55 ms 10724 KB Output is correct
53 Correct 443 ms 11128 KB Output is correct
54 Correct 163 ms 11888 KB Output is correct
55 Correct 154 ms 11892 KB Output is correct
56 Correct 136 ms 12284 KB Output is correct
57 Correct 144 ms 12372 KB Output is correct
58 Correct 155 ms 12244 KB Output is correct