


'''simple docstring'''
from __future__ import annotations

import unittest

from transformers import is_tf_available
from transformers.testing_utils import require_sentencepiece, require_tf, require_tokenizers, slow


if is_tf_available():
		import numpy as np
		import tensorflow as tf

		from transformers import TFXLMRobertaModel
@require_tf
@require_sentencepiece
@require_tokenizers
class    lowercase	(							unittest.TestCase					):

		"""simple docstring"""

		@slow
		def     lowerCAmelCase__				(		self							):

							'''simple docstring'''


							UpperCamelCase__   :List[str]												= TFXLMRobertaModel.from_pretrained('''jplu/tf-xlm-roberta-base'''							)

							UpperCamelCase__   :int												= {
							    '''input_ids''': tf.convert_to_tensor([[0, 2646, 10269, 83, 99942, 2]]    ,   dtype=tf.intaa							),  # "My dog is cute"
							    '''attention_mask''': tf.convert_to_tensor([[1, 1, 1, 1, 1, 1]]    ,   dtype=tf.intaa							),
							}

							UpperCamelCase__   :Any												= model(UpperCamelCase_							)['''last_hidden_state''']
							UpperCamelCase__   :Any												= tf.TensorShape((1, 6, 768)							)
							self.assertEqual(output.shape    ,   UpperCamelCase_							)
							# compare the actual values for a slice.
							UpperCamelCase__   :Any												= tf.convert_to_tensor(
							    [
							        [
							            [0.0681762, 0.10894451, 0.06772504],
							            [-0.06423668, 0.02366615, 0.04329344],
							            [-0.06057295, 0.09974135, -0.00070584],
							        ]
							    ]    ,   dtype=tf.floataa    ,   )

							self.assertTrue(np.allclose(output[:, :3, :3].numpy()    ,   expected_slice.numpy()    ,   atol=1e-4							)							)



'''simple docstring'''
from collections import defaultdict
class    lowercase	:

		"""simple docstring"""

		def __init__(		self    ,   UpperCamelCase_    ,   UpperCamelCase_							):

							'''simple docstring'''


							UpperCamelCase__   :List[Any]												= total  # total no of tasks (N)

							# DP table will have a dimension of (2^M)*N
							# initially all values are set to -1
							UpperCamelCase__   :Union[str, Any]												= [
							    [-1 for i in range(total + 1							)] for j in range(2 ** len(UpperCamelCase_							)							)
							]

							UpperCamelCase__   :str												= defaultdict(UpperCamelCase_							)  # stores the list of persons for each task

							# final_mask is used to check if all persons are included by setting all bits
							# to 1
							UpperCamelCase__   :Optional[int]												= (1 << len(UpperCamelCase_							)) - 1




		def     lowerCAmelCase__				(		self    ,   UpperCamelCase_    ,   UpperCamelCase_							):

							'''simple docstring'''


							if mask == self.final_mask:
												return 1

							# if not everyone gets the task and no more tasks are available, return 0
							if task_no > self.total_tasks:
												return 0

							# if case already considered
							if self.dp[mask][task_no] != -1:
												return self.dp[mask][task_no]

							# Number of ways when we don't this task in the arrangement
							UpperCamelCase__   :str												= self.count_ways_until(UpperCamelCase_    ,   task_no + 1							)

							# now assign the tasks one by one to all possible persons and recursively
							# assign for the remaining tasks.
							if task_no in self.task:
												for p in self.task[task_no]:
																	# if p is already given a task
																	if mask & (1 << p):
																						continue

																	# assign this task to p and change the mask value. And recursively
																	# assign tasks with the new mask value.
																	total_ways_util += self.count_ways_until(mask | (1 << p)    ,   task_no + 1							)

        # save the value.
							UpperCamelCase__   :Optional[int]												= total_ways_util

							return self.dp[mask][task_no]




		def     lowerCAmelCase__				(		self    ,   UpperCamelCase_							):

							'''simple docstring'''


							for i in range(len(UpperCamelCase_							)							):
												for j in task_performed[i]:
																	self.task[j].append(UpperCamelCase_							)

        # call the function to fill the DP table, final answer is stored in dp[0][1]
							return self.count_ways_until(0    ,   1							)


if __name__ == "__main__":
		__snake_case							      =     5  # total no of tasks (the value of N)

		# the list of tasks that can be done by M persons.
		__snake_case							      =     [[1, 3, 4], [1, 2, 5], [3, 4]]
		print(
		    AssignmentUsingBitmask(task_performed, total_tasks).count_no_of_ways(
		        task_performed
		    )
		)