oj.uz

답안 #914415

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
914415 2024-01-22T05:11:14 Z thisistotallymyusername 은행 (IZhO14_bank) C++14
71 / 100
 1000 ms 178556 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 21, M = 1 << N, K = 1010;

int dp[N][M];
int n, m, mx, a[N], b[N];
vector<int> s[K];

bool check(int i, int msk) {
    for (int j = 0; j < N; j++) {
        if (i >> j & 1 && !(msk >> j & 1)) {
            return false;
        }
    }
    return true;
}

int g(int i, int msk) {
    for (int j = 0; j < N; j++) {
        if (i >> j & 1) {
            msk = msk & ~(1 << j);
        }
    }
    return msk;
}

bool f(int u, int msk) {
    if (dp[u][msk] == 1 || u == 0) {
        return true;
    } if (dp[u][msk] == 0) {
        return false;
    }
    for (int i : s[a[u]]) {
        if (check(i, msk) && f(u - 1, g(i, msk))) {
            dp[u][msk] = 1;
            return true;
        }
    }
    dp[u][msk] = 0;
    return false;
}

int main() {
    memset(dp, -1, sizeof dp);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        mx = max(mx, a[i]);
    }
    for (int j = 1; j <= m; j++) {
        cin >> b[j];
    }
    for (int i = 0; i < 1 << m; i++) {
        int sum = 0;
        for (int j = 0; j < N; j++) {
            if (i >> j & 1) {
                sum += b[j + 1];
            }
        }
        if (sum > mx) continue;
        s[sum].push_back(i);
    }
    cout << (f(n, (1 << m) - 1) ? "YES\n" : "NO\n");
    return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 172632 KB Output is correct
2 Correct 27 ms 172636 KB Output is correct
3 Correct 27 ms 172636 KB Output is correct
4 Correct 29 ms 172636 KB Output is correct
5 Correct 77 ms 172628 KB Output is correct
6 Correct 27 ms 172620 KB Output is correct
7 Correct 27 ms 172636 KB Output is correct
8 Correct 78 ms 175512 KB Output is correct
9 Correct 81 ms 178556 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 172680 KB Output is correct
2 Correct 28 ms 172624 KB Output is correct
3 Correct 27 ms 172624 KB Output is correct
4 Correct 27 ms 172636 KB Output is correct
5 Correct 28 ms 172628 KB Output is correct
6 Correct 28 ms 172628 KB Output is correct
7 Correct 28 ms 172636 KB Output is correct
8 Correct 26 ms 172636 KB Output is correct
9 Correct 27 ms 172632 KB Output is correct
10 Correct 28 ms 172628 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 172628 KB Output is correct
2 Correct 29 ms 172628 KB Output is correct
3 Correct 28 ms 172628 KB Output is correct
4 Correct 28 ms 172576 KB Output is correct
5 Correct 29 ms 172628 KB Output is correct
6 Correct 28 ms 172624 KB Output is correct
7 Correct 28 ms 172624 KB Output is correct
8 Correct 28 ms 172624 KB Output is correct
9 Correct 27 ms 172628 KB Output is correct
10 Correct 28 ms 172636 KB Output is correct
11 Correct 29 ms 172884 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 172632 KB Output is correct
2 Correct 27 ms 172636 KB Output is correct
3 Correct 27 ms 172636 KB Output is correct
4 Correct 29 ms 172636 KB Output is correct
5 Correct 77 ms 172628 KB Output is correct
6 Correct 27 ms 172620 KB Output is correct
7 Correct 27 ms 172636 KB Output is correct
8 Correct 78 ms 175512 KB Output is correct
9 Correct 81 ms 178556 KB Output is correct
10 Correct 27 ms 172680 KB Output is correct
11 Correct 28 ms 172624 KB Output is correct
12 Correct 27 ms 172624 KB Output is correct
13 Correct 27 ms 172636 KB Output is correct
14 Correct 28 ms 172628 KB Output is correct
15 Correct 28 ms 172628 KB Output is correct
16 Correct 28 ms 172636 KB Output is correct
17 Correct 26 ms 172636 KB Output is correct
18 Correct 27 ms 172632 KB Output is correct
19 Correct 28 ms 172628 KB Output is correct
20 Correct 30 ms 172628 KB Output is correct
21 Correct 29 ms 172628 KB Output is correct
22 Correct 28 ms 172628 KB Output is correct
23 Correct 28 ms 172576 KB Output is correct
24 Correct 29 ms 172628 KB Output is correct
25 Correct 28 ms 172624 KB Output is correct
26 Correct 28 ms 172624 KB Output is correct
27 Correct 28 ms 172624 KB Output is correct
28 Correct 27 ms 172628 KB Output is correct
29 Correct 28 ms 172636 KB Output is correct
30 Correct 29 ms 172884 KB Output is correct
31 Correct 80 ms 177208 KB Output is correct
32 Correct 79 ms 175004 KB Output is correct
33 Correct 81 ms 172804 KB Output is correct
34 Correct 78 ms 172816 KB Output is correct
35 Correct 78 ms 172628 KB Output is correct
36 Correct 79 ms 172632 KB Output is correct
37 Correct 78 ms 172636 KB Output is correct
38 Correct 78 ms 172636 KB Output is correct
39 Correct 79 ms 172800 KB Output is correct
40 Correct 77 ms 172644 KB Output is correct
41 Correct 78 ms 172632 KB Output is correct
42 Correct 150 ms 172876 KB Output is correct
43 Correct 78 ms 172628 KB Output is correct
44 Correct 79 ms 172628 KB Output is correct
45 Correct 78 ms 172888 KB Output is correct
46 Correct 78 ms 172888 KB Output is correct
47 Correct 79 ms 172636 KB Output is correct
48 Correct 81 ms 173652 KB Output is correct
49 Correct 77 ms 172672 KB Output is correct
50 Correct 78 ms 172804 KB Output is correct
51 Correct 201 ms 174164 KB Output is correct
52 Execution timed out 1051 ms 172636 KB Time limit exceeded
53 Halted 0 ms 0 KB -