oj.uz

Submission #435974

# Submission time Handle Problem Language Result Execution time Memory
435974 2021-06-24T03:10:28 Z Tizariox Bank (IZhO14_bank) C++14
100 / 100
 436 ms 9648 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;

#define MOD 1000000007
#define nl "\n"
#define pb push_back

int n, m;

bool visited[(1 << 20)]{};
bool dp[(1 << 20)];

int salariesFilled[(1 << 20)];
int lastSalaryMoney[(1 << 20)];

int salaries[20];
int banknotes[20];

bool canPaySalaries(int mask) {
	if (mask == (1 << m) - 1) { // all banknotes have been used 
		return (salariesFilled[mask] == n);
	} else if (visited[mask]) {
		return dp[mask];
	}
	visited[mask] = true;
	int filled = salariesFilled[mask];
	int money = lastSalaryMoney[mask];
	for (int i = 0; i < m; i++) {
		if (!(mask & (1 << i))) { // banknote not in mask, we can try putting it in
			if (money + banknotes[i] == salaries[filled] && filled == n - 1) {
				dp[mask] = true;
				return true;
			} else if (money + banknotes[i] <= salaries[filled]) {
				if (canPaySalaries(mask + (1 << i))) {
					dp[mask] = true;
					return true;
				}
			} 
		}
	}
	return false;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> salaries[i];
	}
	for (int i = 0; i < m; i++) {
		cin >> banknotes[i];
	}
	for (int mask = 0; mask < (1 << m); mask++) {
		// we need to precalculate the number of salaries that each mask will fill, and the remaining money that will be put towards filling the next salary
		// it's assumed that each salary is able to be perfectly filled, as this is the only case in which we're using the precalculated values
		int sum = 0;
		salariesFilled[mask] = 0;
		for (int i = 0; i < m; i++) {
			if (mask & (1 << i)) {
				sum += banknotes[i];
			}
		}
		for (int i = 0; i < n; i++) {
			if (salaries[i] > sum) {
				lastSalaryMoney[mask] = sum;
				break;
			} else {
				sum -= salaries[i];
				salariesFilled[mask]++;
			}
		}
	}
	cout << (canPaySalaries(0) ? "YES" : "NO") << nl;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 67 ms 4420 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 68 ms 8520 KB Output is correct
9 Correct 409 ms 9532 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 67 ms 4420 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 68 ms 8520 KB Output is correct
9 Correct 409 ms 9532 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 3 ms 460 KB Output is correct
31 Correct 68 ms 8576 KB Output is correct
32 Correct 71 ms 8504 KB Output is correct
33 Correct 73 ms 9036 KB Output is correct
34 Correct 72 ms 8636 KB Output is correct
35 Correct 75 ms 8916 KB Output is correct
36 Correct 81 ms 8552 KB Output is correct
37 Correct 71 ms 4932 KB Output is correct
38 Correct 75 ms 4512 KB Output is correct
39 Correct 76 ms 8176 KB Output is correct
40 Correct 78 ms 8468 KB Output is correct
41 Correct 81 ms 8516 KB Output is correct
42 Correct 181 ms 9620 KB Output is correct
43 Correct 76 ms 9468 KB Output is correct
44 Correct 77 ms 8476 KB Output is correct
45 Correct 79 ms 8768 KB Output is correct
46 Correct 74 ms 9208 KB Output is correct
47 Correct 78 ms 8608 KB Output is correct
48 Correct 70 ms 8372 KB Output is correct
49 Correct 67 ms 4552 KB Output is correct
50 Correct 81 ms 8632 KB Output is correct
51 Correct 77 ms 8644 KB Output is correct
52 Correct 73 ms 8556 KB Output is correct
53 Correct 79 ms 8644 KB Output is correct
54 Correct 83 ms 8456 KB Output is correct
55 Correct 86 ms 8520 KB Output is correct
56 Correct 93 ms 8548 KB Output is correct
57 Correct 436 ms 9648 KB Output is correct
58 Correct 80 ms 8500 KB Output is correct