oj.uz

답안 #293412

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
293412 2020-09-08T03:55:40 Z VROOM_VARUN 은행 (IZhO14_bank) C++14
100 / 100
 81 ms 8704 KB 
/*
ID: varunra2
LANG: C++
TASK: izhobank
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int main() {

  cin.sync_with_stdio(0);
  cin.tie(0);

  int n, m;
  cin >> n >> m;
  VI a(n);
  VI b(m);

  rep(i, 0, n) cin >> a[i];
  rep(j, 0, m) cin >> b[j];
  sort(all(a));
  sort(all(b));


  VII dp((1 << m), MP(-1, -1));
  dp[0] = MP(0, 0);

  bool ret = false;

  for (int i = 0; i < (1 << m); i++) {
    if (dp[i] == MP(-1, -1)) continue;

    if (dp[i] == MP(n, 0)) {
      ret = true;
      break;
    }

    int xx, yy;
    tie(xx, yy) = dp[i];

    for (int j = 0; j < m; j++) {
      if ((1 << j) & i) continue;
      if (yy + b[j] > a[xx]) continue;
      if (yy + b[j] == a[xx])
        dp[i | (1 << j)] = MP(xx + 1, 0);
      else
        dp[i | (1 << j)] = MP(xx, yy + b[j]);
    }
  }

  if (ret) {
    cout << "YES" << endl;
  }

  else
    cout << "NO" << endl;

  return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 7 ms 8576 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 7 ms 8576 KB Output is correct
9 Correct 81 ms 8576 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 7 ms 8576 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 7 ms 8576 KB Output is correct
9 Correct 81 ms 8576 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 640 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 72 ms 8696 KB Output is correct
32 Correct 71 ms 8576 KB Output is correct
33 Correct 9 ms 8576 KB Output is correct
34 Correct 7 ms 8576 KB Output is correct
35 Correct 7 ms 8576 KB Output is correct
36 Correct 7 ms 8576 KB Output is correct
37 Correct 7 ms 8576 KB Output is correct
38 Correct 8 ms 8576 KB Output is correct
39 Correct 6 ms 8576 KB Output is correct
40 Correct 7 ms 8704 KB Output is correct
41 Correct 7 ms 8576 KB Output is correct
42 Correct 45 ms 8616 KB Output is correct
43 Correct 8 ms 8576 KB Output is correct
44 Correct 7 ms 8576 KB Output is correct
45 Correct 10 ms 8576 KB Output is correct
46 Correct 11 ms 8576 KB Output is correct
47 Correct 7 ms 8576 KB Output is correct
48 Correct 6 ms 8576 KB Output is correct
49 Correct 7 ms 8576 KB Output is correct
50 Correct 9 ms 8576 KB Output is correct
51 Correct 9 ms 8576 KB Output is correct
52 Correct 10 ms 8576 KB Output is correct
53 Correct 21 ms 8576 KB Output is correct
54 Correct 9 ms 8576 KB Output is correct
55 Correct 9 ms 8576 KB Output is correct
56 Correct 16 ms 8576 KB Output is correct
57 Correct 17 ms 8704 KB Output is correct
58 Correct 16 ms 8576 KB Output is correct