Submission #354367

# Submission time Handle Problem Language Result Execution time Memory
354367 2021-01-21T19:49:56 Z ogibogi2004 Bank (IZhO14_bank) C++14
100 / 100
156 ms 1516 KB
#include<bits/stdc++.h>
using namespace std;
const int MAXN=22;
const int MAXM=(1<<MAXN);
bool dp[MAXM];
int a[MAXN],n,m;
int b[MAXN], pref[MAXN];
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		pref[i]=pref[i-1]+a[i];
	}
	for(int j=1;j<=m;j++)
	{
		cin>>b[j];
	}
	dp[0]=1;
	for(int mask=0;mask<(1<<m);mask++)
	{
		if(!dp[mask])continue;
		//cout<<mask<<endl;
		int i=0;
		int sum=0;
		for(int j=0;j<m;j++)
		{
			if(mask&(1<<j))
			{
				sum+=b[j+1];
			}
		}
		while(i<n&&pref[i+1]<=sum)
		{
			i++;
		}
		if(i==n)
		{
			cout<<"YES\n";
			return 0;
		}
		for(int j=0;j<m;j++)
		{
			if(!(mask&(1<<j)))
			{
				//cout<<sum<<" "<<b[j+1]<<" "<<pref[i+1]<<endl;
				if(sum+b[j+1]<=pref[i+1])
				{
					dp[mask|(1<<j)]=1;
				}
			}
		}
	}
	cout<<"NO\n";
	return 0;
return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 133 ms 1388 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 133 ms 1388 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Correct 0 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 0 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 119 ms 1388 KB Output is correct
32 Correct 141 ms 1516 KB Output is correct
33 Correct 13 ms 1388 KB Output is correct
34 Correct 2 ms 876 KB Output is correct
35 Correct 2 ms 1004 KB Output is correct
36 Correct 1 ms 492 KB Output is correct
37 Correct 2 ms 748 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 86 ms 1388 KB Output is correct
43 Correct 5 ms 1260 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 35 ms 1388 KB Output is correct
47 Correct 2 ms 492 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 152 ms 1388 KB Output is correct
51 Correct 4 ms 492 KB Output is correct
52 Correct 8 ms 1388 KB Output is correct
53 Correct 149 ms 1408 KB Output is correct
54 Correct 156 ms 1516 KB Output is correct
55 Correct 150 ms 1388 KB Output is correct
56 Correct 151 ms 1388 KB Output is correct
57 Correct 150 ms 1440 KB Output is correct
58 Correct 154 ms 1408 KB Output is correct