oj.uz

Submission #940712

# Submission time Handle Problem Language Result Execution time Memory
940712 2024-03-07T13:55:31 Z magikrap Bank (IZhO14_bank) C++17
19 / 100
 126 ms 49884 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>
#include <cstring>
#include <bitset>
#include <string>
#include <unordered_map>
#include <deque>
#include <climits>
#include <unordered_set>

using namespace std;
#define ll long long
#define MOD 998244353
#define MOD2 1000000007
#define vt vector
struct pii {int x, y;};
struct pll {int x, y;};

int N, M;
int a[21], b[21];
set<int> s[1005];
vt<set<int>> dp;
vt<int> sum;

int main() {
    cin >> N >> M;
    dp.resize(1<<N);
    sum.resize(1<<N);
    for (int i = 0; i < N; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < M; i++) {
        cin >> b[i];
    }
    s[0].insert(0);
    for (int i = 0; i < M; i++) {
        for (int j = 1000; j >= 0; j--) {
            if (j-b[i]>=0 && s[j-b[i]].size()) {
                for (int k : s[j-b[i]]) {
                    s[j].insert(k|(1<<i));
                }
            }
        }
    }
    // cout << "s: " << endl;
    // for (int i = 0; i < 40; i++) {
    //     cout << i << ": ";
    //     for (int j : s[i]) {
    //         cout << bitset<20>(j) << " ";
    //     }
    //     cout << endl;
    // }
    dp[0].insert(0);
    for (int m = 0; m < 1<<N; m++) {
        for (int i = 0; i < N; i++) {
            if (m&(1<<i)) {
                sum[m] += a[i];
            }
        }
        for (int i = 0; i < N; i++) {
            if (m&(1<<i)) {
                int prev = m^(1<<i);
                for (int j : dp[prev]) {
                    for (int k : s[sum[m]]) {
                        if ((k&j)==j) {
                            dp[m].insert(k);
                        }
                    }
                }
            }
        }
    }
    // cout << "dp: " << endl;
    // for (int i = 0; i < 1<<N; i++) {
    //     cout << i << ": ";
    //     for (int j : dp[i]) {
    //         cout << bitset<20>(j) << " ";
    //     }
    //     cout << endl;
    // }
    cout << (dp[(1<<N)-1].size() ? "YES" : "NO") << endl;
    return 0;
}

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 1 ms 348 KB Output is correct
4 Correct 3 ms 1884 KB Output is correct
5 Correct 118 ms 48896 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 126 ms 49884 KB Output is correct
9 Correct 119 ms 49512 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Runtime error 1 ms 604 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

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 1 ms 348 KB Output is correct
4 Correct 3 ms 1884 KB Output is correct
5 Correct 118 ms 48896 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 126 ms 49884 KB Output is correct
9 Correct 119 ms 49512 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Runtime error 1 ms 604 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -