oj.uz

Submission #496091

# Submission time Handle Problem Language Result Execution time Memory
496091 2021-12-20T16:02:30 Z shmad Bank (IZhO14_bank) C++14
100 / 100
 138 ms 25172 KB 
    #include <bits/stdc++.h>
     
    #define int long long
    #define vt vector
    #define pb push_back
    #define all(x) (x).begin(), (x).end()
    #define sz(x) (int)(x).size()
    #define ff first
    #define ss second
    #define dbg(x) cerr << #x << " = " << x << '\n'
     
    using namespace std;
    using ll = long long;
    using pii = pair<int, int>;
    using vvi = vt< vt<int> >;
     
    const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18 + 7, B = 500, LIM = (1ll << 20);
     
    int n, m;
    vt<int> dp(LIM, -1), lft(LIM, -1), ans;
     
    bool bit (int x, int i) {
      return (x >> i & 1);
    }
     
    bool check (int x) {
      return (x == n);
    }
     
    void solve () {
      cin >> n >> m;
      vt<int> a(n), b(m);
      for (int &i: a) cin >> i;
      for (int &i: b) cin >> i;
      dp[0] = lft[0] = 0;
      for (int mask = 0; mask < (1 << m); mask++) {
        for (int i = 0; i < m; i++) {
          if (bit(mask, i)) {
            int mask1 = mask ^ (1 << i);
            if (dp[mask1] == -1) continue;
            int cur = lft[mask1] + b[i], j = dp[mask1];
            if (cur > a[j]) continue;
            dp[mask] = dp[mask1] + (cur == a[j]);
            if (cur < a[j]) lft[mask] = cur;
            if (cur == a[j]) lft[mask] = 0;
          }
        }
        ans.pb(dp[mask]);
      }                                
      cout << (any_of(all(ans), check) ? "YES" : "NO");
      cout << '\n';
    }
     
    bool testcases = 0;
     
    signed main() {
      cin.tie(0) -> sync_with_stdio(0);
      int test = 1;
      if (testcases) cin >> test;
      for (int cs = 1; cs <= test; cs++) {
        solve();
      }
    }

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16728 KB Output is correct
2 Correct 8 ms 16716 KB Output is correct
3 Correct 7 ms 16716 KB Output is correct
4 Correct 11 ms 17124 KB Output is correct
5 Correct 77 ms 25064 KB Output is correct
6 Correct 7 ms 16716 KB Output is correct
7 Correct 7 ms 16752 KB Output is correct
8 Correct 93 ms 25040 KB Output is correct
9 Correct 107 ms 25012 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16728 KB Output is correct
2 Correct 8 ms 16716 KB Output is correct
3 Correct 7 ms 16716 KB Output is correct
4 Correct 11 ms 17124 KB Output is correct
5 Correct 77 ms 25064 KB Output is correct
6 Correct 7 ms 16716 KB Output is correct
7 Correct 7 ms 16752 KB Output is correct
8 Correct 93 ms 25040 KB Output is correct
9 Correct 107 ms 25012 KB Output is correct
10 Correct 8 ms 16716 KB Output is correct
11 Correct 10 ms 16716 KB Output is correct
12 Correct 7 ms 16716 KB Output is correct
13 Correct 7 ms 16716 KB Output is correct
14 Correct 7 ms 16656 KB Output is correct
15 Correct 8 ms 16656 KB Output is correct
16 Correct 8 ms 16716 KB Output is correct
17 Correct 7 ms 16752 KB Output is correct
18 Correct 8 ms 16716 KB Output is correct
19 Correct 8 ms 16716 KB Output is correct
20 Correct 7 ms 16948 KB Output is correct
21 Correct 9 ms 16972 KB Output is correct
22 Correct 8 ms 16972 KB Output is correct
23 Correct 8 ms 16972 KB Output is correct
24 Correct 11 ms 16972 KB Output is correct
25 Correct 9 ms 16972 KB Output is correct
26 Correct 10 ms 16972 KB Output is correct
27 Correct 9 ms 16972 KB Output is correct
28 Correct 9 ms 16972 KB Output is correct
29 Correct 8 ms 16972 KB Output is correct
30 Correct 8 ms 16972 KB Output is correct
31 Correct 108 ms 25152 KB Output is correct
32 Correct 118 ms 25020 KB Output is correct
33 Correct 91 ms 25044 KB Output is correct
34 Correct 85 ms 24996 KB Output is correct
35 Correct 73 ms 25008 KB Output is correct
36 Correct 73 ms 25076 KB Output is correct
37 Correct 78 ms 24984 KB Output is correct
38 Correct 81 ms 25052 KB Output is correct
39 Correct 108 ms 25040 KB Output is correct
40 Correct 78 ms 25044 KB Output is correct
41 Correct 80 ms 25160 KB Output is correct
42 Correct 128 ms 25008 KB Output is correct
43 Correct 83 ms 24964 KB Output is correct
44 Correct 78 ms 25076 KB Output is correct
45 Correct 133 ms 25144 KB Output is correct
46 Correct 103 ms 25032 KB Output is correct
47 Correct 95 ms 25008 KB Output is correct
48 Correct 95 ms 25064 KB Output is correct
49 Correct 81 ms 25016 KB Output is correct
50 Correct 103 ms 25012 KB Output is correct
51 Correct 86 ms 25080 KB Output is correct
52 Correct 84 ms 24972 KB Output is correct
53 Correct 138 ms 25012 KB Output is correct
54 Correct 116 ms 25004 KB Output is correct
55 Correct 103 ms 25048 KB Output is correct
56 Correct 101 ms 25052 KB Output is correct
57 Correct 107 ms 25172 KB Output is correct
58 Correct 105 ms 24988 KB Output is correct