oj.uz

Submission #310335

# Submission time Handle Problem Language Result Execution time Memory
310335 2020-10-06T16:47:28 Z fishy15 Bank (IZhO14_bank) C++14
100 / 100
 132 ms 8584 KB 
#include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>

#define ll long long
#define ld long double
#define eps 1e-8
#define MOD 1000000007

#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f

// change if necessary
#define MAXN 1000000

using namespace std;

int n, m;
int a[30];
int b[30];
// {current index, amt left in current person}
pair<int, int> dp[(1 << 20) + 10];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    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 = 1; i < (1 << m); i++) {
        for (int j = 0; j < m; j++) {
            if (i & (1 << j)) {
                int prev = i - (1 << j);
                pair<int, int> nxt;
                if (b[j] + dp[prev].second == a[dp[prev].first]) {
                    nxt = {dp[prev].first + 1, 0};
                } else {
                    nxt = {dp[prev].first, b[j] + dp[prev].second};
                }
                if (nxt.first == n && nxt.second == 0) {
                    cout << "YES\n";
                    return 0;
                }
                dp[i] = max(dp[i], nxt);
            }
        }
    }

    cout << "NO\n";

    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 98 ms 8572 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 97 ms 8568 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 98 ms 8572 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 97 ms 8568 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 107 ms 8536 KB Output is correct
32 Correct 118 ms 8584 KB Output is correct
33 Correct 112 ms 8468 KB Output is correct
34 Correct 104 ms 8568 KB Output is correct
35 Correct 107 ms 8528 KB Output is correct
36 Correct 100 ms 8516 KB Output is correct
37 Correct 103 ms 8568 KB Output is correct
38 Correct 99 ms 8568 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 101 ms 8568 KB Output is correct
41 Correct 102 ms 8568 KB Output is correct
42 Correct 132 ms 8568 KB Output is correct
43 Correct 108 ms 8572 KB Output is correct
44 Correct 99 ms 8568 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 119 ms 8568 KB Output is correct
47 Correct 113 ms 8568 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 102 ms 8568 KB Output is correct
50 Correct 121 ms 8568 KB Output is correct
51 Correct 104 ms 8568 KB Output is correct
52 Correct 99 ms 8568 KB Output is correct
53 Correct 130 ms 8568 KB Output is correct
54 Correct 113 ms 8572 KB Output is correct
55 Correct 103 ms 8568 KB Output is correct
56 Correct 101 ms 8568 KB Output is correct
57 Correct 107 ms 8568 KB Output is correct
58 Correct 106 ms 8568 KB Output is correct