oj.uz

Submission #739033

# Submission time Handle Problem Language Result Execution time Memory
739033 2023-05-09T19:07:10 Z AverageAmogusEnjoyer Bank (IZhO14_bank) C++17
100 / 100
 110 ms 8572 KB 
/*
ID: dalpone1
TASK: bank 
LANG: C++
*/
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end() 
#define pb push_back
#define ll long long
#define nl '\n'
const int N = 20;
int dp[1 << N][2], n, m;
// dp[S][0] = max pref of people I can serve with bitmask S, dp[S][1] = remaining money
// dp[S][0] = for every i in S, if money[i] + dp[S^i][1] == needed[max(dp[S^(i)][0] + 1], dp[S][0] = maxself(dp[S^i][0] + 1), dp[S][1] = 0
int main() {
	// ifstream cin(".in");
	// ofstream cout(".out");
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	vector<int> A(n), B(m);
	for (auto &a: A)
		cin >> a;
	for (auto &b: B)
		cin >> b;
	int sz = 1 << m;
	for (int i = 0; i < sz; i++) {
		for (int j = 0; j < m; j++) {
			if ((i & (1 << j)) == 0) continue;
			bool makes_new_one = (A[dp[i ^ (1 << j)][0]] == dp[i ^ (1 << j)][1] + B[j]);
			if (dp[i][0] <= dp[i ^ (1 << j)][0] + makes_new_one) {
				dp[i][0] = dp[i ^ (1 << j)][0] + makes_new_one;
				if (dp[i][0] == n) {
					cout << "YES";
					return 0;
				}
				if (makes_new_one)
					dp[i][1] = 0;
				else
					dp[i][1] = dp[i ^ (1 << j)][1] + B[j];
			}
		}
	}
	cout << "NO"; 
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 328 KB Output is correct
5 Correct 69 ms 8420 KB Output is correct
6 Correct 1 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 79 ms 8432 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 324 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 460 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 2 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 456 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 1 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 1 ms 328 KB Output is correct
5 Correct 69 ms 8420 KB Output is correct
6 Correct 1 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 79 ms 8432 KB Output is correct
10 Correct 1 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 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 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 456 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 90 ms 8464 KB Output is correct
32 Correct 91 ms 8432 KB Output is correct
33 Correct 97 ms 8468 KB Output is correct
34 Correct 78 ms 8396 KB Output is correct
35 Correct 79 ms 8496 KB Output is correct
36 Correct 82 ms 8572 KB Output is correct
37 Correct 77 ms 8504 KB Output is correct
38 Correct 72 ms 8476 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 86 ms 8380 KB Output is correct
41 Correct 79 ms 8404 KB Output is correct
42 Correct 110 ms 8428 KB Output is correct
43 Correct 101 ms 8464 KB Output is correct
44 Correct 74 ms 8432 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 92 ms 8492 KB Output is correct
47 Correct 80 ms 8436 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 83 ms 8480 KB Output is correct
50 Correct 68 ms 8464 KB Output is correct
51 Correct 78 ms 8484 KB Output is correct
52 Correct 73 ms 8444 KB Output is correct
53 Correct 94 ms 8400 KB Output is correct
54 Correct 83 ms 8468 KB Output is correct
55 Correct 73 ms 8432 KB Output is correct
56 Correct 64 ms 8412 KB Output is correct
57 Correct 70 ms 8496 KB Output is correct
58 Correct 71 ms 8492 KB Output is correct