oj.uz

Submission #586780

# Submission time Handle Problem Language Result Execution time Memory
586780 2022-06-30T17:02:26 Z BhavayGoyal Bank (IZhO14_bank) C++14
100 / 100
 185 ms 8532 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = 
            tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define ll long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second

const int MOD = 1e9+7;
const int inf = 1e9;
const ll linf = 1e18;

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};


// -------------------------------------------------- Main Code --------------------------------------------------

int a[20], b[20];
int n, m;
pii dp[(1<<20)];

pii sol(int mask) {
    if (mask == 0) return {0, 0};
    if (dp[mask].f != -1 && dp[mask].s != -1) return dp[mask];
    pii ans = {0, 0};
    for (int i = 0; i < m; i++) {
        if (mask&(1<<i)) {
            pii x = sol(mask^(1<<i));
            int prevPer = x.f;
            int left = x.s;
            if (left+b[i] == a[prevPer]) prevPer++, left = 0;
            else if (left+b[i] < a[prevPer]) left += b[i];
            ans = max(ans, {prevPer, left});
        }
    }
    return dp[mask] = ans;
}

void sol() {
    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++) dp[i].f = -1, dp[i].s = -1;
    for (int i = 0; i < (1<<m); i++) {
        if (sol(i).f == n) {
            cout << "YES" << endl;
            return;
        }
    }
    cout << "NO" << endl;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    // cin >> t; 
    while (t--) {
        sol();
    }
    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 468 KB Output is correct
5 Correct 118 ms 8504 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 119 ms 8520 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 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 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 452 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 456 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 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 468 KB Output is correct
5 Correct 118 ms 8504 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 119 ms 8520 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 456 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 456 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 452 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 456 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 120 ms 8508 KB Output is correct
32 Correct 125 ms 8404 KB Output is correct
33 Correct 137 ms 8512 KB Output is correct
34 Correct 143 ms 8404 KB Output is correct
35 Correct 122 ms 8404 KB Output is correct
36 Correct 116 ms 8404 KB Output is correct
37 Correct 121 ms 8516 KB Output is correct
38 Correct 117 ms 8520 KB Output is correct
39 Correct 5 ms 8404 KB Output is correct
40 Correct 120 ms 8504 KB Output is correct
41 Correct 121 ms 8516 KB Output is correct
42 Correct 154 ms 8520 KB Output is correct
43 Correct 135 ms 8520 KB Output is correct
44 Correct 117 ms 8512 KB Output is correct
45 Correct 4 ms 8404 KB Output is correct
46 Correct 132 ms 8508 KB Output is correct
47 Correct 129 ms 8504 KB Output is correct
48 Correct 4 ms 8404 KB Output is correct
49 Correct 150 ms 8508 KB Output is correct
50 Correct 185 ms 8404 KB Output is correct
51 Correct 121 ms 8532 KB Output is correct
52 Correct 122 ms 8508 KB Output is correct
53 Correct 140 ms 8512 KB Output is correct
54 Correct 126 ms 8512 KB Output is correct
55 Correct 121 ms 8516 KB Output is correct
56 Correct 128 ms 8516 KB Output is correct
57 Correct 119 ms 8512 KB Output is correct
58 Correct 128 ms 8508 KB Output is correct