oj.uz

Submission #944779

# Submission time Handle Problem Language Result Execution time Memory
944779 2024-03-13T04:42:07 Z ZHIRDILBILDIZ Bank (IZhO14_bank) C++14
44 / 100
 25 ms 1372 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std;
const int N = 20;
const int NS = 10;
int n, m;
int a[N];
int b[N];
bool abu[(1 << NS)][(1 << NS)];
vector<int> v[1001];
signed main() {
//    freopen("bank.in", "r", stdin);
//    freopen("bank.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    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 == 1) {
        for (int i = 0; i < (1 << m); ++i) {
            int sum = 0;
            for (int j = 0; j < m; ++j)
                sum += b[j] * ((i & (1 << j)) > 0);
            if (sum == a[0]) {
                cout << "YES\n";
                return 0;
            }
        }
        cout << "NO\n";
        return 0;
    }
    if (n <= 10 && m <= 10) {
        for (int i = 0; i < (1 << m); ++i) {
            int sum = 0;
            for (int j = 0; j < m; ++j)
                sum += b[j] * ((i & (1 << j)) > 0);
            if (sum <= 1e3)
                v[sum].push_back(i);
        }
        abu[0][0] = 1;
        for (int i = 0; i < (1 << m); ++i)
            for (int j = 0; j < (1 << n); ++j)
                for (int q = 0; q < n; ++q)
                    if (((1 << q) & j))
                        for (int z : v[a[q]])
                            if ((z & i) == z) {
                                abu[i][j] |= abu[i ^ z][j ^ (1 << q)];
                                if (abu[i][j] && j == (1 << n) - 1) {
                                    cout << "YES\n";
                                    return 0;
                                }
                            }
        cout << "NO\n";
        return 0;
    }
    return 0;
}

Subtask #1
19.0 / 19.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1368 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 6 ms 1368 KB Output is correct
6 Correct 1 ms 488 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 1 ms 1004 KB Output is correct
10 Correct 2 ms 1372 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 488 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 20 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 488 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 25 ms 348 KB Output is correct
10 Correct 3 ms 1368 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 6 ms 1368 KB Output is correct
15 Correct 1 ms 488 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 2 ms 1372 KB Output is correct
18 Correct 1 ms 1004 KB Output is correct
19 Correct 2 ms 1372 KB Output is correct
20 Incorrect 0 ms 348 KB Output isn't correct
21 Halted 0 ms 0 KB -