oj.uz

답안 #556318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
556318 2022-05-02T21:33:49 Z nhuang685 은행 (IZhO14_bank) C++17
100 / 100
 135 ms 8532 KB 
#include <bits/stdc++.h>

#ifdef VSLOCAL
#include "debug/d.h"
#endif
#ifdef LOCAL
#include "../../debug/d.h"
#endif

using namespace std;

using ll = long long;
using ld = long double;

#if defined(LOCAL) || defined(VSLOCAL)
#define dbg(...) line_info(__LINE__, #__VA_ARGS__), dbg1(__VA_ARGS__)
void nline() { cerr << '\n'; }
#else
#define dbg(...) 0
void nline() {}
#endif

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

    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("log.txt", "w", stderr);
    #endif

    int N, M;
    cin >> N >> M;

    vector<int> a (N);
    for (int i = 0; i < N; ++i) {
        cin >> a[i];
    }

    vector<int> b (M);
    for (int i = 0; i < M; ++i) {
        cin >> b[i];
    }

    vector<pair<int, int>> dp (1 << M);

    for (int i = 1; i < (1 << M); ++i) {
        for (int j = 0; j < M; ++j) {
            if (i & (1 << j)) {
                auto [num, val] = dp[i ^ (1 << j)];
                if (num == N) {
                    dp[i] = {N, 0};
                    break;
                }
                if (val + b[j] > a[num]) dp[i] = max(dp[i], dp[i ^ (1 << j)]);
                else if (val + b[j] == a[num]) dp[i] = max(dp[i], {num + 1, 0});
                else dp[i] = max(dp[i], {num, val + b[j]});
            }
        }
    }
    if (dp[(1 << M) - 1].first == N) cout << "YES\n";
    else cout << "NO\n";
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 580 KB Output is correct
5 Correct 78 ms 8532 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 58 ms 8532 KB Output is correct
9 Correct 88 ms 8532 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 580 KB Output is correct
5 Correct 78 ms 8532 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 58 ms 8532 KB Output is correct
9 Correct 88 ms 8532 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 448 KB Output is correct
24 Correct 2 ms 452 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 96 ms 8532 KB Output is correct
32 Correct 106 ms 8532 KB Output is correct
33 Correct 108 ms 8532 KB Output is correct
34 Correct 98 ms 8508 KB Output is correct
35 Correct 87 ms 8532 KB Output is correct
36 Correct 87 ms 8532 KB Output is correct
37 Correct 87 ms 8532 KB Output is correct
38 Correct 83 ms 8532 KB Output is correct
39 Correct 24 ms 8532 KB Output is correct
40 Correct 84 ms 8532 KB Output is correct
41 Correct 80 ms 8532 KB Output is correct
42 Correct 135 ms 8532 KB Output is correct
43 Correct 95 ms 8532 KB Output is correct
44 Correct 85 ms 8532 KB Output is correct
45 Correct 114 ms 8532 KB Output is correct
46 Correct 126 ms 8512 KB Output is correct
47 Correct 90 ms 8460 KB Output is correct
48 Correct 38 ms 8532 KB Output is correct
49 Correct 77 ms 8532 KB Output is correct
50 Correct 77 ms 8532 KB Output is correct
51 Correct 94 ms 8532 KB Output is correct
52 Correct 87 ms 8532 KB Output is correct
53 Correct 112 ms 8532 KB Output is correct
54 Correct 103 ms 8532 KB Output is correct
55 Correct 83 ms 8532 KB Output is correct
56 Correct 86 ms 8532 KB Output is correct
57 Correct 88 ms 8532 KB Output is correct
58 Correct 82 ms 8512 KB Output is correct