8171번 - Algorithm Speedup 다국어

As a punishment for misbehaving, Byteasar is to calculate a certain mysterious and nasty Boolean-valued function F(x,y), which is defined for a pair of positive integer sequences x=(x₁,…,x_n), y=(y₁,…,y_m) as follows:

boolean F(x,y)
if W(x)≠W(y) then return 0
else if |W(x)|=|W(y)|=1 then return 1
else return F(p(x),p(y)) ∧ F(s(x),s(y)).

Where:

• W(x) denotes the set of members of the sequence x (order and repetitions of elements are insignificant),
• p(x) denotes the longest prefix (initial part of any length) of the sequence x, such that W(x)≠W(p(x)),
• s(x) denotes the longest suffix (final part of any length) of the sequence x, such that W(x)≠W(s(x)),
• ∧ denotes the logical conjunction, 1 - true, 0 - false, and |z| - cardinality of set z.

For example, for the sequence x=(2,3,7,2,7,4,7,2,4) we have: W(x)={2,3,4,7}, p(x)=(2,3,7,2,7), s(x)=(7,2,7,4,7,2,4). For very large data a programme calculating values of the function F directly from definition is too slow by any standards. Therefore you are to make these calculations as fast as possible.

Write a programme that reads several pairs of sequences (x,y) from the standard input and prints out the values F(x,y) on the standard output for every input pair.

The first line of the standard input contains one integer k (1 ≤ k ≤ 13) denoting the number of sequence pairs to analyse. Next 3k line hold descriptions of test cases. The first line of each description contains two integers n and m (1 ≤ n,m ≤ 100,000) separated by a single space and denoting the lengths of the first and second sequence, respectively. The second line holds n integers x_i (1 ≤ x_i ≤ 100) that form the sequence x, separated by single spaces. The third line holds m integers y_i (1 ≤ y_i ≤ 100), that form the sequence y, separated by single spaces.

The output should consist of exactly k lines; the i-th line (for 1 ≤ i ≤ k) should contain a single integer - 0 or 1 - the value of F(x,y) for i-th test case.