oj.uz

답안 #516602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
516602 2022-01-21T14:58:59 Z Be_dos 은행 (IZhO14_bank) C++17
100 / 100
 598 ms 28168 KB 
#include <iostream>
#include <cmath>
#include <cctype>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <deque>
#include <stack>
#include <unordered_set>
#include <sstream>
#include <cstring>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <random>
#include <cfloat>
#include <chrono>
#include <bitset>
#include <complex>
#include <immintrin.h>
#include <cassert>

int main() {
    int32_t n, m;
    std::cin >> n >> m;

    int32_t* arr = new int32_t[n];
    for(int32_t i = 0; i < n; i++)
        std::cin >> arr[i];

    int32_t* arr2 = new int32_t[m];
    for(int32_t i = 0; i < m; i++)
        std::cin >> arr2[i];
    int32_t* subset_sums = new int32_t[1 << m];
    subset_sums[0] = 0;
    for(int32_t i = 1; i < (1 << m); i++) {
        int32_t bit = __builtin_ctz(i);
        subset_sums[i] = subset_sums[i ^ (1 << bit)] + arr2[bit];
    }

    bool* dp = new bool[1 << m];
    for(int32_t i = 0; i < (1 << m); i++)
        dp[i] = false;
    dp[0] = true;
    bool* dp2 = new bool[1 << m];
    int32_t total_target = 0;
    bool** exists_submask = new bool*[m + 1];
    for(int32_t i = 0; i < m + 1; i++)
        exists_submask[i] = new bool[1 << m];
    for(int32_t i = 0; i < n; i++) {
        for(int32_t j = 0; j < 1 << m; j++)
            exists_submask[m][j] = dp[j];
        for(int32_t j = m - 1; j >= 0; j--)
            for(int32_t k = 0; k < (1 << m); k++)
                exists_submask[j][k] = exists_submask[j + 1][k] || ((k & (1 << j)) > 0 && exists_submask[j + 1][k ^ (1 << j)]);

        total_target += arr[i];
        for(int32_t j = 0; j < (1 << m); j++) {
            dp2[j] = false;
            if(subset_sums[j] != total_target)
                continue;

            dp2[j] = exists_submask[0][j];
        }
        bool* tmp = dp;
        dp = dp2;
        dp2 = tmp;
    }

    for(int32_t j = 0; j < (1 << m); j++)
        if(dp[j]) {
            std::cout << "YES";
            return 0;
        }
    std::cout << "NO";
    return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 944 KB Output is correct
5 Correct 33 ms 28040 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 34 ms 27984 KB Output is correct
9 Correct 33 ms 28080 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 944 KB Output is correct
5 Correct 33 ms 28040 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 34 ms 27984 KB Output is correct
9 Correct 33 ms 28080 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 0 ms 292 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 288 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 3 ms 548 KB Output is correct
21 Correct 1 ms 588 KB Output is correct
22 Correct 3 ms 548 KB Output is correct
23 Correct 4 ms 588 KB Output is correct
24 Correct 3 ms 588 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 2 ms 588 KB Output is correct
27 Correct 1 ms 588 KB Output is correct
28 Correct 2 ms 588 KB Output is correct
29 Correct 3 ms 588 KB Output is correct
30 Correct 4 ms 588 KB Output is correct
31 Correct 63 ms 28096 KB Output is correct
32 Correct 89 ms 27976 KB Output is correct
33 Correct 176 ms 27972 KB Output is correct
34 Correct 241 ms 28080 KB Output is correct
35 Correct 247 ms 28052 KB Output is correct
36 Correct 447 ms 28156 KB Output is correct
37 Correct 55 ms 27972 KB Output is correct
38 Correct 88 ms 28028 KB Output is correct
39 Correct 213 ms 28036 KB Output is correct
40 Correct 222 ms 28080 KB Output is correct
41 Correct 413 ms 28080 KB Output is correct
42 Correct 145 ms 28112 KB Output is correct
43 Correct 179 ms 28168 KB Output is correct
44 Correct 274 ms 28080 KB Output is correct
45 Correct 102 ms 28084 KB Output is correct
46 Correct 167 ms 28076 KB Output is correct
47 Correct 324 ms 28084 KB Output is correct
48 Correct 32 ms 27968 KB Output is correct
49 Correct 34 ms 28080 KB Output is correct
50 Correct 541 ms 28076 KB Output is correct
51 Correct 276 ms 28084 KB Output is correct
52 Correct 228 ms 28084 KB Output is correct
53 Correct 281 ms 27972 KB Output is correct
54 Correct 598 ms 28084 KB Output is correct
55 Correct 569 ms 28076 KB Output is correct
56 Correct 587 ms 28084 KB Output is correct
57 Correct 567 ms 28080 KB Output is correct
58 Correct 537 ms 28080 KB Output is correct