oj.uz

Submission #887774

# Submission time Handle Problem Language Result Execution time Memory
887774 2023-12-15T07:56:18 Z duckindog Bank (IZhO14_bank) C++14
100 / 100
 91 ms 8652 KB 
//from duckindog wth depression
#include<bits/stdc++.h>

using namespace std;

const int N = 21,
          M = (1 << 20);
int a[N], b[N];
pair<int, int> f[M];

int32_t main() {
  cin.tie()->sync_with_stdio(0);

  if (fopen("duck.inp", "r")) {
    freopen("duck.inp", "r", stdin);
    freopen("duck.out", "w", stdout);
  }
  int n, m; cin >> n >> m;

  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= m; ++i) cin >> b[i];

  f[0] = {1, 0};
  for (int mask = 1; mask <= (1 << m) - 1; ++mask) {
    for (int i = 1; i <= m; ++i) {
      if (!((mask >> i - 1) & 1)) continue;
      int j, t; tie(j, t) = f[mask & ~(1 << i - 1)];
      if (t + b[i] > a[j]) continue;
      int nj = (t + b[i] == a[j] ? j + 1 : j);
      int nt = (nj > j ? 0 : t + b[i]);
      f[mask] = max(f[mask],  {nj, nt});
    }
    if (f[mask].first > n) {
      cout << "YES";
      return 0;
    }
  }
  cout << "NO";
}

Compilation message

bank.cpp: In function 'int32_t main()':
bank.cpp:26:24: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   26 |       if (!((mask >> i - 1) & 1)) continue;
      |                      ~~^~~
bank.cpp:27:47: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   27 |       int j, t; tie(j, t) = f[mask & ~(1 << i - 1)];
      |                                             ~~^~~
bank.cpp:15:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     freopen("duck.inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:16:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     freopen("duck.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 67 ms 496 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 82 ms 8544 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 67 ms 496 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 82 ms 8544 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 536 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 84 ms 8484 KB Output is correct
32 Correct 89 ms 8576 KB Output is correct
33 Correct 74 ms 7768 KB Output is correct
34 Correct 77 ms 1708 KB Output is correct
35 Correct 72 ms 1876 KB Output is correct
36 Correct 70 ms 644 KB Output is correct
37 Correct 73 ms 852 KB Output is correct
38 Correct 67 ms 464 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 69 ms 348 KB Output is correct
41 Correct 72 ms 604 KB Output is correct
42 Correct 89 ms 8392 KB Output is correct
43 Correct 73 ms 4180 KB Output is correct
44 Correct 72 ms 480 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 75 ms 8516 KB Output is correct
47 Correct 75 ms 596 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 71 ms 512 KB Output is correct
50 Correct 80 ms 8568 KB Output is correct
51 Correct 73 ms 1596 KB Output is correct
52 Correct 71 ms 8532 KB Output is correct
53 Correct 88 ms 8496 KB Output is correct
54 Correct 87 ms 8492 KB Output is correct
55 Correct 82 ms 8528 KB Output is correct
56 Correct 91 ms 8652 KB Output is correct
57 Correct 85 ms 8532 KB Output is correct
58 Correct 84 ms 8528 KB Output is correct