oj.uz

Submission #648177

# Submission time Handle Problem Language Result Execution time Memory
648177 2022-10-05T16:16:06 Z TS_2392 Bank (IZhO14_bank) C++14
100 / 100
 71 ms 8520 KB 
#include <bits/stdc++.h>
#define FAST ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define rall(x) (x).rbegin(), (x).rend()
#define all(x) (x).begin(), (x).end()
#define sqr(x) (x) * (x)

#define epb emplace_back
#define lwb lower_bound
#define upb upper_bound

#define mp make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef long double ldb;
typedef unsigned int uint;
typedef unsigned long long ull;

typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<int, int> pii;
typedef pair<ldb, ldb> pld;
typedef pair<double, double> pdd;
const int oo = 1e4;
int n, m, a[21], b[21];
pii dp[1 << 20];
int main(){
    FAST;
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 0; i < m; ++i) cin >> b[i];
    dp[0] = mp(1, 0);
    for(int mask = 1; mask < 1 << m; ++mask){
        dp[mask].se = oo;
        for(int i = 0; i < m; ++i) if(mask >> i & 1){
            int x = mask ^ 1 << i, idx = dp[x].fi;
            if(dp[x].se >= oo) continue;
            if(dp[x].se + b[i] > a[idx]) continue;
            dp[mask].fi = dp[x].fi;
            dp[mask].se = dp[x].se + b[i];
            if(dp[mask].se == a[idx]){
                dp[mask].fi++;
                dp[mask].se = 0;
            }
            break;
        }
        if(dp[mask].fi == n + 1 && dp[mask].se == 0){
            cout << "YES";
            exit(0);
        }
    }
    cout << "NO";
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 65 ms 8460 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 7 ms 8404 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 65 ms 8460 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 7 ms 8404 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 352 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 22 ms 8456 KB Output is correct
32 Correct 14 ms 8520 KB Output is correct
33 Correct 69 ms 8436 KB Output is correct
34 Correct 71 ms 8440 KB Output is correct
35 Correct 67 ms 8396 KB Output is correct
36 Correct 65 ms 8484 KB Output is correct
37 Correct 68 ms 8404 KB Output is correct
38 Correct 66 ms 8396 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 69 ms 8456 KB Output is correct
41 Correct 65 ms 8396 KB Output is correct
42 Correct 58 ms 8484 KB Output is correct
43 Correct 68 ms 8420 KB Output is correct
44 Correct 67 ms 8480 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 69 ms 8404 KB Output is correct
47 Correct 66 ms 8392 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 65 ms 8400 KB Output is correct
50 Correct 19 ms 8404 KB Output is correct
51 Correct 69 ms 8436 KB Output is correct
52 Correct 68 ms 8396 KB Output is correct
53 Correct 19 ms 8404 KB Output is correct
54 Correct 19 ms 8480 KB Output is correct
55 Correct 20 ms 8404 KB Output is correct
56 Correct 14 ms 8404 KB Output is correct
57 Correct 14 ms 8404 KB Output is correct
58 Correct 14 ms 8508 KB Output is correct