oj.uz

답안 #345823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
345823 2021-01-08T07:35:06 Z acm 은행 (IZhO14_bank) C++14
100 / 100
 143 ms 35692 KB 
#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define precision     \
  cout.precision(30); \
  cerr.precision(10);
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++))
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
int n, m, a[25], b[25], c[(1 << 20)];
bitset<(1 << 20)> w[25];
vector<int> g[1000005];
void rec(int v = 1, int mask = 0) {
  if (w[v][mask]) return;
  w[v][mask] = 1;
  if (v > n) {
    cout << "YES\n";
    exit(0);
  }
  for (auto to : g[a[v]])
    if (!(mask & to)) rec(v + 1, mask | to);
}
int main() {
  speed;
  precision;
  // code
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 0; i < m; i++) cin >> b[i];
  for (int i = 1; i < (1 << m); i++)
    c[i] = c[i ^ (1 << __lg(i))] + b[__lg(i)], g[c[i]].pb(i);
  rec();
  cout << "NO\n";
  // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 15 ms 23916 KB Output is correct
4 Correct 16 ms 24172 KB Output is correct
5 Correct 36 ms 34284 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 15 ms 23936 KB Output is correct
8 Correct 33 ms 33644 KB Output is correct
9 Correct 33 ms 34032 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 15 ms 23916 KB Output is correct
4 Correct 16 ms 24172 KB Output is correct
5 Correct 36 ms 34284 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 15 ms 23936 KB Output is correct
8 Correct 33 ms 33644 KB Output is correct
9 Correct 33 ms 34032 KB Output is correct
10 Correct 15 ms 23916 KB Output is correct
11 Correct 15 ms 23916 KB Output is correct
12 Correct 15 ms 23916 KB Output is correct
13 Correct 16 ms 23812 KB Output is correct
14 Correct 15 ms 23916 KB Output is correct
15 Correct 15 ms 23916 KB Output is correct
16 Correct 15 ms 23916 KB Output is correct
17 Correct 15 ms 23916 KB Output is correct
18 Correct 15 ms 23916 KB Output is correct
19 Correct 15 ms 23916 KB Output is correct
20 Correct 16 ms 24044 KB Output is correct
21 Correct 16 ms 24044 KB Output is correct
22 Correct 16 ms 24172 KB Output is correct
23 Correct 16 ms 24044 KB Output is correct
24 Correct 16 ms 24044 KB Output is correct
25 Correct 16 ms 24044 KB Output is correct
26 Correct 16 ms 24044 KB Output is correct
27 Correct 16 ms 24044 KB Output is correct
28 Correct 19 ms 24044 KB Output is correct
29 Correct 16 ms 24044 KB Output is correct
30 Correct 15 ms 24044 KB Output is correct
31 Correct 38 ms 34412 KB Output is correct
32 Correct 33 ms 33644 KB Output is correct
33 Correct 39 ms 34156 KB Output is correct
34 Correct 44 ms 34668 KB Output is correct
35 Correct 46 ms 35436 KB Output is correct
36 Correct 45 ms 35052 KB Output is correct
37 Correct 42 ms 35308 KB Output is correct
38 Correct 40 ms 35052 KB Output is correct
39 Correct 32 ms 32960 KB Output is correct
40 Correct 39 ms 34924 KB Output is correct
41 Correct 41 ms 34412 KB Output is correct
42 Correct 40 ms 33900 KB Output is correct
43 Correct 41 ms 35692 KB Output is correct
44 Correct 48 ms 35352 KB Output is correct
45 Correct 35 ms 34028 KB Output is correct
46 Correct 39 ms 35308 KB Output is correct
47 Correct 43 ms 34796 KB Output is correct
48 Correct 35 ms 33644 KB Output is correct
49 Correct 33 ms 33772 KB Output is correct
50 Correct 33 ms 32820 KB Output is correct
51 Correct 36 ms 33900 KB Output is correct
52 Correct 33 ms 32832 KB Output is correct
53 Correct 35 ms 32948 KB Output is correct
54 Correct 33 ms 32820 KB Output is correct
55 Correct 33 ms 32820 KB Output is correct
56 Correct 33 ms 33476 KB Output is correct
57 Correct 143 ms 35008 KB Output is correct
58 Correct 33 ms 33476 KB Output is correct