oj.uz

Submission #342041

# Submission time Handle Problem Language Result Execution time Memory
342041 2021-01-01T07:33:06 Z casperwang Bank (IZhO14_bank) C++14
100 / 100
 148 ms 8684 KB 
#include <bits/stdc++.h>
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
template<class T> bool chmin(T &a, T b) { return b < a ? (a = b, true) : false; }
template<class T> bool chmax(T &a, T b) { return b > a ? (a = b, true) : false; }
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template<class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int MAXN = 20;
int n, m;
int a[MAXN];
int b[MAXN];
pii dp[1<<MAXN];
bool tf;

signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < m; i++) {
    cin >> b[i];
  }
  sort(b, b+m, greater<int>());
  for (int i = 1; i < (1<<m); i++) {
    dp[i] = pii(-1, -1);
    for (int j = 0; j < m; j++) {
      if (!(i&(1<<j))) continue;
      pii tmp = dp[i^(1<<j)];
      if (tmp.ss + b[j] == a[tmp.ff]) {
        tmp.ff++, tmp.ss = 0;
      } else if (tmp.ff < n && tmp.ss + b[j] < a[tmp.ff]) {
        tmp.ss += b[j];
      }
      dp[i] = max(dp[i], tmp);
    }
  }
  for (int i = 1; i < (1<<m); i++) {
    if (dp[i].ff == n) tf = 1;
  }
  cout << (tf ? "YES\n" : "NO\n");
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 94 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 117 ms 8548 KB Output is correct
9 Correct 102 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 1 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 2 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 512 KB Output is correct
8 Correct 2 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 2 ms 492 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 94 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 117 ms 8548 KB Output is correct
9 Correct 102 ms 8556 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 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 2 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 512 KB Output is correct
27 Correct 2 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 2 ms 492 KB Output is correct
31 Correct 130 ms 8684 KB Output is correct
32 Correct 122 ms 8552 KB Output is correct
33 Correct 117 ms 8556 KB Output is correct
34 Correct 101 ms 8556 KB Output is correct
35 Correct 103 ms 8556 KB Output is correct
36 Correct 95 ms 8556 KB Output is correct
37 Correct 97 ms 8604 KB Output is correct
38 Correct 93 ms 8556 KB Output is correct
39 Correct 94 ms 8556 KB Output is correct
40 Correct 95 ms 8556 KB Output is correct
41 Correct 93 ms 8556 KB Output is correct
42 Correct 148 ms 8556 KB Output is correct
43 Correct 105 ms 8556 KB Output is correct
44 Correct 92 ms 8556 KB Output is correct
45 Correct 148 ms 8556 KB Output is correct
46 Correct 133 ms 8504 KB Output is correct
47 Correct 93 ms 8556 KB Output is correct
48 Correct 114 ms 8576 KB Output is correct
49 Correct 91 ms 8556 KB Output is correct
50 Correct 102 ms 8556 KB Output is correct
51 Correct 106 ms 8684 KB Output is correct
52 Correct 107 ms 8556 KB Output is correct
53 Correct 122 ms 8556 KB Output is correct
54 Correct 113 ms 8556 KB Output is correct
55 Correct 103 ms 8556 KB Output is correct
56 Correct 97 ms 8684 KB Output is correct
57 Correct 101 ms 8556 KB Output is correct
58 Correct 99 ms 8556 KB Output is correct