oj.uz

답안 #703557

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
703557 2023-02-27T16:34:52 Z gagik_2007 은행 (IZhO14_bank) C++17
100 / 100
 132 ms 16844 KB 
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <chrono>
#include <ctime>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <limits>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <functional>
#include <random>
#include <cassert>
using namespace std;

typedef long long ll;
typedef long double ld;

#define ff first
#define ss second

ll ttt;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll N = 21;
const ll LG = 18;
ll n, m, k;
pair<ll, ll> dp[1 << N];
ll a[N];
ll b[N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> b[i];
    }
    if (n > m) {
        cout << "NO\n";
        return 0;
    }
    for (int msk = 1; msk < (1 << m); msk++) {
        for (int i = 0; i < m; i++) {
            if (msk & (1 << i)) {
                ll vl = dp[msk ^ (1 << i)].ss + b[i];
                ll ind = dp[msk ^ (1 << i)].ff;
                if (ind == n) {
                    dp[msk] = { ind,vl };
                }
                else if (vl == a[ind]) {
                    dp[msk] = max(dp[msk], make_pair(ind + 1, 0ll));
                }
                else if (vl < a[ind]) {
                    dp[msk] = max(dp[msk], make_pair(ind, vl));
                }
            }
        }
    }
    if (dp[(1 << m) - 1].ff == n) {
        cout << "YES\n";
    }
    else cout << "NO\n";
    return 0;
}

/// ---- - --------  ------ -------- -- - - -
/// Just a reminder. Ubuntu password is I O I
/// ---- - --------  ------ -------- -- - - -

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 3 ms 764 KB Output is correct
5 Correct 85 ms 16712 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 104 ms 16716 KB Output is correct
9 Correct 87 ms 16708 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 3 ms 764 KB Output is correct
5 Correct 85 ms 16712 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 104 ms 16716 KB Output is correct
9 Correct 87 ms 16708 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 584 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 584 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 100 ms 16700 KB Output is correct
32 Correct 98 ms 16716 KB Output is correct
33 Correct 119 ms 16716 KB Output is correct
34 Correct 104 ms 16676 KB Output is correct
35 Correct 108 ms 16668 KB Output is correct
36 Correct 85 ms 16632 KB Output is correct
37 Correct 100 ms 16728 KB Output is correct
38 Correct 78 ms 16696 KB Output is correct
39 Correct 68 ms 16716 KB Output is correct
40 Correct 88 ms 16668 KB Output is correct
41 Correct 85 ms 16720 KB Output is correct
42 Correct 128 ms 16716 KB Output is correct
43 Correct 113 ms 16844 KB Output is correct
44 Correct 88 ms 16716 KB Output is correct
45 Correct 132 ms 16708 KB Output is correct
46 Correct 123 ms 16716 KB Output is correct
47 Correct 85 ms 16652 KB Output is correct
48 Correct 104 ms 16672 KB Output is correct
49 Correct 77 ms 16716 KB Output is correct
50 Correct 82 ms 16624 KB Output is correct
51 Correct 89 ms 16664 KB Output is correct
52 Correct 83 ms 16660 KB Output is correct
53 Correct 106 ms 16784 KB Output is correct
54 Correct 91 ms 16608 KB Output is correct
55 Correct 103 ms 16648 KB Output is correct
56 Correct 97 ms 16668 KB Output is correct
57 Correct 80 ms 16660 KB Output is correct
58 Correct 81 ms 16656 KB Output is correct