oj.uz

답안 #753210

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
753210 2023-06-04T20:04:07 Z SLin25 은행 (IZhO14_bank) C++14
100 / 100
 147 ms 8624 KB 
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;

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

    int n, m; cin >> n >> m;
    int people[n];
    int banknotes[m];

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

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

    int sums[(1<<m)];
    sums[0] = 0;
    int pref[n];
    for (int i = 0; i < n; i++) {
        pref[i] = people[i];
    }

    for (int i = 1; i < n; i++) {
        pref[i] += pref[i - 1];
    }

    for (int i = 1; i < (1 << m); i++) {
        int sb = 0;
        for (int j = 0; j < m; j++) {
            if (i&(1<<j)) sb++;
        }
        if (sb==1) {
            for (int j = 0; j < m; j++) {
                if (i&(1<<j)) sums[i] = banknotes[j];
            }
        } else {
            for (int j = 0; j < m; j++) {
                if (i&(1<<j)) {
                    sums[i] = sums[(1<<j)] + sums[i^(1<<j)];
                    break;
                }
            }
        }
    }
    int dp[(1<<m)];
    int np = 1e9;
    for (int i = 0; i < (1<<m); i++) dp[i] = np;
    dp[0] = 0;

    for (int i = 1; i < (1<<m); i++) {
        for (int j = 0; j < m; j++) {
            if (i&(1<<j) && dp[i^(1<<j)] != np && dp[i^(1<<j)] != n) {
                int targ = pref[dp[i^(1<<j)]] - sums[i^(1<<j)];
                if (targ == banknotes[j]) dp[i] = dp[i^(1<<j)]+1;
                else if (targ > banknotes[j]) dp[i] = dp[i^(1<<j)];
            }
        }
    }

    bool pass = false;
    for (int i = 0; i < (1<<m); i++) {
        if (dp[i] == n) {
            pass = true;
            break;
        }
    }

    cout << (pass?"YES":"NO") << '\n';


}

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 324 KB Output is correct
4 Correct 3 ms 572 KB Output is correct
5 Correct 86 ms 8512 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 107 ms 8496 KB Output is correct
9 Correct 93 ms 8504 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 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 444 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 320 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 316 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 3 ms 572 KB Output is correct
5 Correct 86 ms 8512 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 107 ms 8496 KB Output is correct
9 Correct 93 ms 8504 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 212 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 444 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 320 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 316 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 123 ms 8456 KB Output is correct
32 Correct 115 ms 8500 KB Output is correct
33 Correct 98 ms 8500 KB Output is correct
34 Correct 83 ms 8504 KB Output is correct
35 Correct 108 ms 8500 KB Output is correct
36 Correct 84 ms 8504 KB Output is correct
37 Correct 82 ms 8504 KB Output is correct
38 Correct 87 ms 8624 KB Output is correct
39 Correct 89 ms 8396 KB Output is correct
40 Correct 95 ms 8380 KB Output is correct
41 Correct 97 ms 8508 KB Output is correct
42 Correct 145 ms 8500 KB Output is correct
43 Correct 89 ms 8396 KB Output is correct
44 Correct 85 ms 8504 KB Output is correct
45 Correct 147 ms 8508 KB Output is correct
46 Correct 110 ms 8508 KB Output is correct
47 Correct 90 ms 8504 KB Output is correct
48 Correct 121 ms 8496 KB Output is correct
49 Correct 104 ms 8500 KB Output is correct
50 Correct 104 ms 8500 KB Output is correct
51 Correct 127 ms 8508 KB Output is correct
52 Correct 103 ms 8492 KB Output is correct
53 Correct 123 ms 8508 KB Output is correct
54 Correct 147 ms 8624 KB Output is correct
55 Correct 116 ms 8500 KB Output is correct
56 Correct 106 ms 8504 KB Output is correct
57 Correct 109 ms 8380 KB Output is correct
58 Correct 111 ms 8492 KB Output is correct