Submission #863621

# Submission time Handle Problem Language Result Execution time Memory
863621 2023-10-20T15:50:42 Z grate Bank (IZhO14_bank) C++17
100 / 100
84 ms 16984 KB
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
#define pll pair<ll, ll>
#define ppll pair<pll, ll>
#define fll(i, n) for (ll i =0 ; i < n; i++)
#define vll vector<ll>
#define prtv(V) fll(i, V.size()) cout << V[i] << " "; cout << '\n';
ll INF = 2e18;
 
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	ll n, m;
	cin >> n >> m;
	vll A(n), B(m); fll(i, n) cin >> A[i];
	fll(i, m) cin >> B[i];
	A.push_back(0);

	vector<pll> ans(1<<m, {0, INF});
	ans[0] = {0, A[0]};

	fll(s, 1<<m)
	{
		if (ans[s].first == n && !ans[s].second)
		{
			cout << "YES\n";
			return 0;
		}
		if (ans[s].second == INF) continue;
		fll(i, m)
			if (!(s&(1<<i)))
			{
				if (ans[s].second == B[i])
					ans[s|(1<<i)] = {ans[s].first+1, A[ans[s].first+1]};
				else if (ans[s].second > B[i])
					ans[s|(1<<i)] = {ans[s].first, ans[s].second-B[i]};
			}
	}	

	cout << "NO\n";
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 4 ms 16732 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 16732 KB Output is correct
9 Correct 80 ms 16732 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 500 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 4 ms 16732 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 16732 KB Output is correct
9 Correct 80 ms 16732 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 0 ms 500 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 65 ms 16732 KB Output is correct
32 Correct 77 ms 16728 KB Output is correct
33 Correct 11 ms 16732 KB Output is correct
34 Correct 4 ms 16728 KB Output is correct
35 Correct 5 ms 16732 KB Output is correct
36 Correct 5 ms 16696 KB Output is correct
37 Correct 4 ms 16732 KB Output is correct
38 Correct 4 ms 16732 KB Output is correct
39 Correct 3 ms 16732 KB Output is correct
40 Correct 4 ms 16732 KB Output is correct
41 Correct 4 ms 16732 KB Output is correct
42 Correct 46 ms 16732 KB Output is correct
43 Correct 6 ms 16732 KB Output is correct
44 Correct 5 ms 16732 KB Output is correct
45 Correct 3 ms 16732 KB Output is correct
46 Correct 22 ms 16732 KB Output is correct
47 Correct 4 ms 16732 KB Output is correct
48 Correct 3 ms 16732 KB Output is correct
49 Correct 4 ms 16732 KB Output is correct
50 Correct 75 ms 16732 KB Output is correct
51 Correct 5 ms 16732 KB Output is correct
52 Correct 8 ms 16732 KB Output is correct
53 Correct 84 ms 16732 KB Output is correct
54 Correct 76 ms 16984 KB Output is correct
55 Correct 74 ms 16732 KB Output is correct
56 Correct 78 ms 16732 KB Output is correct
57 Correct 83 ms 16728 KB Output is correct
58 Correct 77 ms 16732 KB Output is correct