oj.uz

Submission #342648

# Submission time Handle Problem Language Result Execution time Memory
342648 2021-01-02T15:02:09 Z apostoldaniel854 Bank (IZhO14_bank) C++14
100 / 100
 178 ms 1516 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define pb push_back
#define dbg(x) cerr << #x << " " << x << "\n"
const int MX = 1e3, MAX_N = 20;
const int MAX_SUM = MAX_N * MX;
int salary[1 + MAX_N];
int sum[1 + MAX_N];
int bill[MAX_N];
int progress[1 + MAX_SUM];
bool dp[1 << MAX_N];

int main () {
    ios::sync_with_stdio (false);
    cin.tie (0); cout.tie (0);

    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> salary[i];
        sum[i] = sum[i - 1] + salary[i];
        progress[sum[i]] = i;
    }
    for (int i = 1; i <= MAX_SUM; i++)
        if (not progress[i])
            progress[i] = progress[i - 1];
    for (int i = 0; i < m; i++)
        cin >> bill[i];
    dp[0] = true;
    bool good = false;
    for (int mask = 0; mask < (1 << m); mask++) {
        if (dp[mask]) {
            int paid = 0;
            for (int i = 0; i < m; i++)
                if (mask & (1 << i))
                    paid += bill[i];
            for (int i = 0; i < m; i++)
                if (not (mask & (1 << i))) {
                    int new_paid = paid + bill[i];
                    int new_mask = mask ^ (1 << i);
                    if (progress[paid] == progress[new_paid])
                        dp[new_mask] = true;
                    else {
                        if (progress[paid] + 1 == progress[new_paid] && sum[progress[new_paid]] == new_paid) {
                            dp[new_mask] = true;
                            if (progress[new_paid] == n)
                                good = true;
                        }
                    }
                }
        }
    }
    if (good)
        cout << "YES\n";
    else
        cout << "NO\n";
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 4 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 141 ms 1408 KB Output is correct
9 Correct 138 ms 1388 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 4 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 141 ms 1408 KB Output is correct
9 Correct 138 ms 1388 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 380 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 3 ms 492 KB Output is correct
31 Correct 145 ms 1388 KB Output is correct
32 Correct 152 ms 1388 KB Output is correct
33 Correct 14 ms 1388 KB Output is correct
34 Correct 2 ms 1004 KB Output is correct
35 Correct 2 ms 1132 KB Output is correct
36 Correct 1 ms 620 KB Output is correct
37 Correct 2 ms 620 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 144 ms 1388 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 89 ms 1388 KB Output is correct
43 Correct 5 ms 1388 KB Output is correct
44 Correct 2 ms 492 KB Output is correct
45 Correct 109 ms 1388 KB Output is correct
46 Correct 39 ms 1408 KB Output is correct
47 Correct 1 ms 620 KB Output is correct
48 Correct 128 ms 1388 KB Output is correct
49 Correct 1 ms 492 KB Output is correct
50 Correct 147 ms 1388 KB Output is correct
51 Correct 5 ms 640 KB Output is correct
52 Correct 11 ms 1388 KB Output is correct
53 Correct 178 ms 1388 KB Output is correct
54 Correct 164 ms 1516 KB Output is correct
55 Correct 169 ms 1388 KB Output is correct
56 Correct 147 ms 1388 KB Output is correct
57 Correct 148 ms 1388 KB Output is correct
58 Correct 147 ms 1516 KB Output is correct