oj.uz

답안 #679115

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679115 2023-01-07T13:28:50 Z borisAngelov 은행 (IZhO14_bank) C++17
71 / 100
 1000 ms 35880 KB 
#include <iostream>
#include <vector>

using namespace std;

const int maxn = 25;
const int max_mask = (1 << 20) + 5;

int n, m;

int a[maxn];
int b[maxn];

vector<int> byMasks[maxn * 1000];

bool dp[maxn][max_mask];
bool is_calculated[maxn][max_mask];

inline bool check(int mask, int new_mask)
{
    for (int i = 0; i < 20; ++i)
    {
        bool bit1 = false;

        if ((mask & (1 << i)) != 0)
        {
            bit1 = true;
        }

        bool bit2 = false;

        if ((new_mask & (1 << i)) != 0)
        {
            bit2 = true;
        }

        if (bit1 == true && bit2 == true) return false;
    }

    return true;
}

bool f(int pos, int mask)
{
    if (pos == n) return true;

    if (is_calculated[pos][mask] == true) return dp[pos][mask];
    is_calculated[pos][mask] = true;

    bool result = false;

    for (auto curr_mask : byMasks[a[pos]])
    {
        if (check(mask, curr_mask) == false) continue;
        result = (result | (f(pos + 1, (mask | curr_mask))));
    }

    return dp[pos][mask] = result;
}

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n >> m;

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

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

    for (int mask = 0; mask < (1 << m); ++mask)
    {
        int curr_sum = 0;

        for (int i = 0; i < m; ++i)
        {
            if ((mask & (1 << i)) != 0)
            {
                curr_sum += b[i];
            }
        }

        byMasks[curr_sum].push_back(mask);
    }

    for (int i = 0; i < n; ++i)
    {
        if (byMasks[a[i]].empty())
        {
            cout << "NO\n";
            return 0;
        }
    }

    if (f(0, 0) == true)
    {
        cout << "YES\n";
    }
    else
    {
        cout << "NO\n";
    }

    return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 66 ms 7212 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 920 KB Output is correct
8 Correct 66 ms 6328 KB Output is correct
9 Correct 64 ms 6876 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 1 ms 920 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 1044 KB Output is correct
7 Correct 2 ms 1108 KB Output is correct
8 Correct 2 ms 1108 KB Output is correct
9 Correct 3 ms 1176 KB Output is correct
10 Correct 3 ms 1176 KB Output is correct
11 Correct 2 ms 980 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 66 ms 7212 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 920 KB Output is correct
8 Correct 66 ms 6328 KB Output is correct
9 Correct 64 ms 6876 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 920 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 2 ms 1108 KB Output is correct
22 Correct 2 ms 1108 KB Output is correct
23 Correct 2 ms 980 KB Output is correct
24 Correct 2 ms 980 KB Output is correct
25 Correct 2 ms 1044 KB Output is correct
26 Correct 2 ms 1108 KB Output is correct
27 Correct 2 ms 1108 KB Output is correct
28 Correct 3 ms 1176 KB Output is correct
29 Correct 3 ms 1176 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 78 ms 8904 KB Output is correct
32 Correct 803 ms 10492 KB Output is correct
33 Correct 69 ms 9812 KB Output is correct
34 Correct 74 ms 7772 KB Output is correct
35 Correct 77 ms 8580 KB Output is correct
36 Correct 73 ms 8192 KB Output is correct
37 Correct 69 ms 8160 KB Output is correct
38 Correct 78 ms 7864 KB Output is correct
39 Correct 120 ms 13956 KB Output is correct
40 Correct 77 ms 7728 KB Output is correct
41 Correct 69 ms 7252 KB Output is correct
42 Correct 111 ms 13100 KB Output is correct
43 Correct 70 ms 9544 KB Output is correct
44 Correct 78 ms 8192 KB Output is correct
45 Correct 72 ms 10192 KB Output is correct
46 Correct 72 ms 12100 KB Output is correct
47 Correct 69 ms 7892 KB Output is correct
48 Correct 71 ms 6512 KB Output is correct
49 Correct 63 ms 6620 KB Output is correct
50 Correct 436 ms 35880 KB Output is correct
51 Correct 71 ms 7028 KB Output is correct
52 Correct 109 ms 11792 KB Output is correct
53 Execution timed out 1096 ms 19384 KB Time limit exceeded
54 Halted 0 ms 0 KB -