Submission #657591

# Submission time Handle Problem Language Result Execution time Memory
657591 2022-11-10T10:33:21 Z parsadox2 Bank (IZhO14_bank) C++14
100 / 100
71 ms 8564 KB
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define debug(x) cout << #x << " = " << x << " ";
#define fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define S second
#define F first

using namespace std;
const int maxn = 21;
int n , m , ar[maxn] , br[maxn] , sum[(1 << maxn)] , dp[(1 << maxn)] , ps[maxn];

int32_t main()
{
	fast;
	
	cin >> n >> m;
	for(int i = 1 ; i <= n ; i++)	cin >> ar[i];
	for(int i = 0 ; i < m ; i++)	cin >> br[i];
	for(int i = 1 ; i < (1 << m) ; i++)
	{
		for(int j = 0 ; j < m ; j++)
		{
			if((i >> j) & 1)
			{
				sum[i] = sum[(i ^ (1 << j))] + br[j];
				break;
			}
		}
				
	}
	bool flg = false;
	for(int i = 1 ; i <= n ; i++)	ps[i] = ps[i - 1] + ar[i];
	for(int mask = 1 ; mask < (1 << m) ; mask++)
	{
		for(int i = 0 ; i < m ; i++)
		{
			if((mask >> i) & 1)
			{
				int s = (mask ^ (1 << i));
				int tmp = dp[s];
				int sum1 = ps[tmp + 1] , sum2 = sum[mask];
				if(sum1 == sum2)
					tmp++;
				dp[mask] = max(dp[mask] , tmp);

			}
		}
		if(dp[mask] == n)
			flg = true;
	}
	cout << (flg ? "YES" : "NO") << endl;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 67 ms 8404 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 66 ms 8520 KB Output is correct
9 Correct 66 ms 8524 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 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 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 67 ms 8404 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 66 ms 8520 KB Output is correct
9 Correct 66 ms 8524 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 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 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 69 ms 8420 KB Output is correct
32 Correct 68 ms 8400 KB Output is correct
33 Correct 67 ms 8508 KB Output is correct
34 Correct 66 ms 8400 KB Output is correct
35 Correct 68 ms 8532 KB Output is correct
36 Correct 66 ms 8464 KB Output is correct
37 Correct 67 ms 8492 KB Output is correct
38 Correct 66 ms 8404 KB Output is correct
39 Correct 68 ms 8420 KB Output is correct
40 Correct 66 ms 8484 KB Output is correct
41 Correct 68 ms 8524 KB Output is correct
42 Correct 70 ms 8444 KB Output is correct
43 Correct 66 ms 8496 KB Output is correct
44 Correct 67 ms 8464 KB Output is correct
45 Correct 66 ms 8492 KB Output is correct
46 Correct 66 ms 8420 KB Output is correct
47 Correct 66 ms 8440 KB Output is correct
48 Correct 71 ms 8564 KB Output is correct
49 Correct 66 ms 8424 KB Output is correct
50 Correct 66 ms 8396 KB Output is correct
51 Correct 67 ms 8508 KB Output is correct
52 Correct 66 ms 8420 KB Output is correct
53 Correct 66 ms 8396 KB Output is correct
54 Correct 66 ms 8396 KB Output is correct
55 Correct 69 ms 8464 KB Output is correct
56 Correct 67 ms 8476 KB Output is correct
57 Correct 66 ms 8484 KB Output is correct
58 Correct 67 ms 8516 KB Output is correct