
from manim import *







class        A_   (			__lowerCamelCase   ):




	'''simple docstring'''


	def 	SCREAMING_SNAKE_CASE__						(       self       ):
		lowercase       =    Rectangle(height=0.5		,    width=0.5       )
		lowercase       =    Rectangle(height=0.25		,    width=0.25       )
		lowercase       =    Rectangle(height=0.46		,    width=0.46       ).set_stroke(width=0       )

		lowercase       =    [mem.copy() for i in range(6       )]
		lowercase       =    [mem.copy() for i in range(6       )]
		lowercase       =    VGroup(*snake_case       ).arrange(snake_case		,    buff=0       )
		lowercase       =    VGroup(*snake_case       ).arrange(snake_case		,    buff=0       )
		lowercase       =    VGroup(snake_case		,    snake_case       ).arrange(snake_case		,    buff=0       )
		lowercase       =    Text('CPU'		,    font_size=24       )
		lowercase       =    Group(snake_case		,    snake_case       ).arrange(snake_case		,    buff=0.5		,    aligned_edge=snake_case       )
		cpu.move_to([-2.5, -0.5, 0]       )
		self.add(snake_case       )

		lowercase       =    [mem.copy() for i in range(4       )]
		lowercase       =    VGroup(*snake_case       ).arrange(snake_case		,    buff=0       )
		lowercase       =    Text('GPU'		,    font_size=24       )
		lowercase       =    Group(snake_case		,    snake_case       ).arrange(snake_case		,    buff=0.5		,    aligned_edge=snake_case       )
		gpu.move_to([-1, -1, 0]       )
		self.add(snake_case       )

		lowercase       =    [mem.copy() for i in range(6       )]
		lowercase       =    VGroup(*snake_case       ).arrange(snake_case		,    buff=0       )

		lowercase       =    Text('Model'		,    font_size=24       )
		lowercase       =    Group(snake_case		,    snake_case       ).arrange(snake_case		,    buff=0.5		,    aligned_edge=snake_case       )
		model.move_to([3, -1.0, 0]       )
		self.add(snake_case       )

		lowercase       =    []
		lowercase       =    []
		lowercase       =    []

		for i, rect in enumerate(snake_case       ):
			rect.set_stroke(snake_case       )

			lowercase       =    Rectangle(height=0.46 / 4		,    width=0.46 / 3       ).set_stroke(width=0.0       ).set_fill(snake_case		,    opacity=0.7       )

			if i == 0:
				cpu_target.next_to(cpu_left_col_base[0].get_corner(DOWN + LEFT       )		,    buff=0.02		,    direction=snake_case       )
				cpu_target.set_x(cpu_target.get_x() + 0.1       )
			elif i == 3:
				cpu_target.next_to(model_cpu_arr[0]		,    direction=snake_case		,    buff=0.0       )
			else:
				cpu_target.next_to(model_cpu_arr[i - 1]		,    direction=snake_case		,    buff=0.0       )
			self.add(snake_case       )
			model_cpu_arr.append(snake_case       )

		self.add(*snake_case		,    *snake_case		,    *snake_case       )

		lowercase       =    [mem.copy() for i in range(6       )]
		lowercase       =    VGroup(*snake_case       ).arrange(snake_case		,    buff=0       )

		lowercase       =    Text('Loaded Checkpoint'		,    font_size=24       )
		lowercase       =    Group(snake_case		,    snake_case       ).arrange(snake_case		,    buff=0.5		,    aligned_edge=snake_case       )
		checkpoint.move_to([3, 0.5, 0]       )

		self.add(snake_case       )

		lowercase       =    []
		lowercase       =    []

		for i, rect in enumerate(snake_case       ):
			lowercase       =    fill.copy().set_fill(snake_case		,    opacity=0.7       )
			target.move_to(snake_case       )
			ckpt_arr.append(snake_case       )

			lowercase       =    target.copy()
			if i < 5:
				cpu_target.move_to(cpu_left_col_base[i + 1]       )
			else:
				cpu_target.move_to(cpu_right_col_base[i - 5]       )
			ckpt_cpu_arr.append(snake_case       )
		self.add(*snake_case		,    *snake_case       )

		lowercase       =    Square(side_length=2.2       )
		key.move_to([-5, 2, 0]       )

		lowercase       =    MarkupText(
		    F'''<b>Key:</b>\n\n<span fgcolor=\'{YELLOW}\'>●</span> Empty Model'''		,    font_size=18		,    )

		key_text.move_to([-5, 2.4, 0]       )

		self.add(snake_case		,    snake_case       )

		lowercase       =    MarkupText(
		    F'''<span fgcolor=\'{BLUE}\'>●</span> Checkpoint'''		,    font_size=18		,    )

		blue_text.next_to(snake_case		,    DOWN * 2.4		,    aligned_edge=key_text.get_left()       )
		self.add(snake_case       )

		lowercase       =    MarkupText(
		    F'''Based on the passed in configuration, weights are stored in\na variety of np.memmaps on disk or to a particular device.'''		,    font_size=24		,    )
		step_a.move_to([2, 2, 0]       )

		lowercase       =    [meta_mem.copy() for i in range(6       )]
		lowercase       =    [meta_mem.copy() for i in range(6       )]
		lowercase       =    VGroup(*snake_case       ).arrange(snake_case		,    buff=0       )
		lowercase       =    VGroup(*snake_case       ).arrange(snake_case		,    buff=0       )
		lowercase       =    VGroup(snake_case		,    snake_case       ).arrange(snake_case		,    buff=0       )
		lowercase       =    Text('Disk'		,    font_size=24       )
		lowercase       =    Group(snake_case		,    snake_case       ).arrange(snake_case		,    buff=0.5		,    aligned_edge=snake_case       )
		disk.move_to([-4.0, -1.25, 0]       )
		self.play(Write(snake_case		,    run_time=3       )		,    Write(snake_case		,    run_time=1       )		,    Create(snake_case		,    run_time=1       )       )

		lowercase       =    []
		for i, rect in enumerate(snake_case       ):
			lowercase       =    rect.copy()
			target.generate_target()
			target.target.move_to(disk_left_col_base[i]       ).scale(0.5       )
			animations.append(MoveToTarget(snake_case		,    run_time=1.5       )       )
		self.play(*snake_case       )

		self.play(FadeOut(snake_case       )       )

		lowercase       =    MarkupText(F'''Then, the checkpoint is removed from memory\nthrough garbage collection.'''		,    font_size=24       )
		step_a.move_to([2, 2, 0]       )

		self.play(Write(snake_case		,    run_time=3       )       )

		self.play(
		    FadeOut(snake_case		,    snake_case		,    *snake_case		,    *snake_case       )		,    )

		self.wait()



def 							UpperCAmelCase_		(							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE							):
	global f  # a global dp table for knapsack
	if f[i][j] < 0:
		if j < wt[i - 1]:
			lowercase       =    mf_knapsack(i - 1 ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE							)
		else:
			lowercase       =    max(
			    mf_knapsack(i - 1 ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE							) ,							mf_knapsack(i - 1 ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							j - wt[i - 1]							) + val[i - 1] ,							)
		lowercase       =    val
	return f[i][j]






def 							UpperCAmelCase_		(							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE							):
	lowercase       =    [[0] * (w + 1) for _ in range(n + 1							)]

	for i in range(1 ,							n + 1							):
		for w_ in range(1 ,							w + 1							):
			if wt[i - 1] <= w_:
				lowercase       =    max(val[i - 1] + dp[i - 1][w_ - wt[i - 1]] ,							dp[i - 1][w_]							)
			else:
				lowercase       =    dp[i - 1][w_]

	return dp[n][w_], dp






def 							UpperCAmelCase_		(							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE							):
	if not (isinstance(__SCREAMING_SNAKE_CASE ,							(list, tuple)							) and isinstance(__SCREAMING_SNAKE_CASE ,							(list, tuple)							)):
		raise ValueError(
		    'Both the weights and values vectors must be either lists or tuples'							)

	lowercase       =    len(__SCREAMING_SNAKE_CASE							)
	if num_items != len(__SCREAMING_SNAKE_CASE							):
		lowercase       =    (
		    'The number of weights must be the same as the number of values.\n'
		    F'''But got {num_items} weights and {len(__SCREAMING_SNAKE_CASE							)} values'''
		)
		raise ValueError(__SCREAMING_SNAKE_CASE							)
	for i in range(__SCREAMING_SNAKE_CASE							):
		if not isinstance(wt[i] ,							__SCREAMING_SNAKE_CASE							):
			lowercase       =    (
			    'All weights must be integers but got weight of '
			    F'''type {type(wt[i]							)} at index {i}'''
			)
			raise TypeError(__SCREAMING_SNAKE_CASE							)

	lowercase  ,					lowercase       =    knapsack(__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE							)
	lowercase       =    set()
	_construct_solution(__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE							)

	return optimal_val, example_optional_set






def 							UpperCAmelCase_		(							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE							):
	# for the current item i at a maximum weight j to be part of an optimal subset,
	# the optimal value at (i, j) must be greater than the optimal value at (i-1, j).
	# where i - 1 means considering only the previous items at the given maximum weight
	if i > 0 and j > 0:
		if dp[i - 1][j] == dp[i][j]:
			_construct_solution(__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							i - 1 ,							__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE							)
		else:
			optimal_set.add(__SCREAMING_SNAKE_CASE							)
			_construct_solution(__SCREAMING_SNAKE_CASE ,							__SCREAMING_SNAKE_CASE ,							i - 1 ,							j - wt[i - 1] ,							__SCREAMING_SNAKE_CASE							)


if __name__ == "__main__":
	UpperCAmelCase	      = [3, 2, 4, 4]
	UpperCAmelCase	      = [4, 3, 2, 3]
	UpperCAmelCase	      = 4
	UpperCAmelCase	      = 6
	UpperCAmelCase	      = [[0] * (w + 1)] + [[0] + [-1] * (w + 1) for _ in range(n + 1)]
	UpperCAmelCase      , UpperCAmelCase	      = knapsack(w, wt, val, n)
	print(optimal_solution)
	print(mf_knapsack(n, wt, val, w))  # switched the n and w

	# testing the dynamic programming problem with example
	# the optimal subset for the above example are items 3 and 4
	UpperCAmelCase      , UpperCAmelCase	      = knapsack_with_example_solution(w, wt, val)
	assert optimal_solution == 8
	assert optimal_subset == {3, 4}
	print('''optimal_value = ''', optimal_solution)
	print('''An optimal subset corresponding to the optimal value''', optimal_subset)

