oj.uz

Submission #42937

# Submission time Handle Problem Language Result Execution time Memory
42937 2018-03-06T11:21:47 Z funcsr Bank (IZhO14_bank) C++14
100 / 100
 729 ms 86908 KB 
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int N, M;
int A[20], B[20];
int dp[21][1<<20];
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> M;
  rep(i, N) cin >> A[i];
  rep(i, M) cin >> B[i];
  rep(i, N+1) rep(j, 1<<M) dp[i][j] = -1;
  dp[0][0] = 0;
  rep(i, N) {
    rep(S, 1<<M) {
      if (dp[i][S] == -1) continue;
      rep(t, M) if (((S>>t)&1) == 0) dp[i][S|(1<<t)] = dp[i][S]+B[t];
    }
    rep(S, 1<<M) if (dp[i][S] == A[i]) dp[i+1][S] = 0;
  }
  bool ok = false;
  rep(S, 1<<M) if (dp[N][S] == 0) ok = true;
  if (ok) cout << "YES\n";
  else cout << "NO\n";
  return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 576 KB Output is correct
4 Correct 4 ms 768 KB Output is correct
5 Correct 79 ms 8764 KB Output is correct
6 Correct 2 ms 8764 KB Output is correct
7 Correct 2 ms 8764 KB Output is correct
8 Correct 78 ms 8764 KB Output is correct
9 Correct 78 ms 8852 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 576 KB Output is correct
4 Correct 4 ms 768 KB Output is correct
5 Correct 79 ms 8764 KB Output is correct
6 Correct 2 ms 8764 KB Output is correct
7 Correct 2 ms 8764 KB Output is correct
8 Correct 78 ms 8764 KB Output is correct
9 Correct 78 ms 8852 KB Output is correct
10 Correct 2 ms 8852 KB Output is correct
11 Correct 2 ms 8852 KB Output is correct
12 Correct 2 ms 8852 KB Output is correct
13 Correct 2 ms 8852 KB Output is correct
14 Correct 2 ms 8852 KB Output is correct
15 Correct 2 ms 8852 KB Output is correct
16 Correct 2 ms 8852 KB Output is correct
17 Correct 2 ms 8852 KB Output is correct
18 Correct 2 ms 8852 KB Output is correct
19 Correct 2 ms 8852 KB Output is correct
20 Correct 4 ms 8852 KB Output is correct
21 Correct 3 ms 8852 KB Output is correct
22 Correct 4 ms 8852 KB Output is correct
23 Correct 4 ms 8852 KB Output is correct
24 Correct 4 ms 8852 KB Output is correct
25 Correct 3 ms 8852 KB Output is correct
26 Correct 3 ms 8852 KB Output is correct
27 Correct 3 ms 8852 KB Output is correct
28 Correct 4 ms 8852 KB Output is correct
29 Correct 4 ms 8852 KB Output is correct
30 Correct 4 ms 8852 KB Output is correct
31 Correct 111 ms 12964 KB Output is correct
32 Correct 133 ms 17068 KB Output is correct
33 Correct 169 ms 33532 KB Output is correct
34 Correct 182 ms 45692 KB Output is correct
35 Correct 188 ms 49916 KB Output is correct
36 Correct 240 ms 86908 KB Output is correct
37 Correct 105 ms 86908 KB Output is correct
38 Correct 94 ms 86908 KB Output is correct
39 Correct 581 ms 86908 KB Output is correct
40 Correct 139 ms 86908 KB Output is correct
41 Correct 189 ms 86908 KB Output is correct
42 Correct 192 ms 86908 KB Output is correct
43 Correct 152 ms 86908 KB Output is correct
44 Correct 146 ms 86908 KB Output is correct
45 Correct 174 ms 86908 KB Output is correct
46 Correct 168 ms 86908 KB Output is correct
47 Correct 183 ms 86908 KB Output is correct
48 Correct 79 ms 86908 KB Output is correct
49 Correct 78 ms 86908 KB Output is correct
50 Correct 677 ms 86908 KB Output is correct
51 Correct 249 ms 86908 KB Output is correct
52 Correct 319 ms 86908 KB Output is correct
53 Correct 313 ms 86908 KB Output is correct
54 Correct 716 ms 86908 KB Output is correct
55 Correct 682 ms 86908 KB Output is correct
56 Correct 729 ms 86908 KB Output is correct
57 Correct 670 ms 86908 KB Output is correct
58 Correct 685 ms 86908 KB Output is correct