oj.uz

답안 #499165

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
499165 2021-12-27T11:23:58 Z mewnian 은행 (IZhO14_bank) C++14
100 / 100
 115 ms 16764 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#define sze(x) (ll) x.size()
#define idx(x, a) get<x>(a)
#define LID(x) (x << 1LL)
#define RID(x) (x << 1LL) + 1LL
#define ID(x) (x + MAXN)
#define CONV(x) (x - MAXN)
#define countbit(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pi;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll rand(ll l, ll r)
{
    return uniform_int_distribution<ll>(l, r)(rng);
}

const ll MAXN = 23;
const ll MAXBIT = (1LL << 20) + 3;
const ll INF = 1e18;

ll n, m, a[MAXN], b[MAXN], tar[MAXN];
ll dp[MAXBIT], filled[MAXBIT];
bitset<MAXBIT> ok;

inline bool bit_on(ll mask, ll bit)
{
    return ((mask >> bit) & 1LL);
}
inline ll submask(ll mask, ll bit)
{
    return (mask ^ (1LL << bit));
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    #ifdef OFFLINE
    freopen("input.inp", "r", stdin);
    #endif
    cin >> n >> m;
    for (ll i = 0; i < n; ++i) cin >> a[i];
    a[n] = -1;
    for (ll i = 0; i < m; ++i) cin >> b[i];
    ok[0] = 1;
    for (ll i = 0; i < n; ++i) ok[tar[i]] = 1;
    dp[0] = filled[0] = 0;
    for (ll mask = 1; mask < (1LL << m); ++mask)
    {
        dp[mask] = 0;
        for (ll i = 0; i < m; ++i)
        {
//            cerr << bit_on(mask, i);
            if (!bit_on(mask, i)) continue;
            ll maskt = submask(mask, i);
            pi dpt = mp(dp[maskt], filled[maskt] + b[i]);
            if (filled[maskt] + b[i] == a[dp[maskt]])
                ++dpt.fi, dpt.se = 0;
            tie(dp[mask], filled[mask]) = max(mp(dp[mask], filled[mask]), dpt);
        }
//        cerr << " = " << dp[mask] << " " << filled[mask] << endl;
    }
    cout << (dp[(1LL << m) - 1] == n ? "YES" : "NO");
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 4 ms 844 KB Output is correct
5 Correct 96 ms 16612 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 90 ms 16696 KB Output is correct
9 Correct 70 ms 16708 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 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 0 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 0 ms 332 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 4 ms 844 KB Output is correct
5 Correct 96 ms 16612 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 90 ms 16696 KB Output is correct
9 Correct 70 ms 16708 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 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 0 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 0 ms 332 KB Output is correct
20 Correct 2 ms 588 KB Output is correct
21 Correct 2 ms 588 KB Output is correct
22 Correct 2 ms 588 KB Output is correct
23 Correct 2 ms 588 KB Output is correct
24 Correct 2 ms 588 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 2 ms 588 KB Output is correct
27 Correct 2 ms 588 KB Output is correct
28 Correct 2 ms 588 KB Output is correct
29 Correct 2 ms 588 KB Output is correct
30 Correct 2 ms 588 KB Output is correct
31 Correct 91 ms 16704 KB Output is correct
32 Correct 97 ms 16680 KB Output is correct
33 Correct 91 ms 16648 KB Output is correct
34 Correct 82 ms 16620 KB Output is correct
35 Correct 84 ms 16588 KB Output is correct
36 Correct 88 ms 16708 KB Output is correct
37 Correct 100 ms 16712 KB Output is correct
38 Correct 71 ms 16704 KB Output is correct
39 Correct 77 ms 16708 KB Output is correct
40 Correct 77 ms 16676 KB Output is correct
41 Correct 78 ms 16592 KB Output is correct
42 Correct 105 ms 16664 KB Output is correct
43 Correct 87 ms 16760 KB Output is correct
44 Correct 74 ms 16592 KB Output is correct
45 Correct 111 ms 16632 KB Output is correct
46 Correct 115 ms 16680 KB Output is correct
47 Correct 77 ms 16708 KB Output is correct
48 Correct 90 ms 16616 KB Output is correct
49 Correct 70 ms 16656 KB Output is correct
50 Correct 84 ms 16764 KB Output is correct
51 Correct 83 ms 16652 KB Output is correct
52 Correct 80 ms 16632 KB Output is correct
53 Correct 108 ms 16664 KB Output is correct
54 Correct 109 ms 16708 KB Output is correct
55 Correct 87 ms 16736 KB Output is correct
56 Correct 85 ms 16628 KB Output is correct
57 Correct 84 ms 16708 KB Output is correct
58 Correct 90 ms 16688 KB Output is correct