oj.uz

답안 #580263

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
580263 2022-06-20T21:28:25 Z Neos 은행 (IZhO14_bank) C++14
100 / 100
 243 ms 15916 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using ii = pair<ll, ll>;

#define fastIO ios::sync_with_stdio(0); cin.tie(0);
#define fi first
#define se second
#define pb push_back
#define numBit(x) (__builtin_popcountll(1ll * (x)))
#define getBit(x, i) ((x) >> (i) & 1)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        X eps = 1e-9;
        if (x > y + eps) {
            x = y;
            return true;
        } else return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        X eps = 1e-9;
        if (x + eps < y) {
            x = y;
            return true;
        } else return false;
    }

const int N = 20 + 7, M = 2e4 + 7, oo = 1e9 + 7, MOD = 1e9 + 7;

int n, m, a[N], b[N];
pair<bool, int> f[1 << 20];
vector<int> num[M];

int main() {
    fastIO;
    if (fopen("test.inp", "r"))
        freopen("test.inp", "r", stdin),
        freopen("test.out", "w", stdout);
    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 i = 0; i < (1 << m); i++) {
        int sum = 0;
        for (int j = 0; j < m; j++)
            if (getBit(i, j)) sum += b[j];
        num[sum].pb(i);
    }


    for (int i = 0; i < (1 << n); i++) f[i] = {0, -1};
    f[0] = {0, 0};
    for (int mask = 0; mask < (1 << n); mask++) if (!f[mask].fi)
        for (int i = 0; i < n; i++) if (getBit(mask, i) && f[mask ^ (1 << i)].se != -1) {
            int cur = ((1 << m) - 1) ^ f[mask ^ (1 << i)].se;
            for (int x: num[a[i]]) if ((cur & x) == x) {
                f[mask] = {1, x | f[mask ^ (1 << i)].se};
                break;
            }
        }
    cout << (f[(1 << n) - 1].fi ? "YES" : "NO");
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:44:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |         freopen("test.inp", "r", stdin),
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:45:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |         freopen("test.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 73 ms 7108 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 72 ms 6300 KB Output is correct
9 Correct 76 ms 6608 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 73 ms 7108 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 72 ms 6300 KB Output is correct
9 Correct 76 ms 6608 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 2 ms 852 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 4 ms 980 KB Output is correct
23 Correct 3 ms 980 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 2 ms 852 KB Output is correct
26 Correct 2 ms 852 KB Output is correct
27 Correct 2 ms 852 KB Output is correct
28 Correct 3 ms 852 KB Output is correct
29 Correct 2 ms 852 KB Output is correct
30 Correct 3 ms 1008 KB Output is correct
31 Correct 75 ms 7192 KB Output is correct
32 Correct 69 ms 6512 KB Output is correct
33 Correct 73 ms 6916 KB Output is correct
34 Correct 82 ms 7284 KB Output is correct
35 Correct 82 ms 8224 KB Output is correct
36 Correct 159 ms 15916 KB Output is correct
37 Correct 76 ms 8056 KB Output is correct
38 Correct 76 ms 7736 KB Output is correct
39 Correct 68 ms 5608 KB Output is correct
40 Correct 72 ms 7656 KB Output is correct
41 Correct 141 ms 15320 KB Output is correct
42 Correct 69 ms 6368 KB Output is correct
43 Correct 76 ms 8036 KB Output is correct
44 Correct 83 ms 8376 KB Output is correct
45 Correct 70 ms 6988 KB Output is correct
46 Correct 74 ms 8052 KB Output is correct
47 Correct 78 ms 7724 KB Output is correct
48 Correct 69 ms 6400 KB Output is correct
49 Correct 71 ms 6624 KB Output is correct
50 Correct 209 ms 13756 KB Output is correct
51 Correct 73 ms 6648 KB Output is correct
52 Correct 69 ms 5572 KB Output is correct
53 Correct 69 ms 5528 KB Output is correct
54 Correct 243 ms 13868 KB Output is correct
55 Correct 206 ms 13784 KB Output is correct
56 Correct 220 ms 14104 KB Output is correct
57 Correct 230 ms 13980 KB Output is correct
58 Correct 143 ms 9936 KB Output is correct