oj.uz

Submission #1007891

# Submission time Handle Problem Language Result Execution time Memory
1007891 2024-06-25T17:12:57 Z arashmemar Bank (IZhO14_bank) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
 
long long int a[30], b[30];
int dp[(1 << 20) + 20], ps[30];
 
 
int main()
{
	ifstream cin("stdin");
	ofstream cout("stdout");
	int n, m;
	cin >> n >> m;
	for (int i = 0;i < n;i++)
	{
		cin >> a[i];
	}
	ps[0] = a[0];
	for (int i = 1;i < n;i++)
	{
		ps[i] = ps[i-1] + a[i];
	}
	for (int i = 0;i < m;i++)
	{
		cin >> b[i];
	}
	for (long long int mask = 1; mask < (1 << m);mask++)
	{
		int c = 1;
		int s = 0;
		for (int i = 0;i < m;i++)
		{
			if (mask & c)
			{
				s += b[i];
				dp[mask] = max(dp[mask], dp[mask - c]);
			}
			c *= 2;
		}
		if (s == ps[dp[mask]])
		{
			dp[mask]++;
		}
	}
	if (dp[(1 << m) - 1] == n)
	{
		cout << "YES";
	}
	else
	{
		cout << "NO";
	}
	return 0;
}

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -