oj.uz

답안 #405127

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
405127 2021-05-15T18:09:16 Z Falcon 은행 (IZhO14_bank) C++17
100 / 100
 171 ms 11156 KB 
#include <bits/stdc++.h>

#ifdef DEBUG
#include "debug.hpp"
#endif

using namespace std;

#define all(c)              (c).begin(), (c).end()
#define rall(c)             (c).rbegin(), (c).rend()
#define traverse(c, it)     for(auto it = (c).begin(); it != (c).end(); ++it)
#define rep(i, N)           for(int i = 0; i < (N); ++i)
#define rrep(i, N)          for(int i = (N) - 1; i >= 0; --i)
#define rep1(i, N)          for(int i = 1; i <= (N); ++i)
#define rep2(i, s, e)       for(int i = (s); i <= (e); ++i)

#ifdef DEBUG
#define debug(x...)         { \
                            ++dbg::depth; \
                            string dbg_vals = dbg::to_string(x); \
                            --dbg::depth; \
                            dbg::fprint(__func__, __LINE__, #x, dbg_vals); \
                            }

#define light_debug(x)      { \
                            dbg::light = true; \
                            dbg::dout << __func__ << ":" << __LINE__; \
                            dbg::dout << "  " << #x << " = " << x << endl; \
                            dbg::light = false; \
                            }

#else
#define debug(x...)         42
#define light_debug(x)      42
#endif


using ll = long long;

template<typename T>
inline T& ckmin(T& a, T b) { return a = a > b ? b : a; }

template<typename T>
inline T& ckmax(T& a, T b) { return a = a < b ? b : a; }

template<class Fun>
class y_combinator_result {
    Fun fun_;
public:
    template<class T>
    explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

    template<class ...Args>
    decltype(auto) operator()(Args &&...args) {
        return fun_(std::ref(*this), std::forward<Args>(args)...);
    }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
    return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m; cin >> n >> m;
    vector<int> a(n), b(m);
    rep(i, n) cin >> a[i];
    rep(i, m) cin >> b[i];
    sort(all(b));

    vector<vector<bool>> dp(n + 1, vector<bool>(1 << m));
    vector<vector<bool>> ch(n + 1, vector<bool>(1 << m));
    rep(i, 1 << m) dp[0][i] = true, ch[0][i] = true;

    vector<vector<int>> sums(1001);
    rep(c, 1 << m) {
        int s{};
        rep(i, m)
            if(c & (1 << i)) s += b[i];
        if(s <= 1000) sums[s].push_back(c);
    }

    y_combinator([&](auto rec, int i, int x) -> bool {
            if(ch[i][x]) return dp[i][x];
            ch[i][x] = true;
            for(int y: sums[a[i - 1]])
                if((y & x) == y && rec(i - 1, x ^ y))
                    return dp[i][x] = true;
            return dp[i][x] = false;
    })(n, (1 << m) - 1);

    cout << (dp[n].back() ? "YES" : "NO") << '\n';
        
    
    
    #ifdef DEBUG
    dbg::dout << "\nExecution time: "
              << clock() * 1000 / CLOCKS_PER_SEC 
              << "ms" << endl;
    #endif
    return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 80 ms 6644 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 74 ms 6080 KB Output is correct
9 Correct 75 ms 6216 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 80 ms 6644 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 74 ms 6080 KB Output is correct
9 Correct 75 ms 6216 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 76 ms 5888 KB Output is correct
32 Correct 80 ms 6320 KB Output is correct
33 Correct 76 ms 3172 KB Output is correct
34 Correct 76 ms 3392 KB Output is correct
35 Correct 77 ms 3540 KB Output is correct
36 Correct 80 ms 5832 KB Output is correct
37 Correct 77 ms 1248 KB Output is correct
38 Correct 75 ms 1736 KB Output is correct
39 Correct 76 ms 7580 KB Output is correct
40 Correct 77 ms 4920 KB Output is correct
41 Correct 77 ms 6336 KB Output is correct
42 Correct 81 ms 6960 KB Output is correct
43 Correct 77 ms 4508 KB Output is correct
44 Correct 86 ms 4596 KB Output is correct
45 Correct 77 ms 7032 KB Output is correct
46 Correct 75 ms 5180 KB Output is correct
47 Correct 78 ms 4552 KB Output is correct
48 Correct 75 ms 6092 KB Output is correct
49 Correct 74 ms 6432 KB Output is correct
50 Correct 83 ms 10636 KB Output is correct
51 Correct 89 ms 8512 KB Output is correct
52 Correct 171 ms 8392 KB Output is correct
53 Correct 76 ms 8044 KB Output is correct
54 Correct 77 ms 10668 KB Output is correct
55 Correct 78 ms 10704 KB Output is correct
56 Correct 78 ms 11156 KB Output is correct
57 Correct 95 ms 11152 KB Output is correct
58 Correct 78 ms 10796 KB Output is correct