oj.uz

답안 #714470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
714470 2023-03-24T15:18:06 Z thienbao1602 은행 (IZhO14_bank) C++17
100 / 100
 131 ms 16772 KB 
#include    <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
using namespace std;

const int mxN = 20;

int n, m;
ii dp[1 << mxN];
ll people[mxN], salary[mxN];

void solve()
{
    cin >> n >> m;
    for(int i=0; i<n; i++)
    {
        cin >> people[i];
    }

    for(int i=0; i<m; i++)
    {
        cin >> salary[i];
    }

    fill(dp, dp + (1 << n), mp(-1, 0));
    dp[0] = mp(0, 0);
    for(int mask=0; mask<(1 << m); mask++)
    {
        for(int k=0; k<m; k++)
        {
            if ((mask >> k) & 1 || dp[mask].fi == -1) continue;
            int new_mask = mask | (1 << k);
            ll new_atm = dp[mask].se + salary[k];
            if (new_atm < people[dp[mask].fi]) dp[new_mask] = max(dp[new_mask], mp(dp[mask].fi, new_atm));
             else if (new_atm == people[dp[mask].fi]) dp[new_mask] = max(dp[new_mask], mp(dp[mask].fi + 1, 1LL * 0));
        }
    }

    bool res = false;
    for(int mask=0; mask<(1 << m); mask++)
    {
        if (dp[mask].fi == n) res = true;
    }
    cout << (res ? "YES" : "NO");
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    solve();
    return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 93 ms 16716 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 96 ms 16680 KB Output is correct
9 Correct 88 ms 16656 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 93 ms 16716 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 96 ms 16680 KB Output is correct
9 Correct 88 ms 16656 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 3 ms 580 KB Output is correct
22 Correct 2 ms 588 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 584 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 588 KB Output is correct
31 Correct 96 ms 16704 KB Output is correct
32 Correct 105 ms 16712 KB Output is correct
33 Correct 121 ms 16624 KB Output is correct
34 Correct 106 ms 16716 KB Output is correct
35 Correct 119 ms 16588 KB Output is correct
36 Correct 68 ms 16708 KB Output is correct
37 Correct 105 ms 16612 KB Output is correct
38 Correct 76 ms 16712 KB Output is correct
39 Correct 83 ms 16712 KB Output is correct
40 Correct 94 ms 16680 KB Output is correct
41 Correct 68 ms 16712 KB Output is correct
42 Correct 131 ms 16656 KB Output is correct
43 Correct 117 ms 16772 KB Output is correct
44 Correct 93 ms 16716 KB Output is correct
45 Correct 127 ms 16656 KB Output is correct
46 Correct 127 ms 16720 KB Output is correct
47 Correct 91 ms 16768 KB Output is correct
48 Correct 95 ms 16652 KB Output is correct
49 Correct 78 ms 16696 KB Output is correct
50 Correct 78 ms 16724 KB Output is correct
51 Correct 106 ms 16684 KB Output is correct
52 Correct 86 ms 16624 KB Output is correct
53 Correct 107 ms 16720 KB Output is correct
54 Correct 95 ms 16724 KB Output is correct
55 Correct 80 ms 16728 KB Output is correct
56 Correct 94 ms 16724 KB Output is correct
57 Correct 83 ms 16656 KB Output is correct
58 Correct 82 ms 16712 KB Output is correct