oj.uz

Submission #550765

# Submission time Handle Problem Language Result Execution time Memory
550765 2022-04-19T05:22:37 Z Karnis_052 Bank (IZhO14_bank) C++17
100 / 100
 724 ms 180976 KB 
// Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
using namespace std;
typedef long long int  ll;
typedef pair<int, int>PI;
typedef pair<ll, ll > PL;
typedef vector<int>VI;
typedef vector<ll>VL;
#define FF first
#define SS second
const int mod = 1e9 + 7;
const int INF = 1e9;
const int N = 20;
ll dp[22][(1 << N) + 5];
int main()
{
	ios::sync_with_stdio(false);   cin.tie(0); cout.tie(0);
	//freopen("bank.in", "r", stdin);
	//freopen("bank.out", "w", stdout);
	int n, m;
	cin >> n >> m;
	int a[n], b[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 <= 21; i++)
		for (int j = 0; j <= (1 << N); j++) dp[i][j] = -1;
	dp[0][0] = 0;
	for (int i = 0; i < n; i++)
	{
		for (int mask = 0; mask < (1 << m); mask++)
		{
			if (dp[i][mask] == -1) continue;
			for (int k = 0; k < m; k++)
				if (((mask >> k) & 1) == 0)
					dp[i][mask | (1 << k)] = dp[i][mask] + b[k];
		}
		for (int mask = 0; mask < (1 << m); mask++)
		{
			if (dp[i][mask] == a[i]) dp[i + 1][mask] = 0;
		}

	}
	bool f1 = 0;
	for (int mask = 0; mask < (1 << m); mask++)
		if (dp[n][mask] == 0) f1 = 1;
	if (f1)
		cout << "YES" << endl;
	else cout << "NO" << endl;

	cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 180816 KB Output is correct
2 Correct 80 ms 180848 KB Output is correct
3 Correct 70 ms 180828 KB Output is correct
4 Correct 69 ms 180812 KB Output is correct
5 Correct 132 ms 180876 KB Output is correct
6 Correct 75 ms 180760 KB Output is correct
7 Correct 76 ms 180792 KB Output is correct
8 Correct 129 ms 180816 KB Output is correct
9 Correct 135 ms 180976 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 180880 KB Output is correct
2 Correct 70 ms 180832 KB Output is correct
3 Correct 67 ms 180856 KB Output is correct
4 Correct 67 ms 180872 KB Output is correct
5 Correct 68 ms 180848 KB Output is correct
6 Correct 69 ms 180880 KB Output is correct
7 Correct 71 ms 180856 KB Output is correct
8 Correct 70 ms 180804 KB Output is correct
9 Correct 71 ms 180836 KB Output is correct
10 Correct 69 ms 180804 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 180800 KB Output is correct
2 Correct 69 ms 180828 KB Output is correct
3 Correct 72 ms 180840 KB Output is correct
4 Correct 72 ms 180848 KB Output is correct
5 Correct 71 ms 180872 KB Output is correct
6 Correct 70 ms 180752 KB Output is correct
7 Correct 71 ms 180800 KB Output is correct
8 Correct 72 ms 180864 KB Output is correct
9 Correct 79 ms 180876 KB Output is correct
10 Correct 73 ms 180796 KB Output is correct
11 Correct 72 ms 180884 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 180816 KB Output is correct
2 Correct 80 ms 180848 KB Output is correct
3 Correct 70 ms 180828 KB Output is correct
4 Correct 69 ms 180812 KB Output is correct
5 Correct 132 ms 180876 KB Output is correct
6 Correct 75 ms 180760 KB Output is correct
7 Correct 76 ms 180792 KB Output is correct
8 Correct 129 ms 180816 KB Output is correct
9 Correct 135 ms 180976 KB Output is correct
10 Correct 66 ms 180880 KB Output is correct
11 Correct 70 ms 180832 KB Output is correct
12 Correct 67 ms 180856 KB Output is correct
13 Correct 67 ms 180872 KB Output is correct
14 Correct 68 ms 180848 KB Output is correct
15 Correct 69 ms 180880 KB Output is correct
16 Correct 71 ms 180856 KB Output is correct
17 Correct 70 ms 180804 KB Output is correct
18 Correct 71 ms 180836 KB Output is correct
19 Correct 69 ms 180804 KB Output is correct
20 Correct 71 ms 180800 KB Output is correct
21 Correct 69 ms 180828 KB Output is correct
22 Correct 72 ms 180840 KB Output is correct
23 Correct 72 ms 180848 KB Output is correct
24 Correct 71 ms 180872 KB Output is correct
25 Correct 70 ms 180752 KB Output is correct
26 Correct 71 ms 180800 KB Output is correct
27 Correct 72 ms 180864 KB Output is correct
28 Correct 79 ms 180876 KB Output is correct
29 Correct 73 ms 180796 KB Output is correct
30 Correct 72 ms 180884 KB Output is correct
31 Correct 168 ms 180832 KB Output is correct
32 Correct 197 ms 180876 KB Output is correct
33 Correct 221 ms 180880 KB Output is correct
34 Correct 202 ms 180840 KB Output is correct
35 Correct 208 ms 180876 KB Output is correct
36 Correct 229 ms 180876 KB Output is correct
37 Correct 157 ms 180812 KB Output is correct
38 Correct 147 ms 180908 KB Output is correct
39 Correct 584 ms 180880 KB Output is correct
40 Correct 164 ms 180772 KB Output is correct
41 Correct 168 ms 180876 KB Output is correct
42 Correct 233 ms 180820 KB Output is correct
43 Correct 189 ms 180800 KB Output is correct
44 Correct 157 ms 180872 KB Output is correct
45 Correct 241 ms 180876 KB Output is correct
46 Correct 216 ms 180788 KB Output is correct
47 Correct 187 ms 180892 KB Output is correct
48 Correct 150 ms 180876 KB Output is correct
49 Correct 136 ms 180776 KB Output is correct
50 Correct 655 ms 180932 KB Output is correct
51 Correct 259 ms 180976 KB Output is correct
52 Correct 360 ms 180880 KB Output is correct
53 Correct 335 ms 180940 KB Output is correct
54 Correct 696 ms 180872 KB Output is correct
55 Correct 683 ms 180876 KB Output is correct
56 Correct 724 ms 180876 KB Output is correct
57 Correct 661 ms 180880 KB Output is correct
58 Correct 676 ms 180888 KB Output is correct