oj.uz

답안 #504950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
504950 2022-01-10T10:56:48 Z KiriLL1ca 은행 (IZhO14_bank) C++17
100 / 100
 819 ms 8664 KB 
#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define endl '\n'
#define pw(x) (1ll << x)
#define sz(x) (int)((x).size())
#define sqr(x) ((ll)x)*((ll)x)
#define bcnt(X) __builtin_popcountll(X)
#define vec vector

#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

auto rng = bind(uniform_int_distribution<int>(1, 1e9), mt19937(228));

signed main ()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, m; cin >> n >> m;
    vector <int> a (n), b (m);
    for (auto &i : a) cin >> i;
    for (auto &i : b) cin >> i;
    vector <vector <int>> sim (n);
    for (int msk = 0; msk < pw(m); msk++) {
        int sum = 0;
        for (int j = 0; j < m; j++) {
            if ((msk >> j) & 1) sum += b[j];
        }
        for (int i = 0; i < n; i++) {
            if (sum == a[i]) sim[i].pb(msk);
        }
    }

    vector <int> dp (pw(m), -1), ndp (pw(m), -1);
    dp[0] = 0; ndp[0] = 0;
    for (int i = 0; i < n; i++) {
        for (int msk = pw(m) - 1; msk >= 0; msk--) {
            if (dp[msk] != -1) {
                for (auto p : sim[i]) {
                    if (p & msk) continue;
                    int mask = p | msk;
                    ndp[mask] = max(ndp[mask], dp[msk] + 1);
                    if (ndp[mask] == n) {
                        cout << "YES" << endl;
                        return 0;
                    }
                }
            }
        }
        dp = ndp;
    }
    cout << "NO" << endl;
    return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 55 ms 8500 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 53 ms 8512 KB Output is correct
9 Correct 57 ms 8484 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 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 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 55 ms 8500 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 53 ms 8512 KB Output is correct
9 Correct 57 ms 8484 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 59 ms 8496 KB Output is correct
32 Correct 106 ms 8660 KB Output is correct
33 Correct 72 ms 8492 KB Output is correct
34 Correct 69 ms 8488 KB Output is correct
35 Correct 72 ms 8480 KB Output is correct
36 Correct 102 ms 8500 KB Output is correct
37 Correct 59 ms 8500 KB Output is correct
38 Correct 60 ms 8488 KB Output is correct
39 Correct 73 ms 8488 KB Output is correct
40 Correct 69 ms 8608 KB Output is correct
41 Correct 93 ms 8492 KB Output is correct
42 Correct 105 ms 8516 KB Output is correct
43 Correct 77 ms 8492 KB Output is correct
44 Correct 80 ms 8480 KB Output is correct
45 Correct 64 ms 8496 KB Output is correct
46 Correct 69 ms 8488 KB Output is correct
47 Correct 94 ms 8500 KB Output is correct
48 Correct 63 ms 8512 KB Output is correct
49 Correct 54 ms 8492 KB Output is correct
50 Correct 629 ms 8528 KB Output is correct
51 Correct 674 ms 8612 KB Output is correct
52 Correct 364 ms 8556 KB Output is correct
53 Correct 819 ms 8664 KB Output is correct
54 Correct 692 ms 8516 KB Output is correct
55 Correct 562 ms 8524 KB Output is correct
56 Correct 710 ms 8532 KB Output is correct
57 Correct 768 ms 8528 KB Output is correct
58 Correct 677 ms 8520 KB Output is correct