oj.uz

Submission #852634

# Submission time Handle Problem Language Result Execution time Memory
852634 2023-09-22T09:12:39 Z t6twotwo Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 1116 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	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 dp(N + 1, vector<bool>(1 << M));
    dp[0][0] = 1;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < (1 << M); j++) {
            if (!dp[i][j]) {
                continue;
            }
            vector<int> v;
            for (int k = 0; k < M; k++) {
                if (!(j >> k & 1)) {
                    v.push_back(k);
                }
            }
            int K = v.size();
            for (int k = 0; k < (1 << K); k++) {
                int s = 0, t = 0;
                for (int p = 0; p < K; p++) {
                    if (k >> p & 1) {
                        s += b[v[p]];
                        t += 1 << v[p];
                    }
                }
                if (s == a[i]) {
                    dp[i + 1][j + t] = 1;
                }
            }
        }
    }
    for (int i = 0; i < (1 << M); i++) {
        if (dp[N][i]) {
            cout << "YES\n";
            return 0;
        }
    }
    cout << "NO\n";
	return 6/22;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 66 ms 700 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 448 KB Output is correct
8 Correct 64 ms 860 KB Output is correct
9 Correct 66 ms 860 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 548 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 1 ms 452 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 66 ms 700 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 448 KB Output is correct
8 Correct 64 ms 860 KB Output is correct
9 Correct 66 ms 860 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 484 KB Output is correct
23 Correct 2 ms 548 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 452 KB Output is correct
28 Correct 2 ms 344 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 235 ms 860 KB Output is correct
32 Execution timed out 1046 ms 1116 KB Time limit exceeded
33 Halted 0 ms 0 KB -