CF1366E Two Arrays

You are given two arrays $ a_1, a_2, \dots , a_n $ and $ b_1, b_2, \dots , b_m $ . Array $ b $ is sorted in ascending order ( $ b_i < b_{i + 1} $ for each $ i $ from $ 1 $ to $ m - 1 $ ). You have to divide the array $ a $ into $ m $ consecutive subarrays so that, for each $ i $ from $ 1 $ to $ m $ , the minimum on the $ i $ -th subarray is equal to $ b_i $ . Note that each element belongs to exactly one subarray, and they are formed in such a way: the first several elements of $ a $ compose the first subarray, the next several elements of $ a $ compose the second subarray, and so on. For example, if $ a = [12, 10, 20, 20, 25, 30] $ and $ b = [10, 20, 30] $ then there are two good partitions of array $ a $ : 1. $ [12, 10, 20], [20, 25], [30] $ ; 2. $ [12, 10], [20, 20, 25], [30] $ . You have to calculate the number of ways to divide the array $ a $ . Since the number can be pretty large print it modulo 998244353.

N/A

N/A